Tight time-memory trade-offs for symmetric encryption

DOI10.1007/978-3-030-17653-2_16zbMath1470.94089OpenAlexW2932479067MaRDI QIDQ2292656

Joseph Jaeger, Stefano Tessaro

Publication date: 4 February 2020

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

zbMATH Keywords

provable securitysymmetric cryptographytime-memory trade-offs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Hiding in plain sight: memory-tight proofs via randomness programming ⋮ Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) ⋮ Memory-tight multi-challenge security of public-key encryption ⋮ Unnamed Item ⋮ Tight time-space lower bounds for finding multiple collision pairs and their applications ⋮ The memory-tightness of authenticated encryption ⋮ On the streaming indistinguishability of a random permutation and a random function

This page was built for publication: Tight time-memory trade-offs for symmetric encryption