Hiding in plain sight: memory-tight proofs via randomness programming

DOI10.1007/978-3-031-07085-3_24zbMath1497.94092OpenAlexW3210677180MaRDI QIDQ2170068

Stefano Tessaro, Joseph Jaeger, Riddhi Ghosal, Ashrujit Ghoshal

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-07085-3_24

zbMATH Keywords

provable securitymemory-tightnesstime-memory trade-offs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Memory-tight multi-challenge security of public-key encryption

Cites Work

• Unnamed Item
• Authenticated encryption: relations among notions and analysis of the generic composition paradigm
• Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
• Memory lower bounds of reductions revisited
• Memory-tight reductions
• On-line/off-line digital signatures
• Tight time-space lower bounds for finding multiple collision pairs and their applications
• The memory-tightness of authenticated encryption
• On the memory-tightness of hashed ElGamal
• On the streaming indistinguishability of a random permutation and a random function
• Super-linear time-memory trade-offs for symmetric encryption
• Tight time-memory trade-offs for symmetric encryption
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
• Reconsidering Generic Composition
• Fast Software Encryption
• Digital Signatures with Memory-Tight Security in the Multi-challenge Setting

This page was built for publication: Hiding in plain sight: memory-tight proofs via randomness programming