Pages that link to "Item:Q5307266"
From MaRDI portal
The following pages link to Advances in Cryptology - EUROCRYPT 2004 (Q5307266):
Displayed 15 items.
- A provably secure non-iterative hash function resisting birthday attack (Q344781) (← links)
- Constructing quantum hash functions based on quantum walks on Johnson graphs (Q1993776) (← links)
- Simple hash function using discrete-time quantum walks (Q1993832) (← links)
- An ANN-based scalable hashing algorithm for computational clouds with schedulers (Q2115927) (← links)
- Some observations on the theory of cryptographic hash functions (Q2491271) (← links)
- Memory-Efficient Algorithms for Finding Needles in Haystacks (Q2829215) (← links)
- A New Pseudorandom Generator from Collision-Resistant Hash Functions (Q2890004) (← links)
- Expedient Non-malleability Notions for Hash Functions (Q3073712) (← links)
- The Symbiosis between Collision and Preimage Resistance (Q3104691) (← links)
- A New Non-Merkle-Damgård Structural Hash Function with Provable Security (Q3196424) (← links)
- Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions (Q3600231) (← links)
- Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography (Q3600371) (← links)
- How to Fill Up Merkle-Damgård Hash Functions (Q3600380) (← links)
- Nostradamus goes quantum (Q6135450) (← links)
- Better security-efficiency trade-offs in permutation-based two-party computation (Q6157519) (← links)