• Publications
  • Influence
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,318
  • 97
How to go beyond the black-box simulation barrier
  • B. Barak
  • Computer Science
  • Proceedings IEEE International Conference on…
  • 14 October 2001
The simulation paradigm is central to cryptography. A simulator is an algorithm that tries to simulate the interaction of the adversary with an honest party, without knowing the private input of thisExpand
  • 464
  • 51
Privacy, accuracy, and consistency too: a holistic solution to contingency table release
The contingency table is a work horse of official statistics, the format of reported data for the US Census, Bureau of Labor Statistics, and the Internal Revenue Service. In many settings such asExpand
  • 415
  • 41
Universal arguments and their applications
We put forward a new type of computationally-sound proof systems, called universal-arguments, which are related but different from both CS-proofs (as defined by Micali, 2000) and arguments (asExpand
  • 197
  • 28
Fully Homomorphic Encryption
Achieving fully-homomorphic encryption, under any kind of reasonable computational assumptions (and under any reasonable definition of “reasonable”) was a holy grail of cryptography for over 30Expand
  • 85
  • 21
Subexponential Algorithms for Unique Games and Related Problems
We give a sub exponential time approximation algorithm for the \textsc{Unique Games} problem. The algorithms run in time that is exponential in an arbitrarily small polynomial of the input size,Expand
  • 201
  • 17
Resettably-sound zero-knowledge and its applications
Resettably-sound proofs and arguments maintain soundness even when the prover can reset the verifier to use the same random coins in repeated executions of the protocol. We show that resettably-soundExpand
  • 110
  • 16
Computational Analogues of Entropy
Min-entropy is a statistical measure of the amount of randomness that a particular distribution contains. In this paper we investigate the notion of computational min-entropy which is theExpand
  • 115
  • 14
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
A distribution <i>X</i> over binary strings of length <i>n</i> has min-entropy <i>k</i> if every string has probability at most 2<sup>-<i>k</i></sup> in <i>X</i>. We say that <i>X</i> is a δ-sourceExpand
  • 155
  • 11
Extracting randomness using few independent sources
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every /spl delta/ > 0 we give an explicitExpand
  • 99
  • 11