default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBoaz Barak
בועז ברק
Person information
- unicode name: בועז ברק
- affiliation: Harvard University, John A. Paulson School of Engineering and Applied Sciences
- affiliation: Microsoft Research New England (MSR-NE), Cambridge, USA
- affiliation: Princeton University, Computer Science Department
- affiliation: Institute for Advanced Study, School of Math, Princeton, USA
- affiliation: Weizmann Institute of Science, Rehovot, Israel
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c73]Nikhil Vyas, Depen Morwani, Rosie Zhao, Gal Kaplun, Sham M. Kakade, Boaz Barak:
Beyond Implicit Bias: The Insignificance of SGD Noise in Online Learning. ICML 2024- [c72]Gustaf Ahdritz, Tian Qin, Nikhil Vyas, Boaz Barak, Benjamin L. Edelman:
Distinguishing the Knowable from the Unknowable with Language Models. ICML 2024 - [c71]Hanlin Zhang, Benjamin L. Edelman, Danilo Francati, Daniele Venturi, Giuseppe Ateniese, Boaz Barak:
Watermarks in the Sand: Impossibility of Strong Watermarking for Language Models. ICML 2024 - [i81]Gustaf Ahdritz, Tian Qin, Nikhil Vyas, Boaz Barak, Benjamin L. Edelman:
Distinguishing the Knowable from the Unknowable with Language Models. CoRR abs/2402.03563 (2024) - [i80]Jiachen T. Wang, Zhun Deng, Hiroaki Chiba-Okabe, Boaz Barak, Weijie J. Su:
An Economic Solution to Copyright Challenges of Generative AI. CoRR abs/2404.13964 (2024) - 2023
- [j24]Yueqi Sheng, Boaz Barak, Mor Nitzan:
Robust reconstruction of single-cell RNA-seq data with iterative gene weight updates. Bioinform. 39(Supplement-1): 423-430 (2023) - [j23]David Chiang, Alexander M. Rush, Boaz Barak:
Named Tensor Notation. Trans. Mach. Learn. Res. 2023 (2023) - [c70]Gal Kaplun, Nikhil Ghosh, Saurabh Garg, Boaz Barak, Preetum Nakkiran:
Deconstructing Distributions: A Pointwise Framework of Learning. ICLR 2023 - [c69]Nikhil Vyas, Sham M. Kakade, Boaz Barak:
On Provable Copyright Protection for Generative Models. ICML 2023: 35277-35299 - [c68]Niklas Muennighoff, Alexander M. Rush, Boaz Barak, Teven Le Scao, Nouamane Tazi, Aleksandra Piktus, Sampo Pyysalo, Thomas Wolf, Colin A. Raffel:
Scaling Data-Constrained Language Models. NeurIPS 2023 - [i79]Nikhil Vyas, Sham M. Kakade, Boaz Barak:
Provable Copyright Protection for Generative Models. CoRR abs/2302.10870 (2023) - [i78]Niklas Muennighoff, Alexander M. Rush, Boaz Barak, Teven Le Scao, Aleksandra Piktus, Nouamane Tazi, Sampo Pyysalo, Thomas Wolf, Colin Raffel:
Scaling Data-Constrained Language Models. CoRR abs/2305.16264 (2023) - [i77]Nikhil Vyas, Depen Morwani, Rosie Zhao, Gal Kaplun, Sham M. Kakade, Boaz Barak:
Beyond Implicit Bias: The Insignificance of SGD Noise in Online Learning. CoRR abs/2306.08590 (2023) - [i76]Boaz Barak, Yael Kalai, Ran Raz, Salil P. Vadhan, Nisheeth K. Vishnoi:
On the works of Avi Wigderson. CoRR abs/2307.09524 (2023) - [i75]Hanlin Zhang, Benjamin L. Edelman, Danilo Francati, Daniele Venturi, Giuseppe Ateniese, Boaz Barak:
Watermarks in the Sand: Impossibility of Strong Watermarking for Generative Models. CoRR abs/2311.04378 (2023) - [i74]Hanlin Zhang, Benjamin L. Edelman, Danilo Francati, Daniele Venturi, Giuseppe Ateniese, Boaz Barak:
Watermarks in the Sand: Impossibility of Strong Watermarking for Generative Models. IACR Cryptol. ePrint Arch. 2023: 1776 (2023) - 2022
- [j22]Boaz Barak, Ankur Moitra:
Noisy tensor completion via the sum-of-squares hierarchy. Math. Program. 193(2): 513-548 (2022) - [c67]Boaz Barak, Kunal Marwaha:
Classical Algorithms and Quantum Limitations for Maximum Cut on High-Girth Graphs. ITCS 2022: 14:1-14:21 - [c66]Boaz Barak, Benjamin L. Edelman, Surbhi Goel, Sham M. Kakade, Eran Malach, Cyril Zhang:
Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit. NeurIPS 2022 - [i73]Gal Kaplun, Nikhil Ghosh, Saurabh Garg, Boaz Barak, Preetum Nakkiran:
Deconstructing Distributions: A Pointwise Framework of Learning. CoRR abs/2202.09931 (2022) - [i72]Boaz Barak, Benjamin L. Edelman, Surbhi Goel, Sham M. Kakade, Eran Malach, Cyril Zhang:
Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit. CoRR abs/2207.08799 (2022) - 2021
- [c65]Yamini Bansal, Gal Kaplun, Boaz Barak:
For self-supervised learning, Rationality implies generalization, provably. ICLR 2021 - [c64]Boaz Barak, Chi-Ning Chou, Xun Gao:
Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits. ITCS 2021: 30:1-30:20 - [c63]Yamini Bansal, Preetum Nakkiran, Boaz Barak:
Revisiting Model Stitching to Compare Neural Representations. NeurIPS 2021: 225-236 - [c62]Mitali Bafna, Boaz Barak, Pravesh K. Kothari, Tselil Schramm
, David Steurer:
Playing unique games on certified small-set expanders. STOC 2021: 1629-1642 - [i71]David Chiang, Alexander M. Rush, Boaz Barak:
Named Tensor Notation. CoRR abs/2102.13196 (2021) - [i70]Boaz Barak, Kunal Marwaha:
Classical algorithms and quantum limitations for maximum cut on high-girth graphs. CoRR abs/2106.05900 (2021) - [i69]Yamini Bansal, Preetum Nakkiran, Boaz Barak:
Revisiting Model Stitching to Compare Neural Representations. CoRR abs/2106.07682 (2021) - [i68]Xun Gao, Marcin Kalinowski, Chi-Ning Chou, Mikhail D. Lukin, Boaz Barak, Soonwon Choi:
Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage. CoRR abs/2112.01657 (2021) - 2020
- [c61]Boaz Barak, Raphaëlle Crubillé, Ugo Dal Lago:
On Higher-Order Cryptography. ICALP 2020: 108:1-108:16 - [c60]Preetum Nakkiran, Gal Kaplun, Yamini Bansal, Tristan Yang, Boaz Barak, Ilya Sutskever:
Deep Double Descent: Where Bigger Models and More Data Hurt. ICLR 2020 - [i67]Boaz Barak, Raphaëlle Crubillé, Ugo Dal Lago:
On Higher-Order Cryptography (Long Version). CoRR abs/2002.07218 (2020) - [i66]Boaz Barak, Chi-Ning Chou, Xun Gao:
Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits. CoRR abs/2005.02421 (2020) - [i65]Mitali Bafna, Boaz Barak, Pravesh Kothari, Tselil Schramm, David Steurer:
Playing Unique Games on Certified Small-Set Expanders. CoRR abs/2006.09969 (2020) - [i64]Yamini Bansal, Gal Kaplun, Boaz Barak:
For self-supervised learning, Rationality implies generalization, provably. CoRR abs/2010.08508 (2020)
2010 – 2019
- 2019
- [j21]Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh K. Kothari, Ankur Moitra, Aaron Potechin:
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. SIAM J. Comput. 48(2): 687-735 (2019) - [c59]Boaz Barak, Samuel B. Hopkins, Aayush Jain, Pravesh Kothari, Amit Sahai:
Sum-of-Squares Meets Program Obfuscation, Revisited. EUROCRYPT (1) 2019: 226-250 - [c58]Boaz Barak, Pravesh K. Kothari, David Steurer:
Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture. ITCS 2019: 9:1-9:12 - [c57]Preetum Nakkiran, Gal Kaplun, Dimitris Kalimeris, Tristan Yang, Benjamin L. Edelman, Fred Zhang, Boaz Barak:
SGD on Neural Networks Learns Functions of Increasing Complexity. NeurIPS 2019: 3491-3501 - [c56]Boaz Barak, Chi-Ning Chou, Zhixian Lei, Tselil Schramm, Yueqi Sheng:
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs. NeurIPS 2019: 9186-9194 - [i63]Preetum Nakkiran, Gal Kaplun, Dimitris Kalimeris, Tristan Yang, Benjamin L. Edelman, Fred Zhang, Boaz Barak:
SGD on Neural Networks Learns Functions of Increasing Complexity. CoRR abs/1905.11604 (2019) - [i62]Preetum Nakkiran, Gal Kaplun, Yamini Bansal, Tristan Yang, Boaz Barak, Ilya Sutskever:
Deep Double Descent: Where Bigger Models and More Data Hurt. CoRR abs/1912.02292 (2019) - 2018
- [c55]Boaz Barak, Zvika Brakerski, Ilan Komargodski, Pravesh K. Kothari:
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). EUROCRYPT (2) 2018: 649-679 - [i61]Boaz Barak, Pravesh K. Kothari, David Steurer:
Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture. CoRR abs/1804.08662 (2018) - [i60]Boaz Barak, Chi-Ning Chou, Zhixian Lei, Tselil Schramm, Yueqi Sheng:
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs. CoRR abs/1805.02349 (2018) - [i59]Boaz Barak, Pravesh Kothari, David Steurer:
Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture. Electron. Colloquium Comput. Complex. TR18 (2018) - [i58]Boaz Barak, Samuel B. Hopkins, Aayush Jain, Pravesh Kothari, Amit Sahai:
Sum-of-Squares Meets Program Obfuscation, Revisited. IACR Cryptol. ePrint Arch. 2018: 1237 (2018) - 2017
- [j20]Boaz Barak, Mohammad Mahmoody-Ghidary:
Merkle's Key Agreement Protocol is Optimal: An O(n2) Attack on Any Key Agreement from Random Oracles. J. Cryptol. 30(3): 699-734 (2017) - [c54]Boaz Barak, Pravesh K. Kothari, David Steurer:
Quantum entanglement, sum of squares, and the log rank conjecture. STOC 2017: 975-988 - [p1]Boaz Barak:
The Complexity of Public-Key Cryptography. Tutorials on the Foundations of Cryptography 2017: 45-77 - [i57]Boaz Barak, Pravesh Kothari, David Steurer:
Quantum entanglement, sum of squares, and the log rank conjecture. CoRR abs/1701.06321 (2017) - [i56]Boaz Barak:
The Complexity of Public-Key Cryptograph. Electron. Colloquium Comput. Complex. TR17 (2017) - [i55]Boaz Barak, Zvika Brakerski, Ilan Komargodski, Pravesh Kothari:
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). Electron. Colloquium Comput. Complex. TR17 (2017) - [i54]Boaz Barak, Pravesh Kothari, David Steurer:
Quantum entanglement, sum of squares, and the log rank conjecture. Electron. Colloquium Comput. Complex. TR17 (2017) - [i53]Boaz Barak, Zvika Brakerski, Ilan Komargodski, Pravesh K. Kothari:
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). IACR Cryptol. ePrint Arch. 2017: 312 (2017) - [i52]Boaz Barak:
The Complexity of Public-Key Cryptography. IACR Cryptol. ePrint Arch. 2017: 365 (2017) - 2016
- [j19]Boaz Barak:
Hopes, fears, and software obfuscation. Commun. ACM 59(3): 88-96 (2016) - [j18]Boaz Barak:
A breakthrough in software obfuscation: technical perspective. Commun. ACM 59(5): 112 (2016) - [j17]Boaz Barak:
Computer science should stay young. Commun. ACM 59(6): 37-38 (2016) - [c53]Boaz Barak, Ankur Moitra:
Noisy Tensor Completion via the Sum-of-Squares Hierarchy. COLT 2016: 417-445 - [c52]Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, Aaron Potechin:
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. FOCS 2016: 428-437 - [i51]Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, Aaron Potechin:
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. CoRR abs/1604.03084 (2016) - [i50]Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, Aaron Potechin:
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. Electron. Colloquium Comput. Complex. TR16 (2016) - [i49]Boaz Barak:
Hopes, Fears and Software Obfuscation: A Survey. IACR Cryptol. ePrint Arch. 2016: 210 (2016) - 2015
- [j16]Sanjeev Arora, Boaz Barak, David Steurer:
Subexponential Algorithms for Unique Games and Related Problems. J. ACM 62(5): 42:1-42:25 (2015) - [j15]Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer:
Making the Long Code Shorter. SIAM J. Comput. 44(5): 1287-1324 (2015) - [j14]Sharon Goldberg, David Xiao, Eran Tromer, Boaz Barak, Jennifer Rexford:
Path-Quality Monitoring in the Presence of Adversaries: The Secure Sketch Protocols. IEEE/ACM Trans. Netw. 23(6): 1729-1741 (2015) - [c51]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree. APPROX-RANDOM 2015: 110-123 - [c50]Boaz Barak:
Convexity, Bayesianism, and the Quest Towards Optimal Algorithms (Invited Talk). FSTTCS 2015: 7-7 - [c49]Boaz Barak, Siu On Chan, Pravesh K. Kothari:
Sum of Squares Lower Bounds from Pairwise Independence. STOC 2015: 97-106 - [c48]Boaz Barak, Jonathan A. Kelner, David Steurer:
Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method. STOC 2015: 143-151 - [i48]Boaz Barak, Siu On Chan, Pravesh Kothari:
Sum of Squares Lower Bounds from Pairwise Independence. CoRR abs/1501.00734 (2015) - [i47]Boaz Barak, Ankur Moitra:
Tensor Prediction, Rademacher Complexity and Random 3-XOR. CoRR abs/1501.06521 (2015) - [i46]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the random assignment on constraint satisfaction problems of bounded degree. CoRR abs/1505.03424 (2015) - [i45]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the random assignment on constraint satisfaction problems of bounded degree. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j13]Boaz Barak:
Structure vs Combinatorics in Computational Complexity. Bull. EATCS 112 (2014) - [c47]Boaz Barak, Sanjam Garg, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Protecting Obfuscation against Algebraic Attacks. EUROCRYPT 2014: 221-238 - [c46]Boaz Barak, Jonathan A. Kelner, David Steurer:
Rounding sum-of-squares relaxations. STOC 2014: 31-40 - [c45]Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Obfuscation for Evasive Functions. TCC 2014: 26-51 - [i44]Boaz Barak, David Steurer:
Sum-of-squares proofs and the quest toward optimal algorithms. CoRR abs/1404.5236 (2014) - [i43]Boaz Barak, Jonathan A. Kelner, David Steurer:
Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method. CoRR abs/1407.1543 (2014) - [i42]Boaz Barak, David Steurer:
Sum-of-squares proofs and the quest toward optimal algorithms. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j12]Boaz Barak, Irit Dinur:
Special Issue "Conference on Computational Complexity 2012" Guest editors' foreword. Comput. Complex. 22(2): 215-217 (2013) - [j11]Boaz Barak, Mark Braverman, Xi Chen, Anup Rao:
How to Compress Interactive Communication. SIAM J. Comput. 42(3): 1327-1363 (2013) - [c44]Boaz Barak, Guy Kindler, David Steurer:
On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction. ITCS 2013: 197-214 - [i41]Boaz Barak, Jonathan A. Kelner, David Steurer:
Rounding Sum-of-Squares Relaxations. CoRR abs/1312.6652 (2013) - [i40]Boaz Barak:
Structure vs Combinatorics in Computational Complexity. Electron. Colloquium Comput. Complex. TR13 (2013) - [i39]Boaz Barak, Jonathan A. Kelner, David Steurer:
Rounding Sum-of-Squares Relaxations. Electron. Colloquium Comput. Complex. TR13 (2013) - [i38]Boaz Barak, Sanjam Garg, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Protecting Obfuscation Against Algebraic Attacks. IACR Cryptol. ePrint Arch. 2013: 631 (2013) - [i37]Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Obfuscation for Evasive Functions. IACR Cryptol. ePrint Arch. 2013: 668 (2013) - 2012
- [j10]Boaz Barak:
Truth vs. Proof in Computational Complexity. Bull. EATCS 108: 130-142 (2012) - [j9]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:1-6:48 (2012) - [c43]Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer:
Making the Long Code Shorter. FOCS 2012: 370-379 - [c42]Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou:
Hypercontractivity, sum-of-squares proofs, and their applications. STOC 2012: 307-326 - [i36]Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou:
Hypercontractivity, Sum-of-Squares Proofs, and their Applications. CoRR abs/1205.4484 (2012) - [i35]Boaz Barak:
Proof vs. Truth in Computational Complexity. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j8]Sanjeev Arora, Boaz Barak, Markus Brunnermeier, Rong Ge:
Computational complexity and information asymmetry in financial products. Commun. ACM 54(5): 101-107 (2011) - [j7]Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin:
Secure Computation Without Authentication. J. Cryptol. 24(4): 720-760 (2011) - [c41]Boaz Barak, Yevgeniy Dodis, Hugo Krawczyk, Olivier Pereira, Krzysztof Pietrzak, François-Xavier Standaert, Yu Yu:
Leftover Hash Lemma, Revisited. CRYPTO 2011: 1-20 - [c40]Boaz Barak, Prasad Raghavendra, David Steurer:
Rounding Semidefinite Programming Hierarchies via Global Correlation. FOCS 2011: 472-481 - [c39]Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer:
Subsampling Mathematical Relaxations and Average-case Complexity. SODA 2011: 512-531 - [c38]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 - [i34]Boaz Barak, Prasad Raghavendra, David Steurer:
Rounding Semidefinite Programming Hierarchies via Global Correlation. CoRR abs/1104.4680 (2011) - [i33]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) - [i32]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. Electron. Colloquium Comput. Complex. TR11 (2011) - [i31]Boaz Barak, Prasad Raghavendra, David Steurer:
Rounding Semidefinite Programming Hierarchies via Global Correlation. Electron. Colloquium Comput. Complex. TR11 (2011) - [i30]Boaz Barak, Yevgeniy Dodis, Hugo Krawczyk, Olivier Pereira, Krzysztof Pietrzak, François-Xavier Standaert, Yu Yu:
Leftover Hash Lemma, Revisited. IACR Cryptol. ePrint Arch. 2011: 88 (2011) - 2010
- [j6]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): 20:1-20:52 (2010) - [c37]Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai:
Bounded Key-Dependent Message Security. EUROCRYPT 2010: 423-444 - [c36]Sanjeev Arora, Boaz Barak, David Steurer:
Subexponential Algorithms for Unique Games and Related Problems. FOCS 2010: 563-572 - [c35]Sanjeev Arora, Boaz Barak, Markus Brunnermeier, Rong Ge:
Computational Complexity and Information Asymmetry in Financial Products (Extended Abstract). ICS 2010: 49-65 - [c34]Boaz Barak, Mark Braverman, Xi Chen, Anup Rao:
How to compress interactive communication. STOC 2010: 67-76 - [c33]Benny Applebaum, Boaz Barak, Avi Wigderson:
Public-key cryptography from different assumptions. STOC 2010: 171-180 - [i29]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) - [i28]Boaz Barak, Zeev Dvir, Avi Wigderson, Amir Yehudayoff:
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes. Electron. Colloquium Comput. Complex. TR10 (2010) - [i27]Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson:
Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [b1]Sanjeev Arora, Boaz Barak:
Computational Complexity - A Modern Approach. Cambridge University Press 2009, ISBN 978-0-521-42426-4, pp. I-XXIV, 1-579 - [c32]Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen Shaltiel:
Strong Parallel Repetition Theorem for Free Projection Games. APPROX-RANDOM 2009: 352-365 - [c31]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 - [c30]Boaz Barak, Moritz Hardt, Satyen Kale:
The uniform hardcore lemma via approximate Bregman projections. SODA 2009: 1193-1200 - [i26]Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer:
Subsampling Semidefinite Programs and Max-Cut on the Sphere. CoRR abs/0911.5526 (2009) - [i25]Boaz Barak, Mark Braverman, Xi Chen, Anup Rao:
Direct Sums in Randomized Communication Complexity. Electron. Colloquium Comput. Complex. TR09 (2009) - [i24]Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer:
Subsampling Semidefinite Programs and Max-Cut on the Sphere. Electron. Colloquium Comput. Complex. TR09 (2009) - [i23]Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai:
Bounded Key-Dependent Message Security. IACR Cryptol. ePrint Arch. 2009: 511 (2009) - 2008
- [j5]Boaz Barak, Oded Goldreich:
Universal Arguments and their Applications. SIAM J. Comput. 38(5): 1661-1694 (2008) - [c29]Boaz Barak, Sharon Goldberg, David Xiao:
Protocols and Lower Bounds for Failure Localization in the Internet. EUROCRYPT 2008: 341-360 - [c28]Benny Applebaum, Boaz Barak, David Xiao:
On Basing Lower-Bounds for Learning on Worst-Case Assumptions. FOCS 2008: 211-220 - [c27]Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer:
Rounding Parallel Repetitions of Unique Games. FOCS 2008: 374-383 - [c26]Sharon Goldberg, David Xiao, Eran Tromer, Boaz Barak, Jennifer Rexford:
Path-quality monitoring in the presence of adversaries. SIGMETRICS 2008: 193-204 - [i22]Boaz Barak, Mohammad Mahmoody-Ghidary:
Merkle Puzzles are Optimal. CoRR abs/0801.3669 (2008) - [i21]Boaz Barak, Mohammad Mahmoody-Ghidary:
Lower Bounds on Signatures from Symmetric Primitives. CoRR abs/0801.3680 (2008) - [i20]Boaz Barak, Mohammad Mahmoody-Ghidary:
Merkle Puzzles are Optimal. IACR Cryptol. ePrint Arch. 2008: 32 (2008) - [i19]Boaz Barak, Mohammad Mahmoody-Ghidary:
Lower Bounds on Signatures From Symmetric Primitives. IACR Cryptol. ePrint Arch. 2008: 33 (2008) - [i18]Boaz Barak, Avi Wigderson:
Public Key Cryptography from Different Assumptions. IACR Cryptol. ePrint Arch. 2008: 335 (2008) - 2007
- [j4]Boaz Barak, Shien Jin Ong, Salil P. Vadhan:
Derandomization in Cryptography. SIAM J. Comput. 37(2): 380-400 (2007) - [c25]Boaz Barak, Mohammad Mahmoody-Ghidary:
Lower Bounds on Signatures From Symmetric Primitives. FOCS 2007: 680-688 - [c24]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 - [i17]Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin:
Secure Computation Without Authentication. IACR Cryptol. ePrint Arch. 2007: 464 (2007) - 2006
- [j3]Boaz Barak, Yehuda Lindell, Salil P. Vadhan:
Lower bounds for non-black-box zero knowledge. J. Comput. Syst. Sci. 72(2): 321-391 (2006) - [j2]Boaz Barak, Russell Impagliazzo, Avi Wigderson:
Extracting Randomness Using Few Independent Sources. SIAM J. Comput. 36(4): 1095-1118 (2006) - [c23]Boaz Barak:
Non-black-box Techniques in Cryptography. CSR 2006: 1 - [c22]Boaz Barak, Manoj Prabhakaran, Amit Sahai:
Concurrent Non-Malleable Zero Knowledge. FOCS 2006: 345-354 - [c21]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 - [i16]Boaz Barak, Manoj Prabhakaran, Amit Sahai:
Concurrent Non-Malleable Zero Knowledge. IACR Cryptol. ePrint Arch. 2006: 355 (2006) - 2005
- [c20]Boaz Barak, Shai Halevi:
A model and architecture for pseudo-random generation with applications to /dev/random. CCS 2005: 203-212 - [c19]Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin:
Secure Computation Without Authentication. CRYPTO 2005: 361-377 - [c18]Boaz Barak, Amit Sahai:
How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation. FOCS 2005: 543-552 - [c17]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 - [i15]Boaz Barak, Amit Sahai:
How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation. Electron. Colloquium Comput. Complex. TR05 (2005) - [i14]Boaz Barak, Shien Jin Ong, Salil P. Vadhan:
Derandomization in Cryptography. Electron. Colloquium Comput. Complex. TR05 (2005) - [i13]Boaz Barak, Shai Halevi:
A model and architecture for pseudo-random generation with applications to /dev/random. IACR Cryptol. ePrint Arch. 2005: 29 (2005) - [i12]Boaz Barak, Amit Sahai:
How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation. IACR Cryptol. ePrint Arch. 2005: 106 (2005) - [i11]Boaz Barak, Shien Jin Ong, Salil P. Vadhan:
Derandomization in Cryptography. IACR Cryptol. ePrint Arch. 2005: 365 (2005) - 2004
- [j1]Boaz Barak, Yehuda Lindell:
Strict Polynomial-Time in Simulation and Extraction. SIAM J. Comput. 33(4): 738-818 (2004) - [c16]Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafael Pass:
Universally Composable Protocols with Relaxed Set-Up Assumptions. FOCS 2004: 186-195 - [c15]Boaz Barak, Russell Impagliazzo, Avi Wigderson:
Extracting Randomness Using Few Independent Sources. FOCS 2004: 384-393 - [c14]Boaz Barak, Rafael Pass:
On the Possibility of One-Message Weak Zero-Knowledge. TCC 2004: 121-132 - [i10]Boaz Barak, Yehuda Lindell, Salil P. Vadhan:
Lower Bounds for Non-Black-Box Zero Knowledge. Electron. Colloquium Comput. Complex. TR04 (2004) - [i9]Boaz Barak, Yehuda Lindell, Tal Rabin:
Protocol Initialization for the Framework of Universal Composability. IACR Cryptol. ePrint Arch. 2004: 6 (2004) - [i8]Boaz Barak, Yehuda Lindell, Salil P. Vadhan:
Lower Bounds for Non-Black-Box Zero Knowledge. IACR Cryptol. ePrint Arch. 2004: 226 (2004) - 2003
- [c13]Boaz Barak, Ronen Shaltiel, Eran Tromer:
True Random Number Generators Secure in a Changing Environment. CHES 2003: 166-180 - [c12]Boaz Barak, Shien Jin Ong, Salil P. Vadhan:
Derandomization in Cryptography. CRYPTO 2003: 299-315 - [c11]Boaz Barak, Yehuda Lindell, Salil P. Vadhan:
Lower Bounds for Non-Black-Box Zero Knowledge. FOCS 2003: 384-393 - [c10]Boaz Barak, Ronen Shaltiel, Avi Wigderson:
Computational Analogues of Entropy. RANDOM-APPROX 2003: 200-215 - 2002
- [c9]Boaz Barak, Oded Goldreich:
Universal Arguments and their Applications. CCC 2002: 194-203 - [c8]Boaz Barak:
Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model. FOCS 2002: 345-355 - [c7]Boaz Barak:
A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms. RANDOM 2002: 194-208 - [c6]Boaz Barak, Yehuda Lindell:
Strict polynomial-time in simulation and extraction. STOC 2002: 484-493 - [i7]Boaz Barak, Yehuda Lindell:
Strict Polynomial-time in Simulation and Extraction. Electron. Colloquium Comput. Complex. TR02 (2002) - [i6]Boaz Barak, Yehuda Lindell:
Strict Polynomial-time in Simulation and Extraction. IACR Cryptol. ePrint Arch. 2002: 43 (2002) - 2001
- [c5]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 - [c4]Boaz Barak:
How to Go Beyond the Black-Box Simulation Barrier. FOCS 2001: 106-115 - [c3]Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell:
Resettably-Sound Zero-Knowledge and its Applications. FOCS 2001: 116-125 - [i5]Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang:
On the (Im)possibility of Obfuscating Programs. Electron. Colloquium Comput. Complex. TR01 (2001) - [i4]Boaz Barak, Oded Goldreich:
Universal Arguments and their Applications. Electron. Colloquium Comput. Complex. TR01 (2001) - [i3]Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell:
Resettably-Sound Zero-Knowledge and its Applications. IACR Cryptol. ePrint Arch. 2001: 63 (2001) - [i2]Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang:
On the (Im)possibility of Obfuscating Programs. IACR Cryptol. ePrint Arch. 2001: 69 (2001) - [i1]Boaz Barak, Oded Goldreich:
Universal Arguments and their Applications. IACR Cryptol. ePrint Arch. 2001: 105 (2001) - 2000
- [c2]Boaz Barak, Shai Halevi, Amir Herzberg, Dalit Naor:
Clock synchronization with faults and recoveries (extended abstract). PODC 2000: 133-142
1990 – 1999
- 1999
- [c1]Boaz Barak, Amir Herzberg, Dalit Naor, Eldad Shai:
The Proactive Security Toolkit and Applications. CCS 1999: 18-27
Coauthor Index
Pravesh Kothari
aka: Pravesh K. Kothari
aka: Pravesh K. Kothari
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-19 20:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
