Boaz Barak
Boaz Barak
Harvard University
Verified email at - Homepage
Cited by
Cited by
Computational complexity: a modern approach
S Arora, B Barak
Cambridge University Press, 2009
On the (im) possibility of obfuscating programs
B Barak, O Goldreich, R Impagliazzo, S Rudich, A Sahai, S Vadhan, ...
Journal of the ACM (JACM) 59 (2), 1-48, 2012
How to go beyond the black-box simulation barrier
B Barak
Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 106-115, 2001
Privacy, accuracy, and consistency too: a holistic solution to contingency table release
B Barak, K Chaudhuri, C Dwork, S Kale, F McSherry, K Talwar
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on …, 2007
Universal arguments and their applications
B Barak, O Goldreich
SIAM Journal on Computing 38 (5), 1661-1694, 2009
Protecting obfuscation against algebraic attacks
B Barak, S Garg, YT Kalai, O Paneth, A Sahai
Annual International Conference on the Theory and Applications of …, 2014
Universally composable protocols with relaxed set-up assumptions
B Barak, R Canetti, JB Nielsen, R Pass
45th Annual IEEE Symposium on Foundations of Computer Science, 186-195, 2004
Extracting randomness using few independent sources
B Barak, R Impagliazzo, A Wigderson
SIAM Journal on Computing 36 (4), 1095-1118, 2006
Subexponential algorithms for unique games and related problems
S Arora, B Barak, D Steurer
Journal of the ACM (JACM) 62 (5), 1-25, 2015
How to compress interactive communication
B Barak, M Braverman, X Chen, A Rao
SIAM Journal on Computing 42 (3), 1327-1363, 2013
Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors
B Barak, G Kindler, R Shaltiel, B Sudakov, A Wigderson
Journal of the ACM (JACM) 57 (4), 1-52, 2010
Computational complexity and information asymmetry in financial products
S Arora, B Barak, M Brunnermeier, R Ge
ICS, 49-65, 2010
Constant-round coin-tossing with a man in the middle or realizing the shared random string model
B Barak
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002
Hypercontractivity, sum-of-squares proofs, and their applications
B Barak, FGSL Brandao, AW Harrow, J Kelner, D Steurer, Y Zhou
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
2-source dispersers for n o(1) entropy, and Ramsey graphs beating the Frankl-Wilson construction
B Barak, A Rao, R Shaltiel, A Wigderson
Annals of Mathematics, 1483-1543, 2012
A model and architecture for pseudo-random generation with applications to/dev/random
B Barak, S Halevi
Proceedings of the 12th ACM conference on Computer and communications …, 2005
True random number generators secure in a changing environment
B Barak, R Shaltiel, E Tromer
International Workshop on Cryptographic Hardware and Embedded Systems, 166-180, 2003
Public-key cryptography from different assumptions
B Applebaum, B Barak, A Wigderson
Proceedings of the forty-second ACM symposium on Theory of computing, 171-180, 2010
Strict polynomial-time in simulation and extraction
B Barak, Y Lindell
SIAM Journal on Computing 33 (4), 783-818, 2004
Secure computation without authentication
B Barak, R Canetti, Y Lindell, R Pass, T Rabin
Journal of cryptology 24 (4), 720-760, 2011
The system can't perform the operation now. Try again later.
Articles 1–20