Foundations of Cryptography: Basic Tools
By Oded Goldreich. 2000
695 citations recorded by the source corpus.
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Gilles Barthe
- Benjamin Gr'egoire
- Santiago Zanella-B'eguelin
- Christian Cachin
- Klaus Kursawe
- Dan Boneh
- Ilya Mironov
- Borja Balle
Citations in the corpus
- Formal certification of code-based cryptographic proofs (2009, background): “The complexity notion that captures this intuition, and which is pervasive in cryptographic proofs, is that of strict probabilistic polynomial-time [Goldreich 2001].”
- An information-theoretic approach to privacy (2010, methodology): “This eliminates the possibility of using secrecy techniques such as a specific model of the adversary or of harnessing any computing [ 22 ] or physical advantages such as secret keys, channel differences, or side information [23].”
- (Not So) Random Shuffles of RC4 (2002, background): “computational indistinguishability does not imply statistical closeness [ Gold01 ].”
- Pseudorandom Functions: Three Decades Later (2017, background): “ODED GOLDREICH (1990s) We now present two generic methods for constructing a pseudorandom function.”