Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
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
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
Canetti, R., & Krawczyk, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_28 · Cited by 1,653
Keying Hash Functions for Message Authentication
Bellare, M., Canetti, R., & Krawczyk, H. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_1 · Cited by 1,580
Self-citationZheng, Y. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052234 · Cited by 1,250
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
IP Encapsulating Security Payload (ESP)
Atkinson, R. (1995) · doi:10.17487/rfc1827 · Cited by 1,076
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
A concrete security treatment of symmetric encryption
Bellare, M., Desai, A., Jokipii, E., & Rogaway, P. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646128 · Cited by 931
Self-citation
Cited by
Practical Secure Aggregation for Privacy-Preserving Machine Learning
Bonawitz, K., Ivanov, V., Kreuter, B., Marcedone, A., McMahan, H. B., Patel, S., Ramage, D., Segal, A., & Seth, K. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3133982 · Cited by 3,956
FPGA Intrinsic PUFs and Their Use for IP Protection
Guajardo, J., Kumar, S. S., Schrijen, G.-J., & Tuyls, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74735-2_5 · Cited by 1,203
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-citationVC3: Trustworthy Data Analytics in the Cloud Using SGX
Schuster, F., Costa, M., Fournet, C., Gkantsidis, C., Peinado, M., Mainar-Ruiz, G., & Russinovich, M. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.10 · Cited by 595
On the Security of Joint Signature and Encryption
An, J. H., Dodis, Y., & Rabin, T. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_6 · Cited by 571
The 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
Cryptography in theory and practice
Biggs, N. L. (2008) · Springer Undergraduate Mathematics Series · doi:10.1007/978-1-84800-273-9_12 · Cited by 513
Security, Privacy, and Safety Aspects of Civilian Drones: A Survey
Altawy, R., & Youssef, A. M. (2017) · ACM Transactions on Cyber-Physical Systems · doi:10.1145/3001836 · Cited by 428
A New Randomness Extraction Paradigm for Hybrid Encryption
Kiltz, E., Pietrzak, K., Stam, M., & Yung, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_34 · Cited by 384
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
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-citationLucky Thirteen: Breaking the TLS and DTLS Record Protocols
Al Fardan, N. J., & Paterson, K. G. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.42 · Cited by 362
Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications
Bertoni, G., Daemen, J., Peeters, M., & Van Assche, G. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-28496-0_19 · Cited by 356
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-citationSecure Hybrid Encryption from Weakened Key Encapsulation
Hofheinz, D., & Kiltz, E. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_31 · Cited by 306
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
Circular-Secure Encryption from Decision Diffie-Hellman
Boneh, D., Halevi, S., Hamburg, M., & Ostrovsky, R. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_7 · Cited by 293
Verifiable Computation over Large Database with Incremental Updates
Chen, X., Li, J., Weng, J., Ma, J., & Lou, W. (2016) · IEEE Transactions on Computers · doi:10.1109/tc.2015.2512870 · Cited by 257
Nonce-Based Symmetric Encryption
Rogaway, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-25937-4_22 · Cited by 253
A survey on security and privacy issues of UAVs
Mekdad, Y., Aris, A., Babun, L., Fergougui, A. E., Conti, M., Lazzeretti, R., & Uluagac, A. S. (2023) · Computer Networks · doi:10.1016/j.comnet.2023.109626 · Cited by 253
On cryptography with auxiliary input
Dodis, Y., Kalai, Y. T., & Lovett, S. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536498 · Cited by 228
Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation
Boldyreva, A., Degabriele, J. P., Paterson, K. G., & Stam, M. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_40 · Cited by 212
Verified Models and Reference Implementations for the TLS 1.3 Standard Candidate
Bhargavan, K., Blanchet, B., & Kobeissi, N. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.26 · Cited by 205
Hopper, N. J., Langford, J., & von Ahn, L. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_6 · Cited by 198
Bellare, M., & Rogaway, P. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_24 · Cited by 197
Self-citationRiffle: An Efficient Communication System With Strong Anonymity
Kwon, A., Lazar, D., Devadas, S., & Ford, B. (2016) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2016-0008 · Cited by 84
Hopper, N., von Ahn, L., & Langford, J. (2009) · IEEE Transactions on Computers · doi:10.1109/tc.2008.199 · Cited by 76
(2005) · doi:10.5555/1251028.1251039 · Cited by 67
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., & Namprempre, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 531-545
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1656028867
- Cited by
- 879
- References
- 28
- FWCI
- 10.43
- 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.