The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Chosen‐Ciphertext Security from Identity‐Based Encryption
Abstract
We propose simple and efficient CCA‐secure public‐key encryption schemes (i.e., schemes secure against adaptive chosen‐ciphertext attacks) based on any identity‐based encryption (IBE) scheme. Our constructions have ramifications of both theoretical and practical interest. First, our schemes give a new paradigm for achieving CCA‐security; this paradigm avoids “proofs of well‐formedness” that have been shown to underlie previous constructions. Second, instantiating our construction using known IBE constructions we obtain CCA‐secure encryption schemes whose performance is competitive with the most efficient CCA‐secure schemes to date. Our techniques extend naturally to give an efficient method for securing IBE schemes (even hierarchical ones) against adaptive chosen‐ciphertext attacks. Coupled with previous work, this gives the first efficient constructions of CCA‐secure IBE schemes.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
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
Self-citationGoldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Goldreich, O. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546891 · Cited by 2,181
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
Short 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-citationA 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
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
Self-citationDesmedt, Y., & Frankel, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_28 · Cited by 1,131
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
Public-key cryptosystems provably secure against chosen ciphertext attacks
Naor, M., & Yung, M. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100273 · Cited by 1,088
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
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
Self-citationCramer, R., & Shoup, V. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702403773 · Cited by 978
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-citationPairing-Friendly Elliptic Curves of Prime Order
Barreto, P. S. L. M., & Naehrig, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11693383_22 · Cited by 877
Universal 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
Practical Identity-Based Encryption Without Random Oracles
Gentry, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_27 · Cited by 805
Selecting Cryptographic Key Sizes
Lenstra, A. K., & Verheul, E. R. (2001) · Journal of Cryptology · doi:10.1007/s00145-001-0009-4 · Cited by 784
Dolev, D., Dwork, C., & Naor, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795291562 · Cited by 746
One-way functions are necessary and sufficient for secure signatures
Rompel, J. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100269 · Cited by 695
Constructing 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
Toward Hierarchical Identity-Based Encryption
Horwitz, J., & Lynn, B. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46035-7_31 · Cited by 584
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
New Explicit Conditions of Elliptic Curve Traces for FR-Reduction
Miyaji, A., Nakabayashi, M., & Takano, S. (2001) · Institutional Repositories DataBase (IRDB) · Cited by 509
On-line/off-line digital signatures
Even, S., Goldreich, O., & Micali, S. (1996) · Journal of Cryptology · doi:10.1007/bf02254791 · Cited by 318
Relaxing Chosen-Ciphertext Security
Canetti, R., Krawczyk, H., & Nielsen, J. B. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_33 · Cited by 304
Self-citationA 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
Universal hashing and authentication codes
Stinson, D. R. (1994) · Designs, Codes and Cryptography · doi:10.1007/bf01388651 · Cited by 292
A Forward-Secure Public-Key Encryption Scheme
Canetti, R., Halevi, S., & Katz, J. I. (2007) · Journal of Cryptology · doi:10.1007/s00145-006-0442-5 · Cited by 284
Self-citationImproved 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-citationPractical 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
Self-citationThe Notion of Security for Probabilistic Cryptosystems
Micali, S., Rackoff, C., & Sloan, B. (1988) · SIAM Journal on Computing · doi:10.1137/0217025 · Cited by 161
Non-interactive and non-malleable commitment
Crescenzo, G. D., Ishai, Y., & Ostrovsky, R. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276722 · Cited by 159
A uniform-complexity treatment of encryption and zero-knowledge
Goldreich, O. (1993) · Journal of Cryptology · doi:10.1007/bf02620230 · Cited by 132
Efficient and Non-interactive Non-malleable Commitment
Crescenzo, G. D., Katz, J. I., Ostrovsky, R., & Smith, A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_4 · Cited by 121
Self-citationOn 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
Alternatives to Non-malleability: Definitions, Constructions, and Applications
MACKENZIE, P. D., Reiter, M. K., & Yang, K. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24638-1_10 · Cited by 79
Recommendation for Key Management, Part 1: General
Barker, E. B., Barker, W. C., Burr, W. E., Polk, W. T., & Smid, M. E. (2005) · doi:10.1002/https://dx.doi.org/10.6028/nist.sp.800-57p1 · Cited by 69
Why Chosen Ciphertext Security Matters
Shoup, V. (2000) · Cited by 61
On Chosen Ciphertext Security of Multiple Encryptions.
Goldreich, O., Lustig, Y., & Naor, M. (2002) · Cited by 7
Cited by
Trapdoors 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
Efficient 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
Self-citationBonsai 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
Lossy Trapdoor Functions and Their Applications
Peikert, C., & Waters, B. (2011) · SIAM Journal on Computing · doi:10.1137/080733954 · Cited by 649
Secure Integration of Asymmetric and Symmetric Encryption Schemes
Fujisaki, E., & Okamoto, T. (2013) · Journal of Cryptology · doi:10.1007/s00145-011-9114-1 · Cited by 402
Metadata
- Authors
- Boneh, D., Canetti, R., Halevi, S., & Katz, J.
- Venue
- SIAM Journal on Computing
- Published
- 2007-01
- Volume
- 36
- Issue
- 5
- Pages
- 1301-1328
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W1973801321
- Cited by
- 415
- References
- 54
- FWCI
- 29.85
- Type
- journal article
- 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.