Collision resistant hashing for paranoids: dealing with multiple collisions
From MaRDI portal
(Redirected from Publication:1648826)
Recommendations
Cited in
(25)- Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- On subset-resilient hash function families
- Multi-collision resistant hash functions and their applications
- Non-malleable codes for bounded parallel-time tampering
- Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
- Advances in Cryptology – CRYPTO 2004
- Collisions for RC4-Hash
- On distributional collision resistant hashing
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
- Non-adaptive universal one-way hash functions from arbitrary one-way functions
- Low-complexity cryptographic hash functions
- Theory of Cryptography
- Collision-resistance from multi-collision-resistance
- On the complexity of collision resistant hash functions: new and old black-box separations
- Statistical difference beyond the polarizing regime
- On the CCA compatibility of public-key infrastructure
- Collision Resistance from Multi-collision Resistance
- Collision resistance from multi-collision resistance for all constant parameters
- Quantum advantage from one-way functions
- Constant-round arguments from one-way functions
- Constant-round arguments for batch-verification and bounded-space computations from one-way functions
- The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
- Multi-collision resistance: a paradigm for keyless hash functions
- Quantum algorithm for the multicollision problem
- Collisionful keyed hash functions with selectable collisions
This page was built for publication: Collision resistant hashing for paranoids: dealing with multiple collisions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648826)
