The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
Open accessOverview
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
Cites
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“Following [14, 6, 9], we model E as a family of random permutations, one for each key, and we provide the adversary with oracle access to the blockcipher E(·, ·) and its inverse E−1(·, ·).”
MethodGoldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Theory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,008
Sequences of games: a tool for taming complexity in security proofs.
Shoup, V. (2004) · Cited by 760
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
Diffie, W., & Hellman, M. E. (1977) · Computer · doi:10.1109/c-m.1977.217750 · Cited by 567
A construction of a cipher from a single pseudorandom permutation
Even, S., & Mansour, Y. (1997) · Journal of Cryptology · doi:10.1007/s001459900025 · Cited by 351
On the security of multiple encryption
Merkle, R. C., & Hellman, M. E. (1981) · Communications of the ACM · doi:10.1145/358699.358718 · Cited by 238
A construction of a cipher from a single pseudorandom permutation
Even, S., & Mansour, Y. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57332-1_17 · Cited by 185
Code-Based Game-Playing Proofs and the Security of Triple Encryption
Mihir Bellare, Y., & Rogaway, P. (2006) · Cited by 161
Self-citationHow to Protect DES Against Exhaustive Key Search (an Analysis of DESX)
Kilian, J., & Rogaway, P. (2001) · Journal of Cryptology · doi:10.1007/s001450010015 · Cited by 148
Self-citationCascade ciphers: The importance of being first
Maurer, U. M., & Massey, J. L. (1993) · Journal of Cryptology · doi:10.1007/bf02620231 · Cited by 110
A plausible approach to computer-aided cryptographic proofs.
Halevi, S. (2005) · Cited by 93
On the power of cascade ciphers
Even, S., & Goldreich, O. (1985) · ACM Transactions on Computer Systems · doi:10.1145/214438.214442 · Cited by 84
Lucks, S. (1998) · Lecture notes in computer science · doi:10.1007/3-540-69710-1_16 · Cited by 71
Security amplification by composition: The case of doubly-iterated, ideal ciphers
Aiello, W. A., Bellare, M., Crescenzo, G. D., & Venkatesan, R. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055743 · Cited by 46
Self-citation
Cited by
Order-Preserving Symmetric Encryption
Boldyreva, A., Chenette, N., Lee, Y., & O’Neill, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_13 · Cited by 887
Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation
Cash, D., Jaeger, J., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M.-C., & Steiner, M. (2014) · Proceedings 2014 Network and Distributed System Security Symposium · doi:10.14722/ndss.2014.23264 · Cited by 677
Authenticated 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-citationFoundations of garbled circuits
Bellare, M., Hoang, V. T., & Rogaway, P. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382279 · Cited by 541
Self-citation
Metadata
- Authors
- Bellare, M., & Rogaway, P.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 409-426
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2167606175
- Cited by
- 672
- References
- 15
- FWCI
- 12.73
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.