The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
A concrete security treatment of symmetric encryption
Abstract
We study notions and schemes for symmetric (ie. private key) encryption in a concrete security framework. We give four different notions of security against chosen plaintext attack and analyze the concrete complexity of reductions among them, providing both upper and lower bounds, and obtaining tight relations. In this way we classify notions (even though polynomially reducible to each other) as stronger or weaker in terms of concrete security. Next we provide concrete security analyses of methods to encrypt using a block cipher, including the most popular encryption method, CBC. We establish tight bounds (meaning matching upper bounds and attacks) on the success of adversaries as a function of their resources.
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
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
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
Theory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,008
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
Theory and application of trapdoor functions
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.45 · Cited by 968
How to Construct Pseudorandom Permutations from Pseudorandom Functions
Luby, M., & Rackoff, C. (1988) · SIAM Journal on Computing · doi:10.1137/0217022 · Cited by 938
The Security of Cipher Block Chaining
Bellare, M., Kilian, J., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_32 · Cited by 394
Self-citationPseudorandomness and Cryptographic Applications
Luby, M. (1996) · Princeton University Press eBooks · doi:10.1515/9780691206844 · Cited by 374
RSA and Rabin Functions: Certain Parts are as Hard as the Whole
Alexi, W., Chor, B., Goldreich, O., & Schnorr, C. P. (1988) · SIAM Journal on Computing · doi:10.1137/0217013 · Cited by 339
Cited by
Practical techniques for searches on encrypted data
Song, D. X., Wagner, D., & Perrig, A. (2002) · Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000 · doi:10.1109/secpri.2000.848445 · Cited by 3,350
SPINS: Security Protocols for Sensor Networks
Perrig, A., Szewczyk, R., Tygar, J. D., Wen, V., & Culler, D. E. (2002) · Wireless Networks · doi:10.1023/a:1016598314198 · Cited by 2,264
TinySec: a link layer security architecture for wireless sensor networks
Karlof, C., Sastry, N., & Wagner, D. (2004) · Proceedings of the 2nd international conference on Embedded networked sensor systems · doi:10.1145/1031495.1031515 · Cited by 1,612
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
Secure Integration of Asymmetric and Symmetric Encryption Schemes
Fujisaki, E., & Okamoto, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_34 · Cited by 1,132
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
Bellare, M., & Namprempre, C. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_41 · Cited by 879
Self-citationPassword-Based Authenticated Key Exchange in the Three-Party Setting
Abdalla, M., Fouque, P.-A., & Pointcheval, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30580-4_6 · Cited by 833
A Comprehensive Study of Security of Internet-of-Things
Mosenia, A., & Jha, N. K. (2017) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2016.2606384 · Cited by 806
Deterministic and Efficiently Searchable Encryption
Bellare, M., Boldyreva, A., & O’Neill, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_30 · Cited by 745
Self-citationAuthenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
Bellare, M., & Namprempre, C. (2008) · Journal of Cryptology · doi:10.1007/s00145-008-9026-x · Cited by 652
Self-citationMessage-Locked Encryption and Secure Deduplication
Bellare, M., Keelveedhi, S., & Ristenpart, T. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_18 · Cited by 632
Self-citationUniversally Composable Commitments
Canetti, R., & Fischlin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_2 · Cited by 621
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)*
Abadi, M., & Rogaway, P. (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0014-7 · Cited by 613
Self-citationThe Security and Performance of the Galois/Counter Mode (GCM) of Operation
McGrew, D. A., & Viega, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30556-9_27 · Cited by 522
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
Self-citationCompact Proofs of Retrievability
Shacham, H., & Waters, B. (2013) · Journal of Cryptology · doi:10.1007/s00145-012-9129-2 · Cited by 511
Authenticated-encryption with associated-data
Rogaway, P. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586125 · Cited by 467
Self-citationThe 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
Self-citationKey-Privacy in Public-Key Encryption
Bellare, M., Boldyreva, A., Desai, A., & Pointcheval, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_33 · Cited by 442
Self-citationKey-Insulated Public Key Cryptosystems
Dodis, Y., Katz, J., Xu, S., & Yung, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_5 · Cited by 400
The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)
Krawczyk, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_19 · Cited by 393
Security in quantum cryptography
Portmann, C., & Renner, R. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.025008 · Cited by 390
A Provable-Security Treatment of the Key-Wrap Problem
Rogaway, P., & Shrimpton, T. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_23 · Cited by 383
Self-citationAchieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
Mahdavifar, H., & Vardy, A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2162275 · Cited by 376
OCB: a block-cipher mode of operation for efficient authenticated encryption
Rogaway, P., Bellare, M., Black, J., & Krovetz, T. (2001) · Proceedings of the 8th ACM conference on Computer and Communications Security · doi:10.1145/501983.502011 · Cited by 368
Self-citationMiniSec: a secure sensor network communication architecture
Luk, M., Mezzour, G., Perrig, A., & Gligor, V. (2007) · Proceedings of the 6th international conference on Information processing in sensor networks - IPSN '07 · doi:10.1145/1236360.1236421 · Cited by 327
OCB: A block-cipher mode of operation for efficient authenticated encryption
Rogaway, P., Bellare, M., & Black, J. (2003) · ACM Transactions on Information and System Security · doi:10.1145/937527.937529 · Cited by 322
Self-citationSecurity considerations for IEEE 802.15.4 networks
Sastry, N., & Wagner, D. (2004) · Proceedings of the 3rd ACM workshop on Wireless security · doi:10.1145/1023646.1023654 · Cited by 303
Forward-Security in Private-Key Cryptography
Bellare, M., & Yee, B. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36563-x_1 · Cited by 275
Self-citationHalevi, S., & Rogaway, P. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_28 · Cited by 261
Self-citationUC-Secure Searchable Symmetric Encryption
Kurosawa, K., & Ohtaki, Y. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32946-3_21 · Cited by 255
SoK: SSL and HTTPS: Revisiting Past Challenges and Evaluating Certificate Trust Model Enhancements
Clark, J., & van Oorschot, P. C. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.41 · Cited by 224
“CBC with predictable IVs is not secure against chosen plaintext attacks [23], and thus an adversary capable of injecting partial plaintext into a TLS connection and of observing the transmitted ciphertext can determine semantic information about the rest of the plaintext [20], [21].”
An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography
Chailloux, A., Naya-Plasencia, M., & Schrottenloher, A. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70697-9_8 · Cited by 106
FIDO2, CTAP 2.1, and WebAuthn 2: Provable Security and Post-Quantum Instantiation
Bindel, N., Cremers, C., & Zhao, M. (2023) · 2023 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp46215.2023.10179454 · Cited by 30
On the Security of the CCM Encryption Mode and of a Slight Variant
Fouque, P.-A., Martinet, G., Valette, F., & Zimmer, S. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68914-0_25 · Cited by 20
Metadata
- Authors
- Bellare, M., Desai, A., Jokipii, E., & Rogaway, P.
- Venue
- Proceedings 38th Annual Symposium on Foundations of Computer Science
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-23
- Pages
- 394-403
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2139172211
- Cited by
- 931
- References
- 14
- FWCI
- 32.08
- 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.