Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption
The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
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
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
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-citationUniversally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
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 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-citationA Pseudorandom Generator from any One-way Function
HÅstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539793244708 · Cited by 1,653
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Cramer, R., & Shoup, V. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055717 · Cited by 1,437
New hash functions and their use in authentication and set equality
Wegman, M. N., & Carter, J. L. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90033-7 · Cited by 1,402 · cited 1×
“, almost strongly universal hash families [35].”
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
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
Rackoff, C., & Simon, D. R. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_35 · Cited by 1,039
Dolev, D., Dwork, C., & Naor, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103474 · Cited by 990
The random oracle methodology, revisited
Canetti, R., Goldreich, O., & Halevi, S. (2004) · Journal of the ACM · doi:10.1145/1008731.1008734 · Cited by 978
Universal one-way hash functions and their cryptographic applications
Naor, M., & Yung, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73011 · Cited by 959
Non-interactive zero-knowledge and its applications
Blum, M., Feldman, P., & Micali, S. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62222 · Cited by 904
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
Self-citationUniversal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
Cramer, R., & Shoup, V. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_4 · Cited by 831
Relations among notions of security for public-key encryption schemes
Bellare, M., Desai, A., Pointcheval, D., & Rogaway, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055718 · Cited by 810
Dolev, D., Dwork, C., & Naor, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795291562 · Cited by 746
The random oracle methodology, revisited (preliminary version)
Canetti, R., Goldreich, O., & Halevi, S. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276741 · Cited by 715
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
Self-citationConstructing Digital Signatures from a One Way Function
Lamport, L. (2016) · Cited by 657
Secure Identity Based Encryption Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28628-8_27 · Cited by 621
Self-citationChosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1
Bleichenbacher, D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055716 · Cited by 590
Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
Sahai, A. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814628 · Cited by 575
Practical Verifiable Encryption and Decryption of Discrete Logarithms
Camenisch, J., & Shoup, V. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_8 · Cited by 541
A Framework for Password-Based Authenticated Key Exchange
Gennaro, R., & Lindell, Y. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_33 · Cited by 292
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
Halevi, S., & Micali, S. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_16 · Cited by 210
The Impact of Decryption Failures on the Security of NTRU Encryption
Howgrave-Graham, N., Nguyễn, P. Q., Pointcheval, D., Proos, J., Silverman, J. H., Singer, A., & Whyte, W. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45146-4_14 · Cited by 127
On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures
Damgård, I., Pedersen, T. P., & Pfitzmann, B. (2007) · Springer eBooks · doi:10.1007/3-540-48329-2_22 · Cited by 103
Why Chosen Ciphertext Security Matters
Shoup, V. (2000) · Cited by 61
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
Efficient 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-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-citationLewko, 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
Metadata
- Authors
- Boneh, D., & Katz, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 87-103
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1486107224
- Cited by
- 283
- References
- 34
- FWCI
- 22.66
- 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.