Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

On the (Im)possibility of Obfuscating Programs

- B. Barak, Oded Goldreich, +4 authors K. Yang
- Computer Science
- CRYPTO
- 19 August 2001

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 is… Expand

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 this… Expand

Privacy, accuracy, and consistency too: a holistic solution to contingency table release

- B. Barak, K. Chaudhuri, C. Dwork, S. Kale, F. McSherry, Kunal Talwar
- Computer Science
- PODS '07
- 11 June 2007

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 as… Expand

Universal arguments and their applications

- B. Barak, Oded Goldreich
- Computer Science, Mathematics
- Proceedings 17th IEEE Annual Conference on…
- 21 May 2002

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 (as… Expand

Fully Homomorphic Encryption

- B. Barak
- 2010

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 30… Expand

- 85
- 21

Subexponential Algorithms for Unique Games and Related Problems

- Sanjeev Arora, B. Barak, David Steurer
- Mathematics, Computer Science
- IEEE 51st Annual Symposium on Foundations of…
- 2 November 2015

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

Resettably-sound zero-knowledge and its applications

- B. Barak, Oded Goldreich, S. Goldwasser, Yehuda Lindell
- Computer Science
- Proceedings IEEE International Conference on…
- 14 October 2001

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-sound… Expand

Computational Analogues of Entropy

- B. Barak, Ronen Shaltiel, A. Wigderson
- Computer Science
- RANDOM-APPROX
- 24 August 2003

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 the… Expand

Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors

- B. Barak, Guy Kindler, Ronen Shaltiel, B. Sudakov, A. Wigderson
- Computer Science, Mathematics
- STOC '05
- 22 May 2005

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 δ-source… Expand

Extracting randomness using few independent sources

- B. Barak, R. Impagliazzo, A. Wigderson
- Computer Science, Mathematics
- 45th Annual IEEE Symposium on Foundations of…
- 17 October 2004

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 explicit… Expand