The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Hierarchical ID-Based Cryptography
Open accessOverview
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
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
Identity-Based Cryptosystems and Signature Schemes
Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_5 · Cited by 6,635
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_30 · Cited by 2,993
Secure Integration of Asymmetric and Symmetric Encryption Schemes
Fujisaki, E., & Okamoto, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_34 · Cited by 1,132
An Identity Based Encryption Scheme Based on Quadratic Residues
Cocks, C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45325-3_32 · Cited by 1,102
Efficient Algorithms for Pairing-Based Cryptosystems
Barreto, P. S. L. M., Kim, H. Y., Lynn, B., & Scott, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_23 · Cited by 1,069
A One Round Protocol for Tripartite Diffie–Hellman
Joux, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/10722028_23 · Cited by 1,039
Perfectly-Secure Key Distribution for Dynamic Conferences
Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., & Yung, M. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_33 · Cited by 1,030
An Optimal Class of Symmetric Key Generation Systems
Blom, R. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39757-4_22 · Cited by 933
Cited by
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
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Certificateless Public Key Cryptography
Al-Riyami, S. S., & Paterson, K. G. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-40061-5_29 · Cited by 2,217
Efficient Identity-Based Encryption Without Random Oracles
Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_7 · Cited by 2,014
Waters, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19379-8_4 · Cited by 1,903
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
Boneh, D., Gentry, C., Lynn, B., & Shacham, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_26 · Cited by 1,821
Self-citationEfficient 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
Gentry, C., Sahai, A., & Waters, B. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_5 · Cited by 1,492
Self-citationHierarchical 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
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
Decentralizing Attribute-Based Encryption
Lewko, A., & Waters, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_31 · Cited by 1,194
Functional Encryption: Definitions and Challenges
Boneh, D., Sahai, A., & Waters, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19571-6_16 · Cited by 1,010
Signature Schemes and Anonymous Credentials from Bilinear Maps
Camenisch, J., & Lysyanskaya, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_4 · Cited by 982
Efficient Lattice (H)IBE in the Standard Model
Agrawal, S., Boneh, D., & Boyen, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_28 · Cited by 976
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
Waters, B. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_36 · Cited by 919
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
Practical Identity-Based Encryption Without Random Oracles
Gentry, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_27 · Cited by 805
Self-citationBonsai Trees, or How to Delegate a Lattice Basis
Cash, D., Hofheinz, D., Kiltz, E., & Peikert, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_27 · Cited by 711
A Forward-Secure Public-Key Encryption Scheme
Canetti, R., Halevi, S., & Katz, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_16 · Cited by 701
Identity-Based Proxy Re-encryption
Green, M., & Ateniese, G. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72738-5_19 · Cited by 640
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
Lewko, A., & Waters, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-11799-2_27 · Cited by 556
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
Okamoto, T., & Takashima, K. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_11 · Cited by 507
Hierarchical attribute-based encryption for fine-grained access control in cloud storage services
Wang, G., Liu, Q., & Wu, J. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866414 · Cited by 461
Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys
Delerablée, C. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-76900-2_12 · Cited by 447
Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
Barreto, P. S. L. M., Libert, B., McCullagh, N., & Quisquater, J.-J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11593447_28 · Cited by 437
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
Agrawal, S., Boneh, D., & Boyen, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_6 · Cited by 416
Chosen‐Ciphertext Security from Identity‐Based Encryption
Boneh, D., Canetti, R., Halevi, S., & Katz, J. (2007) · SIAM Journal on Computing · doi:10.1137/s009753970544713x · Cited by 415
Secure cloud-based EHR system using attribute-based cryptosystem and blockchain
Wang, H., & Song, Y. (2018) · Journal of Medical Systems · doi:10.1007/s10916-018-0994-6 · Cited by 409
Lewko, A., & Waters, B. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_12 · Cited by 371
Secure attribute-based systems
Pirretti, M., Traynor, P., McDaniel, P., & Waters, B. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180419 · Cited by 363
Patient controlled encryption: ensuring privacy of electronic medical records
Benaloh, J., Chase, M., Horvitz, E., & Lauter, K. (2009) · Proceedings of the 2009 ACM workshop on Cloud computing security · doi:10.1145/1655008.1655024 · Cited by 358
A Survey of Provably Secure Searchable Encryption
Bösch, C., Hartel, P., Jonker, W., & Peter, A. (2015) · ACM Computing Surveys · doi:10.1145/2636328 · Cited by 357
A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applications
Bresson, E., Catalano, D., & Pointcheval, D. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-40061-5_3 · Cited by 355
Unbounded HIBE and Attribute-Based Encryption
Lewko, A., & Waters, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_30 · Cited by 331
A Review on the State-of-the-Art Privacy-Preserving Approaches in the e-Health Clouds
Abbas, A., & Khan, S. U. (2014) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2014.2300846 · Cited by 331
A Survey of SIP Authentication and Key Agreement Schemes
Kilinc, H. H., & Yanik, T. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.091513.00050 · Cited by 312
Bonsai Trees, or How to Delegate a Lattice Basis
Cash, D., Hofheinz, D., Kiltz, E., & Peikert, C. (2012) · Journal of Cryptology · doi:10.1007/s00145-011-9105-2 · Cited by 297
Hierarchical Predicate Encryption for Inner-Products
Okamoto, T., & Takashima, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_13 · Cited by 290
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
Randomizable Proofs and Delegatable Anonymous Credentials
Belenkiy, M., Camenisch, J., Chase, M., Kohlweiss, M., Lysyanskaya, A., & Shacham, H. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_7 · Cited by 269
Wang, G., Liu, Q., Wu, J., & Guo, M. (2011) · Computers & Security · doi:10.1016/j.cose.2011.05.006 · Cited by 253
Metadata
- Authors
- Gentry, C., & Silverberg, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 548-566
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2145255308
- Cited by
- 1,088
- References
- 14
- FWCI
- 28.27
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.