| 2009 | ||
|---|---|---|
| 45 | Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen Shaltiel: Strong Parallel Repetition Theorem for Free Projection Games. APPROX-RANDOM 2009: 352-365 | |
| 44 | Boaz Barak, Mohammad Mahmoody-Ghidary: Merkle Puzzles Are Optimal - An O(n2)-Query Attack on Any Key Exchange from a Random Oracle. CRYPTO 2009: 374-390 | |
| 43 | Boaz Barak, Moritz Hardt, Satyen Kale: The uniform hardcore lemma via approximate Bregman projections. SODA 2009: 1193-1200 | |
| 2008 | ||
| 42 | Boaz Barak, Sharon Goldberg, David Xiao: Protocols and Lower Bounds for Failure Localization in the Internet. EUROCRYPT 2008: 341-360 | |
| 41 | Benny Applebaum, Boaz Barak, David Xiao: On Basing Lower-Bounds for Learning on Worst-Case Assumptions. FOCS 2008: 211-220 | |
| 40 | Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer: Rounding Parallel Repetitions of Unique Games. FOCS 2008: 374-383 | |
| 39 | Sharon Goldberg, David Xiao, Eran Tromer, Boaz Barak, Jennifer Rexford: Path-quality monitoring in the presence of adversaries. SIGMETRICS 2008: 193-204 | |
| 38 | Boaz Barak, Mohammad Mahmoody-Ghidary: Merkle Puzzles are Optimal CoRR abs/0801.3669: (2008) | |
| 37 | Boaz Barak, Mohammad Mahmoody-Ghidary: Lower Bounds on Signatures from Symmetric Primitives CoRR abs/0801.3680: (2008) | |
| 36 | Boaz Barak, Oded Goldreich: Universal Arguments and their Applications. SIAM J. Comput. 38(5): 1661-1694 (2008) | |
| 2007 | ||
| 35 | Boaz Barak, Mohammad Mahmoody-Ghidary: Lower Bounds on Signatures From Symmetric Primitives. FOCS 2007: 680-688 | |
| 34 | 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 | |
| 33 | Boaz Barak, Shien Jin Ong, Salil P. Vadhan: Derandomization in Cryptography. SIAM J. Comput. 37(2): 380-400 (2007) | |
| 2006 | ||
| 32 | Boaz Barak: Non-black-box Techniques in Cryptography. CSR 2006: 1 | |
| 31 | Boaz Barak, Manoj Prabhakaran, Amit Sahai: Concurrent Non-Malleable Zero Knowledge. FOCS 2006: 345-354 | |
| 30 | 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 | |
| 29 | Boaz Barak, Yehuda Lindell, Salil P. Vadhan: Lower bounds for non-black-box zero knowledge. J. Comput. Syst. Sci. 72(2): 321-391 (2006) | |
| 28 | Boaz Barak, Russell Impagliazzo, Avi Wigderson: Extracting Randomness Using Few Independent Sources. SIAM J. Comput. 36(4): 1095-1118 (2006) | |
| 2005 | ||
| 27 | 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 | |
| 26 | Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin: Secure Computation Without Authentication. CRYPTO 2005: 361-377 | |
| 25 | Boaz Barak, Amit Sahai: How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation. FOCS 2005: 543-552 | |
| 24 | 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 | |
| 23 | 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) | |
| 22 | Boaz Barak, Shien Jin Ong, Salil P. Vadhan: Derandomization in Cryptography Electronic Colloquium on Computational Complexity (ECCC)(114): (2005) | |
| 2004 | ||
| 21 | Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafael Pass: Universally Composable Protocols with Relaxed Set-Up Assumptions. FOCS 2004: 186-195 | |
| 20 | Boaz Barak, Russell Impagliazzo, Avi Wigderson: Extracting Randomness Using Few Independent Sources. FOCS 2004: 384-393 | |
| 19 | Boaz Barak, Rafael Pass: On the Possibility of One-Message Weak Zero-Knowledge. TCC 2004: 121-132 | |
| 18 | Boaz Barak, Yehuda Lindell, Salil P. Vadhan: Lower Bounds for Non-Black-Box Zero Knowledge Electronic Colloquium on Computational Complexity (ECCC)(083): (2004) | |
| 17 | Boaz Barak, Yehuda Lindell: Strict Polynomial-Time in Simulation and Extraction. SIAM J. Comput. 33(4): 738-818 (2004) | |
| 2003 | ||
| 16 | Boaz Barak, Ronen Shaltiel, Eran Tromer: True Random Number Generators Secure in a Changing Environment. CHES 2003: 166-180 | |
| 15 | Boaz Barak, Shien Jin Ong, Salil P. Vadhan: Derandomization in Cryptography. CRYPTO 2003: 299-315 | |
| 14 | Boaz Barak, Yehuda Lindell, Salil P. Vadhan: Lower Bounds for Non-Black-Box Zero Knowledge. FOCS 2003: 384-393 | |
| 13 | Boaz Barak, Ronen Shaltiel, Avi Wigderson: Computational Analogues of Entropy. RANDOM-APPROX 2003: 200-215 | |
| 2002 | ||
| 12 | Boaz Barak: Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model. FOCS 2002: 345-355 | |
| 11 | Boaz Barak, Oded Goldreich: Universal Arguments and their Applications. IEEE Conference on Computational Complexity 2002: 194-203 | |
| 10 | Boaz Barak: A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms. RANDOM 2002: 194-208 | |
| 9 | Boaz Barak, Yehuda Lindell: Strict polynomial-time in simulation and extraction. STOC 2002: 484-493 | |
| 8 | Boaz Barak, Yehuda Lindell: Strict Polynomial-time in Simulation and Extraction Electronic Colloquium on Computational Complexity (ECCC)(026): (2002) | |
| 2001 | ||
| 7 | 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 | |
| 6 | Boaz Barak: How to Go Beyond the Black-Box Simulation Barrier. FOCS 2001: 106-115 | |
| 5 | Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell: Resettably-Sound Zero-Knowledge and its Applications. FOCS 2001: 116-125 | |
| 4 | 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) | |
| 3 | Boaz Barak, Oded Goldreich: Universal Arguments and their Applications Electronic Colloquium on Computational Complexity (ECCC)(093): (2001) | |
| 2000 | ||
| 2 | Boaz Barak, Shai Halevi, Amir Herzberg, Dalit Naor: Clock synchronization with faults and recoveries (extended abstract). PODC 2000: 133-142 | |
| 1999 | ||
| 1 | Boaz Barak, Amir Herzberg, Dalit Naor, Eldad Shai: The Proactive Security Toolkit and Applications. ACM Conference on Computer and Communications Security 1999: 18-27 | |