Follow
Boaz Barak
Boaz Barak
Harvard University
Verified email at boazbarak.org - Homepage
Title
Cited by
Cited by
Year
Computational complexity: a modern approach
S Arora, B Barak
Cambridge University Press, 2009
39392009
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
2036*2012
How to go beyond the black-box simulation barrier
B Barak
Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 106-115, 2001
5512001
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
5242007
Deep double descent: Where bigger models and more data hurt
P Nakkiran, G Kaplun, Y Bansal, T Yang, B Barak, I Sutskever
Journal of Statistical Mechanics: Theory and Experiment 2021 (12), 124003, 2021
3832021
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
2702014
Universal arguments and their applications
B Barak, O Goldreich
SIAM Journal on Computing 38 (5), 1661-1694, 2009
259*2009
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
2522004
Subexponential algorithms for unique games and related problems
S Arora, B Barak, D Steurer
Journal of the ACM (JACM) 62 (5), 1-25, 2015
2442015
How to compress interactive communication
B Barak, M Braverman, X Chen, A Rao
SIAM Journal on Computing 42 (3), 1327-1363, 2013
2432013
Extracting randomness using few independent sources
B Barak, R Impagliazzo, A Wigderson
SIAM Journal on Computing 36 (4), 1095-1118, 2006
2402006
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
1992012
Computational complexity and information asymmetry in financial products
S Arora, B Barak, M Brunnermeier, R Ge
ICS, 49-65, 2010
1962010
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
1932002
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
191*2010
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
178*2012
A nearly tight sum-of-squares lower bound for the planted clique problem
B Barak, S Hopkins, J Kelner, PK Kothari, A Moitra, A Potechin
SIAM Journal on Computing 48 (2), 687-735, 2019
1762019
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
1592003
Secure computation without authentication
B Barak, R Canetti, Y Lindell, R Pass, T Rabin
Journal of cryptology 24 (4), 720-760, 2011
154*2011
Strict polynomial-time in simulation and extraction
B Barak, Y Lindell
SIAM Journal on Computing 33 (4), 783-818, 2004
1542004
The system can't perform the operation now. Try again later.
Articles 1–20