# Boaz Barak

According to our database

Collaborative distances:

^{1}, 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

CoRR, 2020

CoRR, 2020

CoRR, 2020

Proceedings of the 8th International Conference on Learning Representations, 2020

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

CoRR, 2019

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

IACR Cryptol. ePrint Arch., 2018

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

IACR Cryptol. ePrint Arch., 2017

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

Electronic Colloquium on Computational Complexity (ECCC), 2017

Proceedings of the Tutorials on the Foundations of Cryptography., 2017

2016

IACR Cryptol. ePrint Arch., 2016

Electronic Colloquium on Computational Complexity (ECCC), 2016

Commun. ACM, 2016

Commun. ACM, 2016

Commun. ACM, 2016

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

SIAM J. Comput., 2015

J. ACM, 2015

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

Electronic Colloquium on Computational Complexity (ECCC), 2015

CoRR, 2015

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014

Electronic Colloquium on Computational Complexity (ECCC), 2014

2013

SIAM J. Comput., 2013

IACR Cryptol. ePrint Arch., 2013

IACR Cryptol. ePrint Arch., 2013

Electronic Colloquium on Computational Complexity (ECCC), 2013

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

J. ACM, 2012

Electronic Colloquium on Computational Complexity (ECCC), 2012

Bull. EATCS, 2012

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

J. Cryptology, 2011

IACR Cryptol. ePrint Arch., 2011

Electronic Colloquium on Computational Complexity (ECCC), 2011

Electronic Colloquium on Computational Complexity (ECCC), 2011

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

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

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

IACR Cryptol. ePrint Arch., 2009

Electronic Colloquium on Computational Complexity (ECCC), 2009

Electronic Colloquium on Computational Complexity (ECCC), 2009

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

Proceedings of the Approximation, 2009

Cambridge University Press, ISBN: 978-0-521-42426-4, 2009

2008

IACR Cryptol. ePrint Arch., 2008

IACR Cryptol. ePrint Arch., 2008

IACR Cryptol. ePrint Arch., 2008

Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2008

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

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

SIAM J. Comput., 2006

J. Comput. Syst. Sci., 2006

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

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

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

IACR Cryptol. ePrint Arch., 2004

Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003

Proceedings of the Approximation, 2003

Proceedings of the Cryptographic Hardware and Embedded Systems, 2003

2002

Electronic Colloquium on Computational Complexity (ECCC), 2002

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

IACR Cryptol. ePrint Arch., 2001

Electronic Colloquium on Computational Complexity (ECCC), 2001

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

1999

Proceedings of the CCS '99, 1999