The following pages link to Memory-tight reductions (Q1675721):
Displaying 16 items.
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
- Memory lower bounds of reductions revisited (Q1648781) (← links)
- Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
- The memory-tightness of authenticated encryption (Q2096479) (← links)
- On the memory-tightness of hashed ElGamal (Q2119004) (← links)
- Hiding in plain sight: memory-tight proofs via randomness programming (Q2170068) (← links)
- (Q3202957) (← links)
- (Q3685210) (← links)
- (Q4447222) (← links)
- Resource-Restricted Indifferentiability (Q4924438) (← links)
- Memory-Tight Reductions for Practical Key Encapsulation Mechanisms (Q5041159) (← links)
- Compiler Construction (Q5309679) (← links)
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting (Q6041292) (← links)
- Memory-tight multi-challenge security of public-key encryption (Q6135444) (← links)
- New limits of provable security and applications to ElGamal encryption (Q6637527) (← links)
- Signatures with memory-tight security in the quantum random oracle model (Q6637714) (← links)
