The memory-tightness of authenticated encryption

DOI10.1007/978-3-030-56784-2_5zbMath1503.94049OpenAlexW3046298796MaRDI QIDQ2096479

Stefano Tessaro, Ashrujit Ghoshal, Joseph Jaeger

Publication date: 9 November 2022

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

zbMATH Keywords

provable securitysymmetric cryptographymemory-tightnesstime-memory trade-offs

Mathematics Subject Classification ID

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

Related Items (3)

Hiding in plain sight: memory-tight proofs via randomness programming ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ Memory-tight multi-challenge security of public-key encryption

Cites Work

• Unnamed Item
• Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
• Memory lower bounds of reductions revisited
• Random oracles and non-uniformity
• Memory-tight reductions
• On the memory-tightness of hashed ElGamal
• On the streaming indistinguishability of a random permutation and a random function
• Tight time-memory trade-offs for symmetric encryption
• The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3
• Breaking and Repairing GCM Security Proofs
• Breaking and provably repairing the SSH authenticated encryption scheme
• A Provable-Security Treatment of the Key-Wrap Problem
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• A monte carlo method for factorization
• Progress in Cryptology - INDOCRYPT 2004
• Fast Software Encryption

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