views: 272

# Boaz Barak

Professor

Sign in to view more

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Sign in to view more

Education

Sign in to view more

Bio

Boaz Barak is the Gordon McKay professor of Computer Science at Harvard University's John A. Paulson school of Engineering and Applied Sciences. Until January 2016 he will also continue in his position as a principal researcher in Microsoft Research New England where he has worked since 2010.

His research interests include all areas of theoretical computer science, particularly cryptography and computational complexity. Previously, he was an associate professor (with tenure) at Princeton University's computer science department, and before that a member in the School of Math at the Institute for Advanced Study. Barak has won the Packard and Sloan fellowships, and was also selected for Foreign Policy magazine's list of 100 leading global thinkers for 2014. He serves on the editorial boards of the Journal of the ACM, the Theory of Computing Journal, and the Electronic Colloquium of Computational Complexity, and is a member of the Committee for the Advancement of Theoretical Computer Science and of the board of trustees of the Computational Complexity Foundation. He wrote with Sanjeev Arora the textbook: Computational Complexity: A Modern Approach.

His research interests include all areas of theoretical computer science, particularly cryptography and computational complexity. Previously, he was an associate professor (with tenure) at Princeton University's computer science department, and before that a member in the School of Math at the Institute for Advanced Study. Barak has won the Packard and Sloan fellowships, and was also selected for Foreign Policy magazine's list of 100 leading global thinkers for 2014. He serves on the editorial boards of the Journal of the ACM, the Theory of Computing Journal, and the Electronic Colloquium of Computational Complexity, and is a member of the Committee for the Advancement of Theoretical Computer Science and of the board of trustees of the Computational Complexity Foundation. He wrote with Sanjeev Arora the textbook: Computational Complexity: A Modern Approach.

## Papers106 papers

Sort

By YearBy Citation

Science & Global Security, pp.1-12, (2020)

ICLR, (2020)

Preetum Nakkiran, Gal Kaplun, Dimitris Kalimeris, Tristan Yang, Benjamin L. Edelman, Fred Zhang,Boaz Barak

arXiv: Learning, (2019)

Dimitris Kalimeris, Gal Kaplun, Preetum Nakkiran, Ben Edelman, Tristan Yang,Boaz Barak, Haofeng Zhang

NeurIPS, pp.3491-3501, (2019)

Cited by

**5**EIBibtexElectronic Colloquium on Computational Complexity (ECCC), (2018)

IACR Cryptology ePrint Archive, (2018): 1237

EUROCRYPT, pp.649-679, (2018)

neural information processing systems, (2018): 9186-9194

Electronic Colloquium on Computational Complexity (ECCC), (2017)

Electronic Colloquium on Computational Complexity (ECCC), (2016): 428-437

COLT, pp.417-445, (2016)

IACR Cryptology ePrint Archive, (2016)

Electronic Colloquium on Computational Complexity (ECCC), (2015)

symposium on the theory of computing, (2015)

Electronic Colloquium on Computational Complexity (ECCC), (2014)

Bulletin of the EATCS, (2014)

Nature, no. 7506 (2014): 497-502

STOC, (2014): 31-40

Uri Ashery,Noa Bielopolski,Ayal Lavi,Boaz Barak, Lirin Michaeli, Yoav Bensimon,Anton Sheinin,Dana Baron, Zehavit Shapira,Irit Gottfried

(2014)

SIAM Journal on Computing, no. 3 (2013): 1327-1363

ITCS, pp.197-214, (2013)

Computational Complexity, no. 2 (2013): 215-217

EUROCRYPT, (2013): 221-238

TCC, (2013): 26-51

Electronic Colloquium on Computational Complexity (ECCC), (2012): 120

Bulletin of the EATCS, no. 108 (2012): 130-142

Electronic Colloquium on Computational Complexity (ECCC), no. 2 (2012): ArticleNo.6-ArticleNo.6

(2012)

Bibtex

SIAM: SIAM Journal on Computing, no. 5 (2012): 370-379

Proceedings of the National Academy of Sciences of the United States of America, no. 48 (2012): 19213-19219

symposium on the theory of computing, (2012): 307-326

Electronic Colloquium on Computational Complexity (ECCC), (2011)

IACR Cryptology ePrint Archive, (2011): 1-20

foundations of computer science, (2011): 472-481

Proceedings of the forty-third annual ACM symposium on Theory of computing, pp.519-528, (2011)

A study of privacy and fairness in sensitive data analysis, (2011)

Cited by

**7**EIBibtexCommun. ACM, no. 5 (2011): 101-107

STOC, pp.519-528, (2011)

STOC, pp.171-180, (2010)

Journal of the ACM (JACM), no. 5 (2010)

I4CS, pp.49-65, (2010)

Studies in the efficiency and (versus) security of cryptographic tasks, (2010)

Cited by

**1**EIBibtexElectronic Colloquium on Computational Complexity (ECCC), no. 4 (2010): ArticleNo.20-ArticleNo.20

Clinical Orthopaedics and Related Research, (2010)

Cited by

**1**BibtexIACR Cryptology ePrint Archive, (2010): 423-444

SODA, pp.1193-1200, (2009)

Computational Complexity: A Modern Approach, (2009)

APPROX-RANDOM, pp.352-365, (2009)

CRYPTO, pp.374-390, (2009)

International Journal of Behavioral Development, no. 1 (2009): 2-11

Clinical Orthopaedics and Related Research, (2009)

Towards securing interdomain routing on the internet, (2009)

Cited by

**1**EIBibtexNew perspectives on the complexity of computational learning, and other problems in theoretical comp..., (2009)

Cited by

**3**EIBibtexSymposium on Discrete Algorithms, pp.512-531, (2009)

IACR Cryptology ePrint Archive, (2008)

EUROCRYPT, pp.341-360, (2008)

FOCS, pp.374-383, (2008)

Clinical Orthopaedics and Related Research, (2008): 680-688

FOCS, pp.211-220, (2008)

Electronic Colloquium on Computational Complexity, no. 5 (2008): 1661-1694

SIGMETRICS'08: Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Mo..., no. 1 (2008): 193-204

IACR Cryptology ePrint Archive, (2008)

(2008)

Cited by

**2**BibtexPODS, pp.273-282, (2007)

Journal of Cryptology, no. 4 (2007): 720-760

Siam Journal on Computing, no. 2 (2007): 380-400

STOC, pp.671-680, (2006)

IACR Cryptology ePrint Archive, (2006): 345-354

(2006)

Cited by

**17**BibtexElectronic Colloquium on Computational Complexity, no. 2 (2006): 321-391

Computer and Communications Security, (2005)

Cited by

**105**BibtexIACR Cryptology ePrint Archive, (2005): 203-212

Electronic Colloquium on Computational Complexity (ECCC), (2005): 543-552

TCC, pp.121-132, (2004)

IEEE Symposium on Foundations of Computer Science, (2004)

Cited by

**195**BibtexIACR Cryptology ePrint Archive, (2004)

FOCS, pp.186-195, (2004)

SIAM J. Comput., no. 4 (2004): 384-393

RANDOM-APPROX, pp.200-215, (2003)

CHES, pp.166-180, (2003)

FOCS, pp.345-355, (2002)

(2002)

Cited by

**11**BibtexRANDOM, pp.194-208, (2002)

SIAM J. Comput., no. 4 (2002): 484-493

IACR Cryptology ePrint Archive, (2001): 116-116

FOCS, pp.106-115, (2001)

IACR Cryptology ePrint Archive, (2001): 63

Cited by

**116**BibtexInternational Crytology Conference, (2001)

Cited by

**30**BibtexPODC, pp.133-142, (2000)

View All