The equivalence of the random oracle model and the ideal cipher model, revisited

DOI10.1145/1993636.1993650zbMath1288.94065arXiv1011.1264OpenAlexW2069729829WikidataQ56475250 ScholiaQ56475250MaRDI QIDQ5419078

Stefano Tessaro, Robin Künzler, Thomas Holenstein

Publication date: 5 June 2014

Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.1264

zbMATH Keywords

cryptographyindifferentiabilityFeistel constructionideal cipher modelrandom oracle model

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Cryptography (94A60)

Related Items (16)

How to build an ideal cipher: the indifferentiability of the Feistel construction ⋮ KHAPE: Asymmetric PAKE from key-hiding key exchange ⋮ Asymmetric PAKE with low computation \textit{and} communication ⋮ Towards Understanding the Known-Key Security of Block Ciphers ⋮ Query-Complexity Amplification for Random Oracles ⋮ 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 ⋮ Randomized half-ideal cipher on groups with applications to UC (a)PAKE ⋮ Simpira v2: A Family of Efficient Permutations Using the AES Round Function ⋮ Redeeming reset indifferentiability and applications to post-quantum security ⋮ Sequential indifferentiability of confusion-diffusion networks ⋮ Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff ⋮ Public-Seed Pseudorandom Permutations ⋮ Indifferentiability of 8-Round Feistel Networks ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing

This page was built for publication: The equivalence of the random oracle model and the ideal cipher model, revisited