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

DOI10.1007/978-3-030-64381-2_12zbMath1485.94076OpenAlexW3115679599MaRDI QIDQ2119086

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

securityencryption schemespseudorandom functionspseudorandomnessintegrityMAC schemes

Mathematics Subject Classification ID

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

Related Items (3)

Hiding in plain sight: memory-tight proofs via randomness programming ⋮ On differential privacy and adaptive data analysis with bounded space ⋮ Memory-tight multi-challenge security of public-key encryption

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