Modern Cryptography, Probabilistic Proofs and Pseudorandomness

By Oded Goldreich. 1998

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Pseudorandom Bits for Polynomials (2007, unknown): “Pseudorandom generators are a central object of theoretical computer science that has found a striking variety of applications in complexity theory, algorithm design, and cryptography, and we refer the reader to the excellent book by Goldreich [8] for background.”
Defending Against Statistical Steganalysis (2001, methodology): “The first method selects from a family of pseudo-random number generators [3].”
The Free Haven Project: Distributed Anonymous Storage Service (2000, methodology): “We might leverage our experience with cryptographic de nitions of semantic security and non-malleability to produce similar de nitions and proofs[21].”
Privacy-Preserving Record Linkage (2010, methodology): “Using techniques from cryptography it is theoretically possible [16] to take a protocol for the semi-honest model and make it work under a malicious model, in which one of the parties tries to deviate from the protocol in order to reveal information.”
Physical One-Way Functions (2002, methodology): “Our presentation draws heavily from Goldreich [11] [12] and Bellare [13].”
Foundations of Cryptography: Volume 1, Basic Tools (2001, unknown): “In this review I present " Foundations of Cryptography " by Oded Goldreich.”
Secure multiple linear regression based on homomorphic encryption (2011, methodology): “In the event that the parties choose to share the data covariance matrix, it is plausible that the protocol of Karr et al. (2009) is more appropriate from the perspective of computational efficiency––since it relies on techniques which are less burdensome than homomorphic encryption. Nevertheless ou”
Quantum random number generators (2016, background): “quired in nonces (numbers that must be used only once), in initialization vectors, in sequence numbers (Networking Working Group, 1996), in salt(2) to avoid dictionary attacks in hashed password lists and in digital signatures, as well as in many interactive protocols (Goldreich, 1999).”
Physical one-way functions (2001, methodology): “Our presentation draws heavily from Goldreich [11] [12] and Bellare [13].”
TestU01: A C library for empirical testing of random number generators (2006, methodology): “The theoretical analysis of RNGs in cryptology is usually asymptotic, in the framework of computational complexity theory [Knuth 1998; Lagarias 1993; Goldreich 1999].”