A Ciphertext-Policy Attribute-Based Encryption Scheme with Constant Ciphertext Length
Open accessThe DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 1×
“Furthermore, as a difference of secret sharing [28] (in this case, “AND-gate only” means the unanimous structure, namely, the number of access structures is only 1), the number of access structures is ∏n i=1 ni.”
BackgroundIdentity-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 · cited 8×
“Several access structures such as the threshold structure [27], the tree-based access structure [5, 17], AND-gates on positive and negative attributes with wildcards [15], AND-gates on multi-valued attributes with wildcards [25], and the linear access structure [32] are used in previous ABE schemes.”
BackgroundMethodInfluentialAttribute-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
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
Efficient Identity-Based Encryption Without Random Oracles
Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_7 · Cited by 2,014
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_14 · Cited by 1,766
Conjunctive, Subset, and Range Queries on Encrypted Data
Boneh, D., & Waters, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70936-7_29 · Cited by 1,432
Hierarchical Identity Based Encryption with Constant Size Ciphertext
Boneh, D., Boyen, X., & Goh, E.-J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_26 · Cited by 1,334
Lower Bounds for Discrete Logarithms and Related Problems
Shoup, V. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_18 · Cited by 1,229
Multi-authority Attribute Based Encryption
Chase, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70936-7_28 · Cited by 1,112
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
Katz, J., Sahai, A., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_9 · Cited by 1,081
Chosen-Ciphertext Security from Identity-Based Encryption
Canetti, R., Halevi, S., & Katz, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_13 · Cited by 900
Provably secure ciphertext policy ABE
Cheung, L., & Newport, C. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315302 · Cited by 814
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
Boneh, D., & Boyen, X. (2008) · Journal of Cryptology · doi:10.1007/s00145-007-9005-7 · Cited by 605
New Explicit Conditions of Elliptic Curve Traces for FR-Reduction
Miyaji, A., Nakabayashi, M., & Takano, S. (2001) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · Cited by 590
Self-citationIEICE transactions on fundamentals of electronics, communications and computer sciences
電子情報通信学会 (1992) · Institute of Electronics, Information and Communication Engineers eBooks · Cited by 561
Bounded Ciphertext Policy Attribute Based Encryption
Goyal, V., Jain, A., Pandey, O., & Sahai, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70583-3_47 · Cited by 544
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
Boyen, X., & Waters, B. R. (2006) · Lecture notes in computer science · doi:10.1007/11818175_17 · Cited by 495
Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures
Nishide, T., Yoneyama, K., & Ohta, K. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68914-0_7 · Cited by 403
Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying
Reyzin, L., & Reyzin, N. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45450-0_11 · Cited by 295
Strongly Unforgeable Signatures Based on Computational Diffie-Hellman
Boneh, D., Shen, E., & Waters, B. (2006) · Lecture Notes in Computer Science · doi:10.1007/11745853_15 · Cited by 212
Secure Threshold Multi Authority Attribute Based Encryption without a Central Authority
Lin, H., Cao, Z., Liang, X., & Shao, J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89754-5_33 · Cited by 173
Efficient and Provable Secure Ciphertext-Policy Attribute-Based Encryption Schemes
Ibraimi, L., Tang, Q., Hartel, P., & Jonker, W. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00843-6_1 · Cited by 129
Identity-Based Encryption Gone Wild
Abdalla, M. F., Catalano, D., Dent, A. W., Malone-Lee, J., Neven, G., & Smart, N. P. (2006) · Lecture notes in computer science · doi:10.1007/11787006_26 · Cited by 122
Attribute-Based Broadcast Encryption Scheme Made Efficient
Lubicz, D., & Sirvent, T. (2008) · Springer eBooks · doi:10.1007/978-3-540-68164-9_22 · Cited by 68
Generic Transformation to Strongly Unforgeable Signatures
Huang, Q., Wong, D. S., & Zhao, Y. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72738-5_1 · Cited by 62
Cited by
Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts
Attrapadung, N., Libert, B., & de Panafieu, E. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19379-8_6 · Cited by 377
Towards secure mobile cloud computing: a survey
Khan, A. N., Mat Kiah, M. L., Khan, S. U., & Madani, S. A. (2013) · Future Generation Computer Systems · doi:10.1016/j.future.2012.08.003 · Cited by 368
An Efficient File Hierarchy Attribute-Based Encryption Scheme in Cloud Computing
Wang, S., Zhou, J., Liu, J. K., Yu, J., Chen, J., & Xie, W. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2523941 · Cited by 274
Attribute Based Encryption with Privacy Protection and Accountability for CloudIoT
Li, J., Zhang, Y., Ning, J., Huang, X., Poh, G. S., & Wang, D. (2022) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2020.2975184 · Cited by 258
Metadata
- Authors
- Emura, K., Miyaji, A., Nomura, A., Omote, K., & Soshi, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Volume
- 2
- Issue
- 1
- Pages
- 13-23
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1558439324
- Cited by
- 284
- References
- 28
- FWCI
- 7.05
- Type
- conference paper
- Language
- en
- Open access
- green
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
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.