Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Standard model (cryptography)
open-in-new
<h2 id="references">References</h2> <ol> <li id="fn:1"><p>Mihir Bellare; Phillip Rogaway (1993). "Random Oracles are Practical: A Paradigm for Designing Efficient Protocols". Conference on Computer and Communications Security (CCS). ACM. pp. 62–73. Retrieved 2007-11-01. <a href="/wiki/Mihir_Bellare" target="_blank">/wiki/Mihir_Bellare</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Ran Canetti; Oded Goldreich; Shai Halevi (1998). "The Random Oracle Methodology Revisited". Symposium on Theory of computing (STOC). ACM. pp. 209–218. Retrieved 2007-11-01. <a href="/wiki/Ran_Canetti" target="_blank">/wiki/Ran_Canetti</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Victor Shoup (1997). "Lower bounds for discrete logarithms and related problems" (PDF). Advances in Cryptology – Eurocrypt ’97. Vol. 1233. Springer-Verlag. pp. 256–266. Retrieved 2007-11-01. <a href="/wiki/Victor_Shoup" target="_blank">/wiki/Victor_Shoup</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Ueli Maurer (2005). "Abstract models of computation in cryptography" (PDF). IMA conference on Cryptography and Coding (IMACC). Vol. 3796. Springer-Verlag. pp. 1–12. Archived from the original (PDF) on 2017-07-06. Retrieved 2007-11-01. <a href="https://web.archive.org/web/20170706135627/ftp://ftp.inf.ethz.ch/pub/crypto/publications/Maurer05.pdf" target="_blank">https://web.archive.org/web/20170706135627/ftp://ftp.inf.ethz.ch/pub/crypto/publications/Maurer05.pdf</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Canetti, Ran; Pass, Rafael; Shelat, Abhi (2007). "Cryptography from Sunspots: How to Use an Imperfect Reference String". 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). pp. 249–259. doi:10.1109/focs.2007.70. ISBN 978-0769530109. <a href="978-0769530109" target="_blank">978-0769530109</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Danny Dolev; Cynthia Dwork; Moni Naor (1991). "Non-Malleable Cryptography" (PDF). Symposium on Theory of Computing (STOC). ACM. pp. 542–552. Retrieved 2011-12-18. <a href="/wiki/Danny_Dolev" target="_blank">/wiki/Danny_Dolev</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> </ol>