Random Oracle Reducibility

DOI10.1007/978-3-642-22792-9_2MaRDI QIDQ5199182zbMATH OpenOpenAlexFDO

Authors Paul Baecher, Marc Fischlin

Publication date 12 August 2011

Published in Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22792-9_2

zbMATH Keywords

random oracle modelencryptionDiffie-Hellmanuninstantiability

Mathematics Subject Classification ID

Applications of game theory (91A80) Cryptography (94A60)

Recommendations

• Optimal redundancy in computations from random oracles
• Random oracles and non-uniformity
• scientific article; zbMATH DE number 512979
• Randomness and reducibility
• scientific article; zbMATH DE number 1834658
• Coarse reducibility and algorithmic randomness
• Reducibilities relating to Schnorr randomness
• On the random oracle hypothesis
• Deterministic random oracles
• Theory of Cryptography

Cited in

(11)

• Iterated random oracle: a universal approach for finding loss in security reduction
• Theory of Cryptography
• Limits on the Usefulness of Random Oracles
• Lifting standard model reductions to common setup assumptions
• Augmented random oracles
• Random Oracles and Auxiliary Input
• On independent random oracles
• Non-adaptive programmability of random oracle
• Characterizations of reduction classes modulo oracle conditions
• Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle?
• Does truth-table of linear norm reduce the one-query tautologies to a random oracle?

This page was built for publication: Random Oracle Reducibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199182)