The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
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
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
Trapdoors 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
Efficient Identity-Based Encryption Without Random Oracles
Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_7 · Cited by 2,014
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
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
(2024) · doi:10.1145/3618260 · Cited by 1,730
Evaluating 2-DNF Formulas on Ciphertexts
Boneh, D., Goh, E.-J., & Nissim, K. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_18 · Cited by 1,692
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
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
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
Cited by
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-citationDecentralizing 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-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
Security and Privacy in Smart Health: Efficient Policy-Hiding Attribute-Based Access Control
Zhang, Y., Zheng, D., & Deng, R. H. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2825289 · Cited by 487
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
Metadata
- Authors
- Lewko, A., & Waters, B.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2010
- Pages
- 455-479
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1522101599
- Cited by
- 556
- References
- 19
- FWCI
- 39.50
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts. https://app.cochat.ai/papers/10.1007/978-3-642-11799-2_27
- The paper
- Lewko, A., & Waters, B. (2010). New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-11799-2_27
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.