The memory-tightness of authenticated encryption

DOI10.1007/978-3-030-56784-2_5MaRDI QIDQ2096479zbMATH OpenOpenAlexFDO

Authors Ashrujit Ghoshal, Joseph Jaeger, Stefano Tessaro

Publication date 9 November 2022

Full work available at URL https://doi.org/10.1007/978-3-030-56784-2_5

zbMATH Keywords

memory-tightnessprovable securitysymmetric cryptographytime-memory trade-offs

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Memory-tight multi-challenge security of public-key encryption
• Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
• Tight time-memory trade-offs for symmetric encryption
• scientific article; zbMATH DE number 177019
• A new authenticated encryption technique for handling long ciphertexts in memory constrained devices
• Cryptography with tamperable and leaky memory
• Modeling memory faults in signature and authenticated encryption schemes
• Memory encryption: a survey of existing techniques
• A cryptanalytic time-memory trade-off

Cites work

• A monte carlo method for factorization
• A Provable-Security Treatment of the Key-Wrap Problem
• Breaking and provably repairing the SSH authenticated encryption scheme
• Breaking and repairing GCM security proofs
• Fast Software Encryption
• scientific article; zbMATH DE number 2086729 (Why is no real title available?)
• Memory lower bounds of reductions revisited
• Memory-tight reductions
• On the memory-tightness of hashed ElGamal
• On the streaming indistinguishability of a random permutation and a random function
• Progress in Cryptology - INDOCRYPT 2004
• Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
• Random oracles and non-uniformity
• The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Tight time-memory trade-offs for symmetric encryption

Cited in

(19)

• A new authenticated encryption technique for handling long ciphertexts in memory constrained devices
• Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
• On the memory-tightness of hashed ElGamal
• Hiding in plain sight: memory-tight proofs via randomness programming
• Tight time-memory trade-offs for symmetric encryption
• Forward secret encrypted RAM: lower bounds and applications
• The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
• Improved authenticity bound of EAX, and refinements
• Sp-AELM: sponge based authenticated encryption scheme for memory constrained devices
• Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
• On the security of AEAD-cryptosystem of the GCM type
• Selected Areas in Cryptography
• Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
• О стойкости режима аутентифицированного шифрования с дополнительными данными MGM к угрозе нарушения конфиденциальности;On the security of authenticated encryption mode with associated data MGM with respect to confidentiality threat
• Memory-tight multi-challenge security of public-key encryption
• Signatures with memory-tight security in the quantum random oracle model
• Information-theoretic security with asymmetries
• Succinct PPRFs via memory-tight reductions
• Quantum time-space tradeoff for finding multiple collision pairs

This page was built for publication: The memory-tightness of authenticated encryption

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