• Publications
  • Influence
Private information retrieval
We describe schemes that enable a user to access k replicated copies of a database (k/spl ges/2) and privately retrieve information stored in the database. This means that each individual databaseExpand
  • 1,054
  • 161
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
  • 2,941
  • 157
  • PDF
A hard-core predicate for all one-way functions
A central tool in constructing pseudorandom generators, secure encryption functions, and in other areas are “hard-core” predicates <italic>b</italic> of functions (permutations) ƒ, discovered inExpand
  • 1,145
  • 128
How to construct random functions
A constructive theory of randomness for functions, based on computational complexity, is developed, and a pseudorandom function generator is presented. This generator is a deterministicExpand
  • 1,761
  • 114
  • PDF
Private information retrieval
Publicly accessible databases are an indispensable resource for retrieving up-to-date information. But they also pose a significant risk to the privacy of the user, since a curious database operatorExpand
  • 1,168
  • 112
  • PDF
The Foundations of Cryptography - Volume 2: Basic Applications
An electric heating device is provided for internally cooking and/or heating a meat product and an associated bakery product. The device is insertable into the center of the meat product so that theExpand
  • 960
  • 105
  • PDF
Property testing and its connection to learning and approximation
In this paper, we consider the question of determining whether a function <italic>f</italic> has property P or is ε-far from any function with property P. A <italic>property testing</italic>Expand
  • 959
  • 101
  • PDF
On the (Im)possibility of Obfuscating Programs
Informally, an obfuscator O is an (efficient, probabilistic) "compiler" that takes as input a program (or circuit) P and produces a new program O(P) that has the same functionality as P yet isExpand
  • 1,331
  • 97
  • PDF
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,271
  • 97
  • PDF
How to play any mental game, or a completeness theorem for protocols with honest majority
Permission to copy without fee all or part of this material is granted provided that the copies are not made or Idistributed for direct commercial advantage, the ACM copyright notice and the title ofExpand
  • 656
  • 92