The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Privacy-Preserving Decentralized Key-Policy Attribute-Based Encryption
Abstract
Decentralized attribute-based encryption (ABE) is a variant of a multiauthority ABE scheme where each authority can issue secret keys to the user independently without any cooperation and a central authority. This is in contrast to the previous constructions, where multiple authorities must be online and setup the system interactively, which is impractical. Hence, it is clear that a decentralized ABE scheme eliminates the heavy communication cost and the need for collaborative computation in the setup stage. Furthermore, every authority can join or leave the system freely without the necessity of reinitializing the system. In contemporary multiauthority ABE schemes, a user's secret keys from different authorities must be tied to his global identifier (GID) to resist the collusion attack. However, this will compromise the user's privacy. Multiple authorities can collaborate to trace the user by his GID, collect his attributes, then impersonate him. Therefore, constructing a decentralized ABE scheme with privacy-preserving remains a challenging research problem. In this paper, we propose a privacy-preserving decentralized key-policy ABE scheme where each authority can issue secret keys to a user independently without knowing anything about his GID. Therefore, even if multiple authorities are corrupted, they cannot collect the user's attributes by tracing his GID. Notably, our scheme only requires standard complexity assumptions (e.g., decisional bilinear Diffie-Hellman) and does not require any cooperation between the multiple authorities, in contrast to the previous comparable scheme that requires nonstandard complexity assumptions (e.g., q-decisional Diffie-Hellman inversion) and interactions among multiple authorities. To the best of our knowledge, it is the first decentralized ABE scheme with privacy-preserving based on standard complexity assumptions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ciphertext-Policy Attribute-Based Encryption
Bethencourt, J., Sahai, A., & Waters, B. (2007) · 2007 IEEE Symposium on Security and Privacy (SP '07) · doi:10.1109/sp.2007.11 · Cited by 5,131
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
Camenisch, J., & Lysyanskaya, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_7 · Cited by 1,321
Lewko, A., Okamoto, T., Sahai, A., Takashima, K., & Waters, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_4 · Cited by 1,313
Cited by
Yang, Y., Zheng, X., Guo, W., Liu, X., & Chang, V. (2019) · Information Sciences · doi:10.1016/j.ins.2018.02.005 · Cited by 364
KSF-OABE: Outsourced Attribute-Based Encryption with Keyword Search Function for Cloud Storage
Li, J., Lin, X., Zhang, Y., & Han, J. (2017) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2016.2542813 · Cited by 321
Self-citationFlexible and Fine-Grained Attribute-Based Data Storage in Cloud Computing
Li, J., Yao, W., Zhang, Y., Qian, H., & Han, J. (2017) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2016.2520932 · Cited by 309
Self-citationBarua, P. D., Vicnesh, J., Gururajan, R., Oh, S. L., Palmer, E., Azizan, M. M., Kadri, N. A., & Acharya, U. R. (2022) · International Journal of Environmental Research and Public Health · doi:10.3390/ijerph19031192 · Cited by 270
Metadata
- Authors
- Han, J., Susilo, W., Mu, Y., & Yan, J.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2012-11
- Volume
- 23
- Issue
- 11
- Pages
- 2150-2162
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2034562114
- Cited by
- 174
- References
- 3
- FWCI
- 8.23
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Privacy-Preserving Decentralized Key-Policy Attribute-Based Encryption. https://app.cochat.ai/papers/10.1109/tpds.2012.50
- The paper
- Han, J., Susilo, W., Mu, Y., & Yan, J. (2012). Privacy-Preserving Decentralized Key-Policy Attribute-Based Encryption. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2012.50
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.