ZK-PPR-ABE: A Zero-Knowledge Privacy-Preserving Data Sharing Scheme

Ciphertext-policy attribute-based encryption (CP-ABE) is a suitable cryptographic technique for fine-grained data sharing in the Internet of Vehicles (IoV). However, in a highly dynamic IoV environment, existing revocable attribute-based encryption (ABE) schemes face two major challenges: ciphertext re-encryption during user revocation results in high system overhead, while identity exposure during permission verification may lead to location-privacy leakage. To address these issues, this paper proposes a privacy-preserving revocable ABE scheme based on zero-knowledge proof (ZK-PPR-ABE). First, a Merkle hash tree (MHT) is used to separate the revocation status from the ciphertext. Each revocation updates the hashes along the affected MHT path and publishes a path-update package containing the changed node hashes, while the cloud ciphertext remains unchanged. Second, the scheme combines Paillier ciphertext re-randomization with zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) in a blind decryption protocol to reduce the exposure of user credentials and request information during revocation verification. The security analysis establishes selective indistinguishability under chosen-plaintext attack (selective IND-CPA), collusion resistance, and request privacy under the defined indistinguishability-of-requests (IND-REQ) model. Experiments show that the scheme provides efficient revocation and scalable ciphertext storage for large-scale IoV scenarios.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2026-11-08
DOI
https://doi.org/10.3390/app162111057
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

ZK-PPR-ABE: A Zero-Knowledge Privacy-Preserving Data Sharing Scheme

Jun Ye, Shaojian Zhang
Applied Sciences
Cryptography and Data Security
article

ZK-PPR-ABE: A Zero-Knowledge Privacy-Preserving Data Sharing Scheme

Jun Ye, Shaojian Zhang
article en

Abstract

Ciphertext-policy attribute-based encryption (CP-ABE) is a suitable cryptographic technique for fine-grained data sharing in the Internet of Vehicles (IoV). However, in a highly dynamic IoV environment, existing revocable attribute-based encryption (ABE) schemes face two major challenges: ciphertext re-encryption during user revocation results in high system overhead, while identity exposure during permission verification may lead to location-privacy leakage. To address these issues, this paper proposes a privacy-preserving revocable ABE scheme based on zero-knowledge proof (ZK-PPR-ABE). First, a Merkle hash tree (MHT) is used to separate the revocation status from the ciphertext. Each revocation updates the hashes along the affected MHT path and publishes a path-update package containing the changed node hashes, while the cloud ciphertext remains unchanged. Second, the scheme combines Paillier ciphertext re-randomization with zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) in a blind decryption protocol to reduce the exposure of user credentials and request information during revocation verification. The security analysis establishes selective indistinguishability under chosen-plaintext attack (selective IND-CPA), collusion resistance, and request privacy under the defined indistinguishability-of-requests (IND-REQ) model. Experiments show that the scheme provides efficient revocation and scalable ciphertext storage for large-scale IoV scenarios.

Applied SciencesVol. 16(21)
Hainan University (CN)
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon