The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
A Traceable and Revocable Ciphertext-Policy Attribute-based Encryption Scheme Based on Privacy Protection
Abstract
Considered as a promising fine-grained access control mechanism for data sharing without a centralized trusted third-party, the access policy in a plaintext form may reveal sensitive information in the traditional CP-ABE method. To address this issue, a hidden policy needs to be applied to the CP-ABE scheme, as the identity of a user cannot be accurately confirmed when the decryption key is leaked, so the malicious user is traced and revoked as demanded. In this article, a CP-ABE scheme that realizes revocation, white-box traceability, and the application of hidden policy is proposed, and such ciphertext is composed of two parts. One is related to the access policy encrypted by the attribute value, and only the attribute name is evident in the access policy. Another is related to the revocation information and updated when revoking, where the revocation information is generated by the binary tree related to users. The leaf node value of a binary tree in the decryption key is used to trace the malicious user. From experimental results, it is shown that the proposed scheme is proven to be IND-CPA secure under the chosen plaintext attacks and selective access policy based on the decisional q-BDHE assumption in the standard model, efficient, and promising.
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
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_13 · Cited by 7,060
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
Attribute-based encryption for fine-grained access control of encrypted data
Goyal, V., Pandey, O., Sahai, A., & Waters, B. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180418 · Cited by 5,009
Fuzzy Identity-Based Encryption
Sahai, A., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_27 · Cited by 4,440
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Attribute-Based Access Control with Efficient Revocation in Data Outsourcing Systems
Hur, J., & Noh, D. K. (2011) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2010.203 · Cited by 612
Security and Privacy in Smart Health: Efficient Policy-Hiding Attribute-Based Access Control
Zhang, Y., Zheng, D., & Deng, R. H. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2825289 · Cited by 487
Secure Data Storage and Recovery in Industrial Blockchain Network Environments
Liang, W., Fan, Y., Li, K.-C., Zhang, D., & Gaudiot, J.-L. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.2966069 · Cited by 279
Self-citationA Secure FaBric Blockchain-Based Data Transmission Technique for Industrial Internet-of-Things
Liang, W., Tang, M., Long, J., Peng, X., Xu, J., & Li, K.-C. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2907092 · Cited by 242
Self-citationLiu, Z., Cao, Z., & Wong, D. S. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2012.2223683 · Cited by 240
Metadata
- Authors
- Han, D., Pan, N., & Li, K.-C.
- Venue
- IEEE Transactions on Dependable and Secure Computing
- Published
- 2022-01-01
- Volume
- 19
- Issue
- 1
- Pages
- 316-327
- ISSN
- 1545-5971 (ISSN-L)
- 1941-0018
- 2160-9209
- OpenAlex
- W3010457411
- Cited by
- 292
- References
- 33
- FWCI
- 12.31
- 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: A Traceable and Revocable Ciphertext-Policy Attribute-based Encryption Scheme Based on Privacy Protection. https://app.cochat.ai/papers/10.1109/tdsc.2020.2977646
- The paper
- Han, D., Pan, N., & Li, K.-C. (2022). A Traceable and Revocable Ciphertext-Policy Attribute-based Encryption Scheme Based on Privacy Protection. IEEE Transactions on Dependable and Secure Computing. https://doi.org/10.1109/tdsc.2020.2977646
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.