The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
From MaRDI portal
Recommendations
Cited in
(22)- On the impossibility of highly-efficient blockcipher-based hash functions
- Indifferentiability for public key cryptosystems
- On the analysis of cryptographic assumptions in the generic ring model
- Fast garbling of circuits under standard assumptions
- Critique of the related-key attack concept
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Hash functions from defective ideal ciphers
- Salvaging weak security bounds for blockcipher-based constructions
- On cipher-dependent related-key attacks in the ideal-cipher model
- Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour
- A domain extender for the ideal cipher
- On the Unprovable Security of 2-Key XCBC
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
- scientific article; zbMATH DE number 1951621 (Why is no real title available?)
- On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
- An analysis of the blockcipher-based hash functions from PGV
- Rate-1 incompressible encryption from standard assumptions
- Beyond Uber: instantiating generic groups via PGGs
- Quantum lifting for invertible permutations and ideal ciphers
- The uber-knowledge assumption: a bridge to the AGM
- Improved domain extender for the ideal cipher
- Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model
This page was built for publication: The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618663)