KIVR: committing authenticated encryption using redundancy and application to GCM, CCM, and more

DOI10.1007/978-3-031-54770-6_13MaRDI QIDQ6547985zbMATH OpenFDO

Authors Yusuke Naito, Yu Sasaki, Takeshi Sugawara

Publication date 31 May 2024

zbMATH Keywords

CCMauthenticated encryptionGCMCTRsecurity proofHMACGCM-SIVkey commitmentcontext commitment

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On committing authenticated-encryption
• Efficient schemes for committing authenticated encryption
• RIV for robust authenticated encryption
• Succinctly-committing authenticated encryption
• Reconsidering generic composition: the tag-then-encrypt case

Cites work

• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• Blockcipher-Based Hashing Revisited
• Context discovery and commitment attacks. How to break CCM, EAX, SIV, and more
• Efficient schemes for committing authenticated encryption
• Fast message franking: from invisible salamanders to encryptment
• How to securely release unverified plaintext in authenticated encryption
• Indifferentiable authenticated encryption
• Message franking via committing authenticated encryption
• On committing authenticated-encryption
• One Way Hash Functions and DES
• Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
• The preimage security of double-block-length compression functions

Cited in

(2)

• Succinctly-committing authenticated encryption
• On committing authenticated-encryption

This page was built for publication: KIVR: committing authenticated encryption using redundancy and application to GCM, CCM, and more

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547985)