Pages that link to "Item:Q2119004"
From MaRDI portal
The following pages link to On the memory-tightness of hashed ElGamal (Q2119004):
Displaying 9 items.
- Optimality in external memory hashing (Q1006387) (← links)
- Memory lower bounds of reductions revisited (Q1648781) (← links)
- The memory-tightness of authenticated encryption (Q2096479) (← links)
- Proof-carrying data without succinct arguments (Q2120099) (← links)
- Hiding in plain sight: memory-tight proofs via randomness programming (Q2170068) (← links)
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting (Q6041292) (← links)
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing (Q6083214) (← links)
- Memory-tight multi-challenge security of public-key encryption (Q6135444) (← links)
- Signatures with memory-tight security in the quantum random oracle model (Q6637714) (← links)