Most Important Facts
Perfect Secrecy and Information Theory
Elementary Number Theory
Public Key Cryptosystems
Random Oracle Model
To Prove Yourself: Practical Solutions to Identification and Signature
Problems, Fiat and Shamir, 1987. Paper that, among other
important contributions, suggest the heuristic of considering a
hash function as if it was random.
oracles are practical: A paradigm for designing efficient
protocols, Bellare and Rogaway, 1993. Proposing the random
oracle model as a general practical tool to construct efficient
- The Random Oracle
Methodology, Revisited, Canetti,
Goldreich, and Halevi, 1998. First paper proving that the
random oracle methodology is unsound.
Impossibility Results on Reductions, and Applications to the Random
Oracle Methodology, Maurer, Renner, and Holenstein. Especially the
first part of this paper gives a simple explaination of the key issue
with random oracles.