The Random Oracle Model and the Ideal Cipher Model Are Equivalent
From MaRDI portal
Recommendations
- Theory of Cryptography
- The equivalence of the random oracle model and the ideal cipher model, revisited
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- 10-round Feistel is indifferentiable from an ideal cipher
- The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
Cited in
(42)- Preserving privacy for free: efficient and provably secure two-factor authentication scheme with user anonymity
- Pseudorandomness analysis of the (extended) Lai-Massey scheme
- On the cryptanalysis of the hash function Fugue: partitioning and inside-out distinguishers
- Fast and secure updatable encryption
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff
- Second order collision for the 42-step reduced DHA-256 hash function
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Indifferentiability of 8-Round Feistel Networks
- Reset indifferentiability and its consequences
- Towards Understanding the Known-Key Security of Block Ciphers
- Selective opening security from simulatable data encapsulation
- Simpira v2: a family of efficient permutations using the AES round function
- Security Analysis of the PACE Key-Agreement Protocol
- A domain extender for the ideal cipher
- Chosen Ciphertext Security with Optimal Ciphertext Overhead
- The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
- A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier
- Provably secure three-party password-based authenticated key exchange protocol
- Hashing garbled circuits for free
- The equivalence of the random oracle model and the ideal cipher model, revisited
- 10-round Feistel is indifferentiable from an ideal cipher
- Theory of Cryptography
- Randomized half-ideal cipher on groups with applications to UC (a)PAKE
- Redeeming reset indifferentiability and applications to post-quantum security
- Simplified MITM modeling for permutations: new (quantum) attacks
- Lifting standard model reductions to common setup assumptions
- \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Universal composable password authenticated key exchange for the post-quantum world
- \textsf{LR-OT}: leakage-resilient oblivious transfer
- Indifferentiability of 3-round confusion-diffusion networks
- Can verifiable delay functions be based on random oracles?
- How to model unitary oracles
- LR-OT: leakage-resilient oblivious transfer
- Updatable encryption from group actions
- Offline-online indifferentiability of cryptographic systems
- Random-access AEAD for fast lightweight online encryption
- Sequential indifferentiability of STH and EDM
- Improved domain extender for the ideal cipher
- Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model
- A short non-delegatable strong designated verifier signature
This page was built for publication: The Random Oracle Model and the Ideal Cipher Model Are Equivalent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600210)
