Boaz Barak

According to our database1, Boaz Barak authored at least 89 papers between 1999 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Playing Unique Games on Certified Small-Set Expanders.
CoRR, 2020

Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits.
CoRR, 2020

On Higher-Order Cryptography (Long Version).
CoRR, 2020

Deep Double Descent: Where Bigger Models and More Data Hurt.
Proceedings of the 8th International Conference on Learning Representations, 2020

On Higher-Order Cryptography.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
SGD on Neural Networks Learns Functions of Increasing Complexity.
CoRR, 2019

SGD on Neural Networks Learns Functions of Increasing Complexity.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
Sum-of-Squares Meets Program Obfuscation, Revisited.
IACR Cryptol. ePrint Arch., 2018

Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture.
Electronic Colloquium on Computational Complexity (ECCC), 2018

2017
Merkle's Key Agreement Protocol is Optimal: An O(n<sup>2</sup>) Attack on Any Key Agreement from Random Oracles.
J. Cryptology, 2017

The Complexity of Public-Key Cryptography.
IACR Cryptol. ePrint Arch., 2017

Quantum entanglement, sum of squares, and the log rank conjecture.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation).
Electronic Colloquium on Computational Complexity (ECCC), 2017

The Complexity of Public-Key Cryptograph.
Electronic Colloquium on Computational Complexity (ECCC), 2017

The Complexity of Public-Key Cryptography.
Proceedings of the Tutorials on the Foundations of Cryptography., 2017

2016
Hopes, Fears and Software Obfuscation: A Survey.
IACR Cryptol. ePrint Arch., 2016

A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem.
Electronic Colloquium on Computational Complexity (ECCC), 2016

Computer science should stay young.
Commun. ACM, 2016

A breakthrough in software obfuscation: technical perspective.
Commun. ACM, 2016

Hopes, fears, and software obfuscation.
Commun. ACM, 2016

Noisy Tensor Completion via the Sum-of-Squares Hierarchy.
Proceedings of the 29th Conference on Learning Theory, 2016

2015
Path-Quality Monitoring in the Presence of Adversaries: The Secure Sketch Protocols.
IEEE/ACM Trans. Netw., 2015

Making the Long Code Shorter.
SIAM J. Comput., 2015

Subexponential Algorithms for Unique Games and Related Problems.
J. ACM, 2015

Beating the random assignment on constraint satisfaction problems of bounded degree.
Electronic Colloquium on Computational Complexity (ECCC), 2015

Tensor Prediction, Rademacher Complexity and Random 3-XOR.
CoRR, 2015

Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Sum of Squares Lower Bounds from Pairwise Independence.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Convexity, Bayesianism, and the Quest Towards Optimal Algorithms (Invited Talk).
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014
Sum-of-squares proofs and the quest toward optimal algorithms.
Electronic Colloquium on Computational Complexity (ECCC), 2014

2013
How to Compress Interactive Communication.
SIAM J. Comput., 2013

Protecting Obfuscation Against Algebraic Attacks.
IACR Cryptol. ePrint Arch., 2013

Obfuscation for Evasive Functions.
IACR Cryptol. ePrint Arch., 2013

Rounding Sum-of-Squares Relaxations.
Electronic Colloquium on Computational Complexity (ECCC), 2013

Structure vs Combinatorics in Computational Complexity.
Electronic Colloquium on Computational Complexity (ECCC), 2013

Special Issue "Conference on Computational Complexity 2012" Guest editors' foreword.
Comput. Complex., 2013

On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction.
Proceedings of the Innovations in Theoretical Computer Science, 2013

2012
On the (im)possibility of obfuscating programs.
J. ACM, 2012

Proof vs. Truth in Computational Complexity.
Electronic Colloquium on Computational Complexity (ECCC), 2012

Truth vs. Proof in Computational Complexity.
Bull. EATCS, 2012

Hypercontractivity, sum-of-squares proofs, and their applications.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011
Secure Computation Without Authentication.
J. Cryptology, 2011

Leftover Hash Lemma, Revisited.
IACR Cryptol. ePrint Arch., 2011

Rounding Semidefinite Programming Hierarchies via Global Correlation.
Electronic Colloquium on Computational Complexity (ECCC), 2011

Making the long code shorter, with applications to the Unique Games Conjecture.
Electronic Colloquium on Computational Complexity (ECCC), 2011

Computational complexity and information asymmetry in financial products.
Commun. ACM, 2011

Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Subsampling Mathematical Relaxations and Average-case Complexity.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors.
J. ACM, 2010

Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes.
Electronic Colloquium on Computational Complexity (ECCC), 2010

Public-key cryptography from different assumptions.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Computational Complexity and Information Asymmetry in Financial Products (Extended Abstract).
Proceedings of the Innovations in Computer Science, 2010

2009
Bounded Key-Dependent Message Security.
IACR Cryptol. ePrint Arch., 2009

Subsampling Semidefinite Programs and Max-Cut on the Sphere.
Electronic Colloquium on Computational Complexity (ECCC), 2009

Direct Sums in Randomized Communication Complexity.
Electronic Colloquium on Computational Complexity (ECCC), 2009

The uniform hardcore lemma via approximate Bregman projections.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Merkle Puzzles Are Optimal - An <i>O</i>(<i>n</i><sup>2</sup>)-Query Attack on Any Key Exchange from a Random Oracle.
Proceedings of the Advances in Cryptology, 2009

Strong Parallel Repetition Theorem for Free Projection Games.
Proceedings of the Approximation, 2009

Computational Complexity - A Modern Approach.
Cambridge University Press, ISBN: 978-0-521-42426-4, 2009

2008
Public Key Cryptography from Different Assumptions.
IACR Cryptol. ePrint Arch., 2008

Lower Bounds on Signatures From Symmetric Primitives.
IACR Cryptol. ePrint Arch., 2008

Merkle Puzzles are Optimal.
IACR Cryptol. ePrint Arch., 2008

Path-quality monitoring in the presence of adversaries.
Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2008

Rounding Parallel Repetitions of Unique Games.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

On Basing Lower-Bounds for Learning on Worst-Case Assumptions.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Protocols and Lower Bounds for Failure Localization in the Internet.
Proceedings of the Advances in Cryptology, 2008

2007
Privacy, accuracy, and consistency too: a holistic solution to contingency table release.
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

2006
Extracting Randomness Using Few Independent Sources.
SIAM J. Comput., 2006

Lower bounds for non-black-box zero knowledge.
J. Comput. Syst. Sci., 2006

Concurrent Non-Malleable Zero Knowledge.
IACR Cryptol. ePrint Arch., 2006

2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Non-black-box Techniques in Cryptography.
Proceedings of the Computer Science, 2006

2005
A model and architecture for pseudo-random generation with applications to /dev/random.
IACR Cryptol. ePrint Arch., 2005

Derandomization in Cryptography
Electronic Colloquium on Computational Complexity (ECCC), 2005

How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation
Electronic Colloquium on Computational Complexity (ECCC), 2005

2004
Protocol Initialization for the Framework of Universal Composability.
IACR Cryptol. ePrint Arch., 2004

On the Possibility of One-Message Weak Zero-Knowledge.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Universally Composable Protocols with Relaxed Set-Up Assumptions.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003
Computational Analogues of Entropy.
Proceedings of the Approximation, 2003

True Random Number Generators Secure in a Changing Environment.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2003

2002
Strict Polynomial-time in Simulation and Extraction
Electronic Colloquium on Computational Complexity (ECCC), 2002

A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms.
Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
Resettably-Sound Zero-Knowledge and its Applications.
IACR Cryptol. ePrint Arch., 2001

Universal Arguments and their Applications.
Electronic Colloquium on Computational Complexity (ECCC), 2001

How to Go Beyond the Black-Box Simulation Barrier.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
Clock synchronization with faults and recoveries (extended abstract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

1999
The Proactive Security Toolkit and Applications.
Proceedings of the CCS '99, 1999


  Loading...