Super-linear time-memory trade-offs for symmetric encryption

DOI10.1007/978-3-030-64381-2_12MaRDI QIDQ2119086zbMATH OpenOpenAlexFDO

Authors Wei Dai, Stefano Tessaro, Xihu Zhang

Publication date 23 March 2022

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

zbMATH Keywords

pseudorandomnesssecurityintegritypseudorandom functionsencryption schemesMAC schemes

Mathematics Subject Classification ID

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

Recommendations

• Tight time-memory trade-offs for symmetric encryption
• Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
• Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
• On the streaming indistinguishability of a random permutation and a random function
• scientific article; zbMATH DE number 1583765

Cited in

(7)

• Memory-tight multi-challenge security of public-key encryption
• Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
• scientific article; zbMATH DE number 1942425 (Why is no real title available?)
• Hiding in plain sight: memory-tight proofs via randomness programming
• On differential privacy and adaptive data analysis with bounded space
• Tight time-memory trade-offs for symmetric encryption
• On the streaming indistinguishability of a random permutation and a random function

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

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