Random oracle combiners: breaking the concatenation barrier for collision-resistance
From MaRDI portal
Publication:6145924
DOI10.1007/978-3-031-38545-2_17MaRDI QIDQ6145924
No author found.
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Robust multi-property combiners for hash functions
- An interpretation for Garsia and Remmel's \(q\)-hit numbers
- Short signatures from the Weil pairing
- Cryptophia’s Short Combiner for Collision-Resistant Hash Functions
- On the Instantiability of Hash-and-Sign RSA Signatures
- Careful with Composition: Limitations of the Indifferentiability Framework
- Compression from Collisions, or Why CRHF Combiners Have a Long Output
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment
- On Robust Combiners for Oblivious Transfer and Other Primitives
- Impossibility Proofs for RSA Signatures in the Standard Model
- Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist
- Multi-property Preserving Combiners for Hash Functions
- Merkle-Damgård Revisited: How to Construct a Hash Function
- On the Generic Insecurity of the Full Domain Hash
- Breaking and Fixing Cryptophia’s Short Combiner
- Topics in Cryptology – CT-RSA 2005
- On Robust Combiners for Private Information Retrieval and Other Primitives
- On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
- Theory of Cryptography
This page was built for publication: Random oracle combiners: breaking the concatenation barrier for collision-resistance
