Boaz Barak

Boaz Barak, Irit Dinur: Special Issue "Conference on Computational Complexity 2012" Guest editors' foreword. Computational Complexity 22(2): 215-217 (2013)

Boaz Barak, Guy Kindler, David Steurer: On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction. ITCS 2013: 197-214

Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang: On the (im)possibility of obfuscating programs. J. ACM 59(2): 6 (2012)

Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer: Making the Long Code Shorter. FOCS 2012: 370-379

Boaz Barak, Fernando G. S. L. Brandão, Aram Wettroth Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou: Hypercontractivity, sum-of-squares proofs, and their applications. STOC 2012: 307-326

Boaz Barak, Fernando G. S. L. Brandão, Aram Wettroth Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou: Hypercontractivity, Sum-of-Squares Proofs, and their Applications. CoRR abs/1205.4484 (2012)

Boaz Barak: Proof vs. Truth in Computational Complexity. Electronic Colloquium on Computational Complexity (ECCC) 19: 120 (2012)

Sanjeev Arora, Boaz Barak, Markus Brunnermeier, Rong Ge: Computational complexity and information asymmetry in financial products. Commun. ACM 54(5): 101-107 (2011)

Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin: Secure Computation Without Authentication. J. Cryptology 24(4): 720-760 (2011)

Boaz Barak, Yevgeniy Dodis, Hugo Krawczyk, Olivier Pereira, Krzysztof Pietrzak, François-Xavier Standaert, Yu Yu: Leftover Hash Lemma, Revisited. CRYPTO 2011: 1-20

Boaz Barak, Prasad Raghavendra, David Steurer: Rounding Semidefinite Programming Hierarchies via Global Correlation. FOCS 2011: 472-481

Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer: Subsampling Mathematical Relaxations and Average-case Complexity. SODA 2011: 512-531

Boaz Barak, Zeev Dvir, Amir Yehudayoff, Avi Wigderson: Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes. STOC 2011: 519-528

Boaz Barak, Prasad Raghavendra, David Steurer: Rounding Semidefinite Programming Hierarchies via Global Correlation. CoRR abs/1104.4680 (2011)

Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer: Making the long code shorter, with applications to the Unique Games Conjecture. CoRR abs/1111.0405 (2011)

Boaz Barak, Prasad Raghavendra, David Steurer: Rounding Semidefinite Programming Hierarchies via Global Correlation. Electronic Colloquium on Computational Complexity (ECCC) 18: 65 (2011)

Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer: Making the long code shorter, with applications to the Unique Games Conjecture. Electronic Colloquium on Computational Complexity (ECCC) 18: 142 (2011)

Boaz Barak, Yevgeniy Dodis, Hugo Krawczyk, Olivier Pereira, Krzysztof Pietrzak, François-Xavier Standaert, Yu Yu: Leftover Hash Lemma, Revisited. IACR Cryptology ePrint Archive 2011: 88 (2011)

Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson: Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors. J. ACM 57(4) (2010)

Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai: Bounded Key-Dependent Message Security. EUROCRYPT 2010: 423-444

Sanjeev Arora, Boaz Barak, David Steurer: Subexponential Algorithms for Unique Games and Related Problems. FOCS 2010: 563-572

Sanjeev Arora, Boaz Barak, Markus Brunnermeier, Rong Ge: Computational Complexity and Information Asymmetry in Financial Products (Extended Abstract). ICS 2010: 49-65

Boaz Barak, Mark Braverman, Xi Chen, Anup Rao: How to compress interactive communication. STOC 2010: 67-76

Benny Applebaum, Boaz Barak, Avi Wigderson: Public-key cryptography from different assumptions. STOC 2010: 171-180

Boaz Barak, Zeev Dvir, Avi Wigderson, Amir Yehudayoff: Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes. CoRR abs/1009.4375 (2010)

Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson: Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors. Electronic Colloquium on Computational Complexity (ECCC) 17: 37 (2010)

Boaz Barak, Zeev Dvir, Avi Wigderson, Amir Yehudayoff: Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes. Electronic Colloquium on Computational Complexity (ECCC) 17: 149 (2010)

Sanjeev Arora, Boaz Barak: Computational Complexity - A Modern Approach. Cambridge University Press 2009, isbn 978-0-521-42426-4, pp. I-XXIV, 1-579

Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen Shaltiel: Strong Parallel Repetition Theorem for Free Projection Games. APPROX-RANDOM 2009: 352-365

Boaz Barak, Mohammad Mahmoody-Ghidary: Merkle Puzzles Are Optimal - An O(n²)-Query Attack on Any Key Exchange from a Random Oracle. CRYPTO 2009: 374-390

Boaz Barak, Moritz Hardt, Satyen Kale: The uniform hardcore lemma via approximate Bregman projections. SODA 2009: 1193-1200

Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer: Subsampling Semidefinite Programs and Max-Cut on the Sphere. CoRR abs/0911.5526 (2009)

Boaz Barak, Mark Braverman, Xi Chen, Anup Rao: Direct Sums in Randomized Communication Complexity. Electronic Colloquium on Computational Complexity (ECCC) 16: 44 (2009)

Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer: Subsampling Semidefinite Programs and Max-Cut on the Sphere. Electronic Colloquium on Computational Complexity (ECCC) 16: 129 (2009)

Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai: Bounded Key-Dependent Message Security. IACR Cryptology ePrint Archive 2009: 511 (2009)

Boaz Barak, Oded Goldreich: Universal Arguments and their Applications. SIAM J. Comput. 38(5): 1661-1694 (2008)

Boaz Barak, Sharon Goldberg, David Xiao: Protocols and Lower Bounds for Failure Localization in the Internet. EUROCRYPT 2008: 341-360

Benny Applebaum, Boaz Barak, David Xiao: On Basing Lower-Bounds for Learning on Worst-Case Assumptions. FOCS 2008: 211-220

Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer: Rounding Parallel Repetitions of Unique Games. FOCS 2008: 374-383

Sharon Goldberg, David Xiao, Eran Tromer, Boaz Barak, Jennifer Rexford: Path-quality monitoring in the presence of adversaries. SIGMETRICS 2008: 193-204

Boaz Barak, Mohammad Mahmoody-Ghidary: Merkle Puzzles are Optimal. CoRR abs/0801.3669 (2008)

Boaz Barak, Mohammad Mahmoody-Ghidary: Lower Bounds on Signatures from Symmetric Primitives. CoRR abs/0801.3680 (2008)

Boaz Barak, Mohammad Mahmoody-Ghidary: Merkle Puzzles are Optimal. IACR Cryptology ePrint Archive 2008: 32 (2008)

Boaz Barak, Mohammad Mahmoody-Ghidary: Lower Bounds on Signatures From Symmetric Primitives. IACR Cryptology ePrint Archive 2008: 33 (2008)

Boaz Barak, Avi Wigderson: Public Key Cryptography from Different Assumptions. IACR Cryptology ePrint Archive 2008: 335 (2008)

Boaz Barak, Shien Jin Ong, Salil P. Vadhan: Derandomization in Cryptography. SIAM J. Comput. 37(2): 380-400 (2007)

Boaz Barak, Mohammad Mahmoody-Ghidary: Lower Bounds on Signatures From Symmetric Primitives. FOCS 2007: 680-688

Boaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Satyen Kale, Frank McSherry, Kunal Talwar: Privacy, accuracy, and consistency too: a holistic solution to contingency table release. PODS 2007: 273-282

Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin: Secure Computation Without Authentication. IACR Cryptology ePrint Archive 2007: 464 (2007)

Boaz Barak, Yehuda Lindell, Salil P. Vadhan: Lower bounds for non-black-box zero knowledge. J. Comput. Syst. Sci. 72(2): 321-391 (2006)

Boaz Barak, Russell Impagliazzo, Avi Wigderson: Extracting Randomness Using Few Independent Sources. SIAM J. Comput. 36(4): 1095-1118 (2006)

Boaz Barak: Non-black-box Techniques in Cryptography. CSR 2006: 1

Boaz Barak, Manoj Prabhakaran, Amit Sahai: Concurrent Non-Malleable Zero Knowledge. FOCS 2006: 345-354

Boaz Barak, Anup Rao, Ronen Shaltiel, Avi Wigderson: 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. STOC 2006: 671-680

Boaz Barak, Manoj Prabhakaran, Amit Sahai: Concurrent Non-Malleable Zero Knowledge. IACR Cryptology ePrint Archive 2006: 355 (2006)

Boaz Barak, Shai Halevi: A model and architecture for pseudo-random generation with applications to /dev/random. ACM Conference on Computer and Communications Security 2005: 203-212

Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin: Secure Computation Without Authentication. CRYPTO 2005: 361-377

Boaz Barak, Amit Sahai: How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation. FOCS 2005: 543-552

Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson: Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. STOC 2005: 1-10

Boaz Barak, Amit Sahai: How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation. Electronic Colloquium on Computational Complexity (ECCC)(096) (2005)

Boaz Barak, Shien Jin Ong, Salil P. Vadhan: Derandomization in Cryptography. Electronic Colloquium on Computational Complexity (ECCC)(114) (2005)

Boaz Barak, Shai Halevi: A model and architecture for pseudo-random generation with applications to /dev/random. IACR Cryptology ePrint Archive 2005: 29 (2005)

Boaz Barak, Amit Sahai: How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation. IACR Cryptology ePrint Archive 2005: 106 (2005)

Boaz Barak, Shien Jin Ong, Salil P. Vadhan: Derandomization in Cryptography. IACR Cryptology ePrint Archive 2005: 365 (2005)

Boaz Barak, Yehuda Lindell: Strict Polynomial-Time in Simulation and Extraction. SIAM J. Comput. 33(4): 738-818 (2004)

Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafael Pass: Universally Composable Protocols with Relaxed Set-Up Assumptions. FOCS 2004: 186-195

Boaz Barak, Russell Impagliazzo, Avi Wigderson: Extracting Randomness Using Few Independent Sources. FOCS 2004: 384-393

Boaz Barak, Rafael Pass: On the Possibility of One-Message Weak Zero-Knowledge. TCC 2004: 121-132

Boaz Barak, Yehuda Lindell, Salil P. Vadhan: Lower Bounds for Non-Black-Box Zero Knowledge. Electronic Colloquium on Computational Complexity (ECCC)(083) (2004)

Boaz Barak, Yehuda Lindell, Tal Rabin: Protocol Initialization for the Framework of Universal Composability. IACR Cryptology ePrint Archive 2004: 6 (2004)

Boaz Barak, Yehuda Lindell, Salil P. Vadhan: Lower Bounds for Non-Black-Box Zero Knowledge. IACR Cryptology ePrint Archive 2004: 226 (2004)

Boaz Barak, Ronen Shaltiel, Eran Tromer: True Random Number Generators Secure in a Changing Environment. CHES 2003: 166-180

Boaz Barak, Shien Jin Ong, Salil P. Vadhan: Derandomization in Cryptography. CRYPTO 2003: 299-315

Boaz Barak, Yehuda Lindell, Salil P. Vadhan: Lower Bounds for Non-Black-Box Zero Knowledge. FOCS 2003: 384-393

Boaz Barak, Ronen Shaltiel, Avi Wigderson: Computational Analogues of Entropy. RANDOM-APPROX 2003: 200-215

Boaz Barak, Oded Goldreich: Universal Arguments and their Applications. IEEE Conference on Computational Complexity 2002: 194-203

Boaz Barak: Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model. FOCS 2002: 345-355

Boaz Barak: A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms. RANDOM 2002: 194-208

Boaz Barak, Yehuda Lindell: Strict polynomial-time in simulation and extraction. STOC 2002: 484-493

Boaz Barak, Yehuda Lindell: Strict Polynomial-time in Simulation and Extraction. Electronic Colloquium on Computational Complexity (ECCC)(026) (2002)

Boaz Barak, Yehuda Lindell: Strict Polynomial-time in Simulation and Extraction. IACR Cryptology ePrint Archive 2002: 43 (2002)

Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang: On the (Im)possibility of Obfuscating Programs. CRYPTO 2001: 1-18

Boaz Barak: How to Go Beyond the Black-Box Simulation Barrier. FOCS 2001: 106-115

Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell: Resettably-Sound Zero-Knowledge and its Applications. FOCS 2001: 116-125

Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang: On the (Im)possibility of Obfuscating Programs. Electronic Colloquium on Computational Complexity (ECCC) 8(057) (2001)

Boaz Barak, Oded Goldreich: Universal Arguments and their Applications . Electronic Colloquium on Computational Complexity (ECCC)(093) (2001)

Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell: Resettably-Sound Zero-Knowledge and its Applications. IACR Cryptology ePrint Archive 2001: 63 (2001)

Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang: On the (Im)possibility of Obfuscating Programs. IACR Cryptology ePrint Archive 2001: 69 (2001)

Boaz Barak, Oded Goldreich: Universal Arguments and their Applications. IACR Cryptology ePrint Archive 2001: 105 (2001)

Boaz Barak, Shai Halevi, Amir Herzberg, Dalit Naor: Clock synchronization with faults and recoveries (extended abstract). PODC 2000: 133-142

Boaz Barak, Amir Herzberg, Dalit Naor, Eldad Shai: The Proactive Security Toolkit and Applications. ACM Conference on Computer and Communications Security 1999: 18-27