The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Efficient Identity-Based Encryption Without Random Oracles
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
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
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
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
Short Signatures Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_4 · Cited by 1,447
Hierarchical ID-Based Cryptography
Gentry, C., & Silverberg, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_34 · Cited by 1,088
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
Cited by
Fuzzy Identity-Based Encryption
Sahai, A., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_27 · Cited by 4,440
Self-citationTrapdoors for hard lattices and new cryptographic constructions
Gentry, C., Peikert, C., & Vaikuntanathan, V. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374407 · Cited by 2,435
Waters, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19379-8_4 · Cited by 1,903
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
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
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
Self-citationTrapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Micciancio, D., & Peikert, C. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_41 · Cited by 1,224
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
Self-citationPredicate 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
Self-citationEfficient Non-interactive Proof Systems for Bilinear Groups
Groth, J., & Sahai, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_24 · Cited by 1,076
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
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
Self-citationEfficient 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
Self-citationChosen-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
Security in cloud computing: Opportunities and challenges
Ali, M., Khan, S. U., & Vasilakos, A. V. (2015) · Information Sciences · doi:10.1016/j.ins.2015.01.025 · Cited by 829
Practical Identity-Based Encryption Without Random Oracles
Gentry, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_27 · Cited by 805
Deterministic and Efficiently Searchable Encryption
Bellare, M., Boldyreva, A., & O’Neill, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_30 · Cited by 745
Bonsai 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
Charm: a framework for rapidly prototyping cryptosystems
Akinyele, J. A., Garman, C., Miers, I., Pagano, M. W., Rushanan, M., Green, M., & Rubin, A. D. (2013) · Journal of Cryptographic Engineering · doi:10.1007/s13389-013-0057-3 · Cited by 675
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
Self-citationFully 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
Data Security and Privacy Protection for Cloud Storage: A Survey
Yang, P., Xiong, N., & Ren, J. (2020) · IEEE Access · doi:10.1109/access.2020.3009876 · Cited by 502
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
Practical constructions and new proof methods for large universe attribute-based encryption
Rouselakis, Y., & Waters, B. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516672 · Cited by 446
Self-citationMaji, H. K., Prabhakaran, M., & Rosulek, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19074-2_24 · Cited by 437
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
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Groth, J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11935230_29 · Cited by 390
Identity-Based Encryption with Outsourced Revocation in Cloud Computing
Li, J., Li, J., Chen, X., Jia, C., & Lou, W. (2015) · IEEE Transactions on Computers · doi:10.1109/tc.2013.208 · Cited by 377
Lewko, A., & Waters, B. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_12 · Cited by 371
Self-citationSequential Aggregate Signatures and Multisignatures Without Random Oracles
Lu, S., Ostrovsky, R., Sahai, A., Shacham, H., & Waters, B. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_28 · Cited by 355
Self-citationUnidirectional Chosen-Ciphertext Secure Proxy Re-encryption
Libert, B., & Vergnaud, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78440-1_21 · Cited by 339
Witness encryption and its applications
Garg, S., Gentry, C., Sahai, A., & Waters, B. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488667 · Cited by 333
Self-citationUnbounded 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
Self-citationPairing-Based Cryptography at High Security Levels
Koblitz, N., & Menezes, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11586821_2 · Cited by 317
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
A Ciphertext-Policy Attribute-Based Encryption Scheme with Constant Ciphertext Length
Emura, K., Miyaji, A., Nomura, A., Omote, K., & Soshi, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00843-6_2 · Cited by 284
Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption
Boneh, D., & Katz, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30574-3_8 · Cited by 283
Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
Boyen, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13013-7_29 · Cited by 254
Realizing an Internet of Secure Things: A Survey on Issues and Enabling Technologies
Hamad, S. A., Sheng, Q. Z., Zhang, W. E., & Nepal, S. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2976075 · Cited by 100
Metadata
- Authors
- Waters, B.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 114-127
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1592092778
- Cited by
- 2,014
- References
- 16
- FWCI
- 67.02
- Type
- conference paper
- 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
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.