The DOI matches its Crossref record.
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.
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
Cited by
Message-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-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
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
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
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
- 0
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A concrete security treatment of symmetric encryption. https://app.cochat.ai/papers/10.1109/sfcs.1997.646128
- The paper
- Bellare, M., Desai, A., Jokipii, E., & Rogaway, P. (2002). A concrete security treatment of symmetric encryption. Proceedings 38th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1997.646128
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.
