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

DOI10.1007/978-3-031-07085-3_24MaRDI QIDQ2170068zbMATH OpenOpenAlexFDO

Authors Ashrujit Ghoshal, Riddhi Ghosal, Joseph Jaeger, Stefano Tessaro

Publication date 30 August 2022

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

zbMATH Keywords

memory-tightnessprovable securitytime-memory trade-offs

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Memory-tight reductions
• Memory lower bounds of reductions revisited
• Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
• Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
• On the memory-tightness of hashed ElGamal

Cites work

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

Cited in

(6)

• Memory lower bounds of reductions revisited
• Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
• Memory-tight multi-challenge security of public-key encryption
• Signatures with memory-tight security in the quantum random oracle model
• Succinct PPRFs via memory-tight reductions
• Anonymity of X-Wing and its variants

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

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