• Publications
  • Influence
How to play ANY mental game
We present a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks noExpand
Private information retrieval
TLDR
Schemes that enable a user to access k replicated copies of a database and privately retrieve information stored in the database and get no information on the identity of the item retrieved by the user are described. Expand
Private information retrieval
TLDR
This work describes schemes that enable a user to access k replicated copies of a database and privately retrieve information stored in the database, so that each individual server gets no information on the identity of the item retrieved by the user. Expand
A hard-core predicate for all one-way functions
TLDR
This paper proves a conjecture of [Levin 87, sec. 5.6.2] that the scalar product of Boolean vectors p, g, x is a hard-core of every one-way function ƒ, and extends to multiple (up to the logarithm of security) such bits and to any distribution on the <italic>x</italic>. Expand
How to construct random functions
TLDR
A constructive theory of randomness for functions, based on computational complexity, is developed, and a pseudorandom function generator is presented that has applications in cryptography, random constructions, and complexity theory. Expand
The Foundations of Cryptography - Volume 2: Basic Applications
TLDR
An electric heating device is provided for internally cooking and/or heating a meat product and an associated bakery product and a combination manipulating handle and reaming tool is provided. Expand
Property testing and its connection to learning and approximation
TLDR
This paper considers the question of determining whether a function f has property P or is ε-far from any function with property P, and devise algorithms to test whether the underlying graph has properties such as being bipartite, k-Colorable, or having a clique of density p-Clique with respect to the vertex set. Expand
On the (Im)possibility of Obfuscating Programs
TLDR
It is proved that obfuscation is impossible, by constructing a family of functions F that are inherently unobfuscatable in the following sense: there is a property π : F → {0, 1} such that given any program that computes a function f ∈ F, the value π(f) can be efficiently computed. Expand
Towards a theory of software protection and simulation by oblivious RAMs
TLDR
This paper distill and formulate the key problem of learning about a program from its execution, and presents an efficient way of executing programs such that it is infeasible to learn anything about the program by monitoring its executions. Expand
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
In this paper the generality and wide applicability of Zero-knowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and interactive proofsExpand
...
1
2
3
4
5
...