Boaz Barak

发表

Lower Bounds on Signatures From Symmetric Primitives

Boaz Barak, Mohammad Mahmoody-Ghidary, B. Barak, 2008, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

Merkle Puzzles are Optimal pdf

Boaz Barak, Mohammad Mahmoody-Ghidary, B. Barak, 2008, IACR Cryptol. ePrint Arch..

Playing Unique Games on Certified Small-Set Expanders pdf

Pravesh Kothari, Tselil Schramm, David Steurer, 2020, ArXiv.

Making the long code shorter, with applications to the Unique Games Conjecture

Prasad Raghavendra, David Steurer, Johan Håstad, 2011, Electron. Colloquium Comput. Complex..

Leftover Hash Lemma, Revisited

Hugo Krawczyk, Yevgeniy Dodis, François-Xavier Standaert, 2011, IACR Cryptol. ePrint Arch..

A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms

Boaz Barak, B. Barak, 2002, RANDOM.

Universal Arguments and their Applications

Oded Goldreich, Boaz Barak, 2008, SIAM J. Comput..

A zero-knowledge protocol for nuclear warhead verification

Boaz Barak, Robert J. Goldston, Alexander Glaser, 2014, Nature.

Subexponential Algorithms for Unique Games and Related Problems

Sanjeev Arora, David Steurer, Boaz Barak, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

Resettably-sound zero-knowledge and its applications

Yehuda Lindell, Oded Goldreich, Shafi Goldwasser, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

On the Possibility of One-Message Weak Zero-Knowledge

Rafael Pass, Boaz Barak, R. Pass, 2004, TCC.

Hopes, Fears and Software Obfuscation: A Survey

Boaz Barak, 2016, IACR Cryptol. ePrint Arch..

2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction

Avi Wigderson, Ronen Shaltiel, Anup Rao, 2006, STOC '06.

Hypercontractivity, sum-of-squares proofs, and their applications

Yuan Zhou, David Steurer, Boaz Barak, 2012, STOC '12.

Merkle Puzzles are Optimal

Boaz Barak, Mohammad Mahmoody-Ghidary, B. Barak, 2008, IACR Cryptol. ePrint Arch..

On the (im)possibility of obfuscating programs

Amit Sahai, Russell Impagliazzo, Oded Goldreich, 2012, JACM.

Authenticating Nuclear Warheads With High Confidence

Boaz Barak, Robert J. Goldston, Alexander Glaser, 2014 .

Tensor Prediction, Rademacher Complexity and Random 3-XOR pdf

Ankur Moitra, Boaz Barak, B. Barak, 2015, ArXiv.

Sum-of-squares proofs and the quest toward optimal algorithms

David Steurer, Boaz Barak, B. Barak, 2014, Electron. Colloquium Comput. Complex..

Clock Synchronization with Faults and Recoveries ( Extended

Boaz Barak, B. Barak, 2000 .

Constant-round coin-tossing with a man in the middle or realizing the shared random string model

Boaz Barak, B. Barak, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

Protocol Initialization for the Framework of Universal Composability

Yehuda Lindell, Tal Rabin, Boaz Barak, 2004, IACR Cryptol. ePrint Arch..

Strong Parallel Repetition Theorem for Free Projection Games

Ran Raz, Ronen Shaltiel, Anup Rao, 2009, APPROX-RANDOM.

On Basing Lower-Bounds for Learning on Worst-Case Assumptions

Benny Applebaum, Boaz Barak, David Xiao, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

True Random Number Generators Secure in a Changing Environment

Ronen Shaltiel, Eran Tromer, Boaz Barak, 2003, CHES.

Subsampling Semidefinite Programs and Max-Cut on the Sphere pdf

David Steurer, Thomas Holenstein, Boaz Barak, 2009, Electron. Colloquium Comput. Complex..

Quantum entanglement, sum of squares, and the log rank conjecture

Pravesh Kothari, David Steurer, Boaz Barak, 2017, Electron. Colloquium Comput. Complex..

Making the Long Code Shorter

Prasad Raghavendra, David Steurer, Johan Håstad, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Extractors and the Leftover Hash Lemma

Yael Tauman Kalai, Thomas Steinke, Shafi Goldwasser, 2011 .

Computational complexity and information asymmetry in financial products

Sanjeev Arora, Markus K. Brunnermeier, Rong Ge, 2011, Commun. ACM.

Physical Public Templates for Nuclear Warhead Verification

Alexander Glaser, Boaz Barak, Moritz Kütt, 2020 .

Protecting Obfuscation against Algebraic Attacks

Yael Tauman Kalai, Omer Paneth, Amit Sahai, 2014, EUROCRYPT.

Truth vs. Proof in Computational Complexity

Boaz Barak, 2012, Bull. EATCS.

Computer science should stay young

Boaz Barak, 2016, Commun. ACM.

Derandomization in Cryptography

Salil P. Vadhan, Boaz Barak, Shien Jin Ong, 2003, SIAM J. Comput..

Computational Analogues of Entropy

Avi Wigderson, Ronen Shaltiel, Boaz Barak, 2003, RANDOM-APPROX.

Systematic comparative analysis of single cell RNA-sequencing methods

Orit Rozenblatt-Rosen, Aviv Regev, Boaz Barak, 2019, bioRxiv.

A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem

Pravesh Kothari, Ankur Moitra, Samuel B. Hopkins, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

Convexity, Bayesianism, and the Quest Towards Optimal Algorithms (Invited Talk)

Boaz Barak, 2015, FSTTCS.

Extracting Randomness Using Few Independent Sources

Avi Wigderson, Russell Impagliazzo, Boaz Barak, 2006, SIAM J. Comput..

Proof vs. Truth in Computational Complexity

Boaz Barak, 2012, Electron. Colloquium Comput. Complex..

A model and architecture for pseudo-random generation with applications to /dev/random

Shai Halevi, Boaz Barak, 2005, CCS '05.

Computational Complexity: Bibliography

Boaz Barak, Sanjeev Arora, B. Barak, 2009 .

Towards securing interdomain routing on the internet

Sharon Goldberg, Jennifer Rexford, Boaz Barak, 2009 .

The Complexity of Public-Key Cryptography

Boaz Barak, B. Barak, 2017, Tutorials on the Foundations of Cryptography.

How to compress interactive communication

Xi Chen, Mark Braverman, Anup Rao, 2010, STOC '10.

How to Compress Interactive Communication

Xi Chen, Mark Braverman, Anup Rao, 2013, SIAM J. Comput..

Non-black-box Techniques in Cryptography

Boaz Barak, B. Barak, 2006, CSR.

Computational Complexity: Derandomization

Boaz Barak, Sanjeev Arora, B. Barak, 2009 .

Resolving the Information Barrier Dilemma:Next Steps Towards Trusted Zero-Knowledge Nuclear Warhead Verification

Boaz Barak, Alexander Glaser, Sebastien Philippe, 2014 .

Lower bounds for non-black-box zero knowledge

Yehuda Lindell, Salil P. Vadhan, Boaz Barak, 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

Strict Polynomial-Time in Simulation and Extraction

Yehuda Lindell, Boaz Barak, 2004, SIAM J. Comput..

Universal arguments and their applications

Oded Goldreich, Boaz Barak, Oded Goldreich, 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

Computational Complexity and Information Asymmetry in Financial Products (Extended Abstract)

Sanjeev Arora, Markus K. Brunnermeier, Rong Ge, 2010, ICS.

Technical Perspective: A breakthrough in software obfuscation

Boaz Barak, 2016, Commun. ACM.

Privacy, accuracy, and consistency too: a holistic solution to contingency table release

Cynthia Dwork, Kamalika Chaudhuri, Kunal Talwar, 2007, PODS.

The Complexity of Public-Key Cryptography Boaz Barak April 27 , 2017

Boaz Barak, B. Barak, 2017 .

Beating the random assignment on constraint satisfaction problems of bounded degree pdf

Prasad Raghavendra, Luca Trevisan, Ankur Moitra, 2015, Electron. Colloquium Comput. Complex..

On Higher-Order Cryptography (Long Version) pdf

Ugo Dal Lago, Boaz Barak, Raphaelle Crubill'e, 2020, ArXiv.

Sum of Squares Lower Bounds from Pairwise Independence

Pravesh Kothari, Boaz Barak, Siu On Chan, 2015, STOC.

Answering Many Queries with Dierential Privacy

Yael Tauman Kalai, Jonathan Ullman, Boaz Barak, 2011 .

The Complexity of Public-Key Cryptograph

Boaz Barak, 2017, Electron. Colloquium Comput. Complex..

Clock synchronization with faults and recoveries (extended abstract)

Shai Halevi, Amir Herzberg, Dalit Naor, 2000, PODC '00.

Making the Long Code Shorter

Prasad Raghavendra, David Steurer, Johan Håstad, 2015, SIAM J. Comput..

Secure Computation Without Authentication

Yehuda Lindell, Ran Canetti, Tal Rabin, 2005, Journal of Cryptology.

The proactive security toolkit and applications

Amir Herzberg, Dalit Naor, Boaz Barak, 1999, CCS '99.

Concurrent Non-Malleable Zero Knowledge

Amit Sahai, Manoj Prabhakaran, Boaz Barak, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

Bounded Key-Dependent Message Security

Yuval Ishai, Dennis Hofheinz, Boaz Barak, 2010, IACR Cryptol. ePrint Arch..

Lecture Notes 4: UOWHF from any One-Way Function

Boaz Barak, Mohammad Mahmoody-Ghidary, 2008 .

Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method

David Steurer, Boaz Barak, Jonathan A. Kelner, 2014, STOC.

Designing Protocols for Nuclear Weapons Verification

Boaz Barak, Alexander Glaser, Sebastien Philippe, 2015 .

Computational Complexity: About this book

Boaz Barak, Sanjeev Arora, B. Barak, 2009 .

For self-supervised learning, Rationality implies generalization, provably pdf

Boaz Barak, Gal Kaplun, Yamini Bansal, 2020, ICLR.

Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes

Avi Wigderson, Zeev Dvir, Amir Yehudayoff, 2010, STOC '11.

Computational Complexity: ADVANCED TOPICS

Boaz Barak, Sanjeev Arora, B. Barak, 2009 .

How to Play ANY Mental Game Over the Net Concurrently composable secure computation without setup assumptions

Amit Sahai, Boaz Barak, B. Barak, 2005 .

Secure Computation Without Authentication

Yehuda Lindell, Ran Canetti, Tal Rabin, 2005, CRYPTO.

Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation)

Pravesh Kothari, Ilan Komargodski, Zvika Brakerski, 2018, Electron. Colloquium Comput. Complex..

How to play almost any mental game over the net - concurrent composition via super-polynomial simulation

Amit Sahai, Boaz Barak, B. Barak, 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

Hopes, fears, and software obfuscation

Boaz Barak, B. Barak, 2016, Commun. ACM.

Computational Complexity: Introduction

Boaz Barak, Sanjeev Arora, B. Barak, 2009 .

Path-quality monitoring in the presence of adversaries

Sharon Goldberg, Jennifer Rexford, Eran Tromer, 2008, SIGMETRICS '08.

Subsampling mathematical relaxations and average-case complexity

David Steurer, Thomas Holenstein, Boaz Barak, 2009, SODA '11.

Obfuscation for Evasive Functions

Yael Tauman Kalai, Nir Bitansky, Omer Paneth, 2014, IACR Cryptol. ePrint Arch..

On the (im)possibility of obfuscating programs : (Extended abstract)

Amit Sahai, Oded Goldreich, Salil P. Vadhan, 2001, CRYPTO 2001.

SGD on Neural Networks Learns Functions of Increasing Complexity pdf

Fred Zhang, Boaz Barak, Dimitris Kalimeris, 2019, NeurIPS.

Lower bounds for non-black-box zero knowledge

Yehuda Lindell, Salil P. Vadhan, Boaz Barak, 2006, J. Comput. Syst. Sci..

Direct Sums in Randomized Communication Complexity

Xi Chen, Mark Braverman, Anup Rao, 2009, Electron. Colloquium Comput. Complex..

Subexponential Algorithms for Unique Games and Related Problems

Sanjeev Arora, David Steurer, Boaz Barak, 2010, FOCS.

Merkle’s Key Agreement Protocol is Optimal: An $$O(n^2)$$O(n2) Attack on Any Key Agreement from Random Oracles

Boaz Barak, Mohammad Mahmoody-Ghidary, B. Barak, 2017, Journal of Cryptology.

(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs

Tselil Schramm, Zhixian Lei, Boaz Barak, 2018, NeurIPS.

Computational Complexity: Acknowledgments

Boaz Barak, Sanjeev Arora, 2009 .

Noisy tensor completion via the sum-of-squares hierarchy

Ankur Moitra, Boaz Barak, B. Barak, 2015, Mathematical Programming.

Theory of Cryptography

Yael Tauman Kalai, Nir Bitansky, Omer Paneth, 2014, Lecture Notes in Computer Science.

Computational Complexity: Pseudorandom constructions: Expanders and extractors

Boaz Barak, Sanjeev Arora, 2009 .

How to go beyond the black-box simulation barrier

Boaz Barak, B. Barak, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors

Guy Kindler, Avi Wigderson, Benny Sudakov, 2010, J. ACM.

Sum-of-Squares Meets Program Obfuscation, Revisited

Pravesh Kothari, Amit Sahai, Samuel B. Hopkins, 2019, IACR Cryptol. ePrint Arch..

Deep double descent: where bigger models and more data hurt pdf

Boaz Barak, Ilya Sutskever, Gal Kaplun, 2019, ICLR.

Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits pdf

Boaz Barak, Xun Gao, Chi-Ning Chou, 2020, ITCS.

Universally composable protocols with relaxed set-up assumptions

Ran Canetti, Rafael Pass, Boaz Barak, 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

Protocols and Lower Bounds for Failure Localization in the Internet

Sharon Goldberg, Boaz Barak, David Xiao, 2008, EUROCRYPT.

Computational Models

Boaz Barak, 2011, Encyclopedia of Parallel Computing.

Rounding Parallel Repetitions of Unique Games

David Steurer, Anup Rao, Oded Regev, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Rounding Semidefinite Programming Hierarchies via Global Correlation

Prasad Raghavendra, David Steurer, Boaz Barak, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

Computational Complexity: Diagonalization

Boaz Barak, Sanjeev Arora, B. Barak, 2009 .

On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction

Guy Kindler, David Steurer, Boaz Barak, 2013, ITCS '13.

Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors

Guy Kindler, Avi Wigderson, Benny Sudakov, 2005, STOC '05.

On the (im)possibility of obfuscating programs

Amit Sahai, Russell Impagliazzo, Oded Goldreich, 2001, JACM.

The uniform hardcore lemma via approximate Bregman projections

Boaz Barak, Satyen Kale, Moritz Hardt, 2009, SODA.

Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture

Pravesh Kothari, David Steurer, Boaz Barak, 2018, Electron. Colloquium Comput. Complex..

Designing Protocols for Nuclear Warhead Verification

Boaz Barak, Alexander Glaser, Sebastien Philippe, 2015 .

Strict polynomial-time in simulation and extraction

Yehuda Lindell, Boaz Barak, B. Barak, 2002, STOC '02.

Non-Black-Box Techniques in

Boaz Barak, B. Barak, 2004 .

An Architecture for Robust Pseudo-Random Generation and Applications to /dev/random

Shai Halevi, Boaz Barak, 2005, CCS 2005.

Special Issue “Conference on Computational Complexity 2012” Guest editors’ foreword

Irit Dinur, Boaz Barak, 2013, computational complexity.

Public-key cryptography from different assumptions

Avi Wigderson, Benny Applebaum, Boaz Barak, 2010, STOC '10.

On Higher-Order Cryptography

Ugo Dal Lago, Boaz Barak, Raphaëlle Crubillé, 2020, ICALP.

Computational Complexity: Frontmatter

Boaz Barak, Sanjeev Arora, 2009 .

Rounding sum-of-squares relaxations

David Steurer, Boaz Barak, Jonathan A. Kelner, 2013, Electron. Colloquium Comput. Complex..

Structure vs Combinatorics in Computational Complexity

Boaz Barak, 2014, Bull. EATCS.

Extracting randomness using few independent sources

Avi Wigderson, Russell Impagliazzo, Boaz Barak, 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

Classical algorithms and quantum limitations for maximum cut on high-girth graphs

Boaz Barak, Kunal Marwaha, B. Barak, 2021, ITCS.

Named Tensor Notation pdf

Alexander M. Rush, David Chiang, Boaz Barak, 2021, ArXiv.

Playing unique games on certified small-set expanders

Pravesh Kothari, Tselil Schramm, David Steurer, 2021, STOC.

Revisiting Model Stitching to Compare Neural Representations pdf

Boaz Barak, Preetum Nakkiran, Yamini Bansal, 2021, NeurIPS.

Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage

Boaz Barak, Chi-Ning Chou, Marcin Kalinowski, 2021, PRX Quantum.

A Simple Explicit Construction of an $n^{\Tilde{O}(\log n)}$-Ramsey Graph

Boaz Barak, 2006 .

Optimizing testing policies for detecting COVID-19 outbreaks

Janni Yuval, Boaz Barak, Mor Nitzan, 2020 .

Toll-like receptors as developmental tools that regulate neurogenesis during development: an update

Boaz Barak, Eitan Okun, B. Barak, 2014, Front. Neurosci..

Cardiovascular Fitness and Cognitive Spatial Learning in Rodents and in Humans

Boaz Barak, Eitan Okun, B. Barak, 2014, The journals of gerontology. Series A, Biological sciences and medical sciences.

2-source dispersers for $n^{o(1)}$ entropy, and Ramsey graphs beating the Frankl-Wilson construction

Avi Wigderson, Ronen Shaltiel, Anup Rao, 2012 .

Highly ordered large-scale neuronal networks of individual cells - toward single cell to 3D nanowire intracellular interfaces.

Boaz Barak, Daniel Stein, Uri Ashery, 2012, ACS applied materials & interfaces.

Fractional Sylvester–Gallai theorems

Avi Wigderson, Zeev Dvir, Amir Yehudayoff, 2012, Proceedings of the National Academy of Sciences.