The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
Abstract
A new public-key encryption scheme, along with several variants, is proposed and analyzed. The scheme and its variants are quite practical and are proved secure against adaptive chosen ciphertext attack under standard intractability assumptions. These appear to be the first public-key encryption schemes in the literature that are simultaneously practical and provably secure.
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
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
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
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Elliptic Curves in Cryptography
Blake, I. F., Seroussi, G., & Smart, N. P. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9781107360211 · Cited by 1,828
A 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
Self-citationA hard-core predicate for all one-way functions
Goldreich, O., & Levin, L. A. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73010 · Cited by 1,193
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
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
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
Bellare, M., & Rogaway, P. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053428 · Cited by 906
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
Self-citation(2018) · Optimization Models · doi:10.1017/cbo9781107279667.013 · Cited by 818
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
Pseudo-random generation from one-way functions
Impagliazzo, R., Levin, L. A., & Luby, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73009 · Cited by 724
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
Chosen 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
Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements
Bellare, M., Boldyreva, A., & Micali, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_18 · Cited by 519
Optimistic fair exchange of digital signatures
Asokan, N., Shoup, V., & Waidner, M. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.839935 · Cited by 480
Self-citationThe Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
Okamoto, T., & Pointcheval, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_8 · Cited by 477
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
Abdalla, M., Bellare, M., & Rogaway, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_12 · Cited by 445
Impagliazzo, R., & Zuckerman, D. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63486 · Cited by 387
Number-theoretic constructions of efficient pseudo-random functions
Naor, M., & Reingold, O. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646134 · Cited by 353
The Discrete Logarithm Problem on Elliptic Curves of Trace One
Smart, N. P. (1999) · Journal of Cryptology · doi:10.1007/s001459900052 · Cited by 343
Signature schemes based on the strong RSA assumption
Cramer, R., & Shoup, V. (2000) · ACM Transactions on Information and System Security · doi:10.1145/357830.357847 · Cited by 325
Self-citationA Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
Bateman, P. T., & Horn, R. A. (1962) · Mathematics of Computation · doi:10.1090/s0025-5718-1962-0148632-7 · Cited by 323
On Formal Models for Secure Key Exchange.
Shoup, V. (1999) · Cited by 322
Self-citationShoup, V. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_15 · Cited by 300
Self-citationFinding collisions on a one-way street: Can secure hash functions be based on general assumptions?
Simon, D. R. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054137 · Cited by 280
Securing threshold cryptosystems against chosen ciphertext attack
Shoup, V., & Gennaro, R. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054113 · Cited by 257
Self-citationFast Exponentiation with Precomputation
Brickell, E. F., Gordon, D. M., McCurley, K. S., & Wilson, D. B. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47555-9_18 · Cited by 236
Collision-Resistant hashing: Towards making UOWHFs practical
Mihir Bellare, Y., & Rogaway, P. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052256 · Cited by 216
RSA-OAEP Is Secure under the RSA Assumption
Fujisaki, E., Okamoto, T., Pointcheval, D., & Stern, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_16 · Cited by 206
Securing Threshold Cryptosystems against Chosen Ciphertext Attack
Shoup, V., & Gennaro, R. (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0020-9 · Cited by 198
Self-citationAn efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack
Canetti, R., & Goldwasser, S. (1999) · Cited by 140
Maurer, U. M., & Wolf, S. (2000) · Designs Codes and Cryptography · doi:10.1023/a:1008302122286 · Cited by 138
Manger, J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_14 · Cited by 128
Universally Composable Security: A New Paradigm for Cryptographic Protocols.
Canetti, R. (2000) · Cited by 85
Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks
Lim, C. H., & Lee, P. J. (2007) · Springer eBooks · doi:10.1007/3-540-48329-2_36 · Cited by 43
Cited by
Compact Proofs of Retrievability
Shacham, H., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89255-7_7 · Cited by 1,395
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J. M., Schwabe, P., Seiler, G., & Stehle, D. (2018) · 2018 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2018.00032 · Cited by 1,192
“We remark that a CCAsecure public-key encryption scheme can be obtained by combining the CCA-secure KEM Kyber with any CCA-secure symmetric encryption scheme [33] (aka.”
BackgroundMethodChosen-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
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
Self-citationInformation Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601982414 · Cited by 686
Metadata
- Authors
- Cramer, R., & Shoup, V.
- Venue
- SIAM Journal on Computing
- Published
- 2003-01
- Volume
- 33
- Issue
- 1
- Pages
- 167-226
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2157679418
- Cited by
- 978
- References
- 45
- FWCI
- 35.34
- 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.