The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
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
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
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
Self-citationLower 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
Revocation and Tracing Schemes for Stateless Receivers
Naor, D., Naor, M., & Lotspiech, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_3 · Cited by 1,118
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
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
Fiat, A., & Naor, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_40 · Cited by 728
Key establishment in large dynamic groups using one-way function trees
Sherman, A. T., & McGrew, D. A. (2003) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2003.1199073 · Cited by 713
Plutus: Scalable Secure File Sharing on Untrusted Storage
Kallahalla, M., Riedel, E., Swaminathan, R., Wang, Q., & Fu, K. E. (2003) · Cited by 666
SiRiUS: Securing Remote Untrusted Storage.
Goh, E.-J., Shacham, H., Modadugu, N., & Boneh, D. (2003) · Cited by 471
Self-citationChor, B., Fiat, A., & Naor, M. (1994) · International Cryptology Conference · Cited by 468
A One Round Protocol for Tripartite Diffie–Hellman
Joux, A. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0312-y · Cited by 452
A Verifiable Random Function with Short Proofs and Keys
Dodis, Y., & Yampolskiy, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30580-4_28 · Cited by 428
The LSD Broadcast Encryption Scheme
Halevy, D., & Shamir, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_4 · Cited by 411
Applications of multilinear forms to cryptography
Boneh, D., & Silverberg, A. (2003) · Contemporary Mathematics · doi:10.1090/conm/324/05731 · Cited by 395
Self-citationChor, B., Fiat, A., & Naor, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_25 · Cited by 366
Efficient Trace and Revoke Schemes
Naor, M., & Pinkas, B. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45472-1_1 · Cited by 298
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
Self-citationCombinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
Stinson, D. R., & Wei, R. (1998) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480196304246 · Cited by 275
Separating Decision Diffie–Hellman from Computational Diffie–Hellman in Cryptographic Groups
Joux, A., & Nguyen, K. (2003) · Journal of Cryptology · doi:10.1007/s00145-003-0052-4 · Cited by 239
On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption
Stinson, D. R. (1997) · Designs, Codes and Cryptography · doi:10.1023/a:1008268610932 · Cited by 166
Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups.
Joux, A., & Nguyen, K. T. (2001) · Cited by 143
Long-Lived Broadcast Encryption
Garay, J. A., Staddon, J., & Wool, A. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_21 · Cited by 136
Some New Results on Key Distribution Patterns and Broadcast Encryption
Stinson, D. R., & van Trung, T. (1998) · Designs Codes and Cryptography · doi:10.1023/a:1008209004667 · Cited by 115
Efficient trace and revoke schemes
Naor, M., & Benny Pinkas, B. (2010) · International Journal of Information Security · doi:10.1007/s10207-010-0121-2 · Cited by 115
A Quick Group Key Distribution Scheme with “Entity Revocation”
Anzai, J., Matsuzaki, N., & Matsumoto, T. (1999) · Lecture notes in computer science · doi:10.1007/978-3-540-48000-6_27 · Cited by 82
A Public-Key Traitor Tracing Scheme with Revocation Using Dynamic Shares
Tzeng, W.-G., & Tzeng, Z.-J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44586-2_16 · Cited by 79
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
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
Self-citationAttribute-based encryption with non-monotonic access structures
Ostrovsky, R., Sahai, A., & Waters, B. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315270 · Cited by 1,059
Self-citationDual 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-citationPinocchio: 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
Self-citation
Metadata
- Authors
- Boneh, D., Gentry, C., & Waters, B.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 258-275
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1905774212
- Cited by
- 1,047
- References
- 28
- FWCI
- 32.20
- 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.