The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Hierarchical Identity Based Encryption with Constant Size Ciphertext
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
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
Self-citationIdentity-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
Self-citationShort 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
Self-citationBoneh, D., Boyen, X., & Shacham, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_3 · Cited by 2,089
Self-citationEfficient 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
Self-citationShort Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0314-9 · Cited by 1,467
Self-citationShort 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
Self-citation
Cited by
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
Waters, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19379-8_4 · Cited by 1,903
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
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
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
Boneh, D., Gentry, C., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_16 · Cited by 1,047
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
Pinocchio: Nearly Practical Verifiable Computation
Parno, B., Howell, J., Gentry, C., & Raykova, M. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.47 · Cited by 864
Practical Identity-Based Encryption Without Random Oracles
Gentry, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_27 · Cited by 805
Quadratic Span Programs and Succinct NIZKs without PCPs
Gennaro, R., Gentry, C., Parno, B., & Raykova, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_37 · Cited by 724
Constant-Size Commitments to Polynomials and Their Applications
Kate, A., Zaverucha, G. M., & Goldberg, I. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_11 · Cited by 624
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
VABKS: Verifiable attribute-based keyword search over outsourced encrypted data
Zheng, Q., Xu, S., & Ateniese, G. (2014) · IEEE INFOCOM 2014 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2014.6847976 · Cited by 499
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
A Survey of Homomorphic Encryption for Nonspecialists
Fontaine, C., & Galand, F. (2007) · EURASIP Journal on Information Security · doi:10.1155/2007/13801 · Cited by 438
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
Self-citationChosen‐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
Self-citationExpressive 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
Lewko, A., & Waters, B. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_12 · Cited by 371
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
Unidirectional 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
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
Pairing-Based Cryptography at High Security Levels
Koblitz, N., & Menezes, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11586821_2 · Cited by 317
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
Freeman, D. M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_3 · Cited by 305
Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage
Chu, C.-K., Chow, S. S. M., Tzeng, W.-G., Zhou, J., & Deng, R. H. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.112 · Cited by 303
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 Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
Camenisch, J., Kohlweiss, M., & Soriente, C. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00468-1_27 · Cited by 288
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
Security Analysis of the Strong Diffie-Hellman Problem
Cheon, J. H. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_1 · Cited by 274
Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud
Liu, X., Zhang, Y., Wang, B., & Yan, J. (2013) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2012.331 · 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
Revocation Systems with Very Small Private Keys
Lewko, A., Sahai, A., & Waters, B. (2010) · 2010 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2010.23 · Cited by 260
Parno (2016) · doi:10.1145/2856449 · Cited by 212
Ullah, S., Zheng, J., Din, N., Hussain, M. T., Ullah, F., & Yousaf, M. (2023) · Computer Science Review · doi:10.1016/j.cosrev.2022.100530 · Cited by 195
SoK of used cryptography in blockchain
Raikwar, M., Gligoroski, D., & Kralevska, K. (2019) · IEEE Access · doi:10.1109/access.2019.2946983 · Cited by 153
A secure data self-destructing scheme in cloud computing
Xiong, J., Liu, X., Yao, Z., Ma, J., Li, Q., Geng, K., & Chen, P. S. (2014) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2014.2372758 · Cited by 80
Dynamic Decentralized Functional Encryption
Chotard, J., Dufour-Sans, E., Gay, R., Phan, D. H., & Pointcheval, D. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-56784-2_25 · Cited by 54
Metadata
- Authors
- Boneh, D., Boyen, X., & Goh, E.-J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 440-456
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2116556172
- Cited by
- 1,334
- References
- 25
- FWCI
- 42.21
- 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.