\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n

\n generated by\n \n $\"bibbase.org\"\n$ \n \n

\n \n\n

\n\n

\n \n Group by\n \n \n
- \n Year\n
- \n Author\n
- \n Type\n
- \n Keyword\n
- \n Downloads\n
\n
\n \n \n \n \n
- \n \n Expand/Collapse All\n \n
- \n \n Download BibTeX\n \n
- \n \n RSS Feed\n \n
\n

\n\n\n

\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n

\n JavaScript\n (easiest)\n

\n            <script src=\"https://bibbase.org/show?bib=www.boazbarak.org%2Fboaz.bib&jsonp=1&css=https://www.boazbarak.org/css/bibBaseAll.css&jsonp=1\"></script>\n

\n\n PHP\n

\n            <?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=www.boazbarak.org%2Fboaz.bib&jsonp=1&css=https://www.boazbarak.org/css/bibBaseAll.css\");\n            print_r($contents);\n            ?>\n

\n\n iFrame\n (not recommended)\n

\n            <iframe src=\"https://bibbase.org/show?bib=www.boazbarak.org%2Fboaz.bib&jsonp=1&css=https://www.boazbarak.org/css/bibBaseAll.css\"></iframe>\n

\n\n

\n For more details see the documention.\n

\n\n

\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n

\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

renew the authorization for BibBase on Mendeley, and
update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n

\n\n

\n \n \n Fix it now\n

\n\n

\n\n\n

\n \n \n

\n \n 2023\n \n \n (6)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Watermarks in the Sand: Impossibility of Strong Watermarking for Generative Models.\n \n \n \n \n\n\n \n Zhang, H.; Edelman, B. L.; Francati, D.; Venturi, D.; Ateniese, G.; and Barak, B.\n\n\n \n\n\n\n arXiV, abs/2311.04378. 2023.\n \n\n\n\n
\n\n\n\n \n \n $\"Watermarks$ Paper\n \n \n \n $\"Watermarks$ blog\n \n \n \n $\"Watermarks$ paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 15 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2311-04378,\n  author       = {Hanlin Zhang and\n                  Benjamin L. Edelman and\n                  Danilo Francati and\n                  Daniele Venturi and\n                  Giuseppe Ateniese and\n                  Boaz Barak},\n  title        = {Watermarks in the Sand: Impossibility of Strong Watermarking for Generative\n                  Models},\n  journal      = {arXiV},\n  volume       = {abs/2311.04378},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2311.04378},\n  doi          = {10.48550/ARXIV.2311.04378},\n  eprinttype    = {arXiv},\n  eprint       = {2311.04378},\n  timestamp    = {Tue, 14 Nov 2023 14:47:55 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2311-04378.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org},\n  url_blog = {https://www.harvard.edu/kempner-institute/2023/11/09/watermarking-in-the-sand/},\n  url_paper = {https://arxiv.org/abs/2311.04378},\n  selected = {yes}\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n Robust reconstruction of single cell RNA-seq data with iterative gene weight updates.\n \n \n \n\n\n \n Sheng, Y.; Nitzan, M.; and Barak, B.\n\n\n \n\n\n\n In Thirty-first Conference on Intelligent Systems for Molecular Biology, 2023. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{sheng2023robust,\n  author    = {Yueqi Sheng and Mor Nitzan and Boaz Barak},\n  title     = {Robust reconstruction of single cell RNA-seq data with iterative gene weight updates},\n  booktitle = {Thirty-first Conference on Intelligent Systems for Molecular Biology},\n  year      = {2023},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Beyond Implicit Bias: The Insignificance of SGD Noise in Online Learning.\n \n \n \n \n\n\n \n Vyas, N.; Morwani, D.; Zhao, R.; Kaplun, G.; Kakade, S. M.; and Barak, B.\n\n\n \n\n\n\n In Thirty-seventh Conference on Neural Information Processing Systems, 2023. \n \n\n\n\n
\n\n\n\n \n \n $\"Beyond$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 30 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{vyas2023beyond,\n  author    = {Nikhil Vyas and Depen Morwani and Rosie Zhao and Gal Kaplun and Sham M. Kakade and Boaz Barak},\n  title     = {Beyond Implicit Bias: The Insignificance of SGD Noise in Online Learning},\n  booktitle = {Thirty-seventh Conference on Neural Information Processing Systems},\n  year      = {2023},\n  url_paper      = {https://arxiv.org/abs/2306.08590}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Scaling Data-Constrained Language Models.\n \n \n \n \n\n\n \n Muennighoff, N.; Rush, A. M.; Barak, B.; Scao, T. L.; Piktus, A.; Tazi, N.; Pyysalo, S.; Wolf, T.; and Raffel, C.\n\n\n \n\n\n\n In Thirty-seventh Conference on Neural Information Processing Systems, 2023. \n Outstanding Main Track Paper award, Runner-Up\n\n\n\n
\n\n\n\n \n \n $\"Scaling$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{muennighoff2023scaling,\n  author    = {Niklas Muennighoff and Alexander M. Rush and Boaz Barak and Teven Le Scao and Aleksandra Piktus and Nouamane Tazi and Sampo Pyysalo and Thomas Wolf and Colin Raffel},\n  title     = {Scaling Data-Constrained Language Models},\n  booktitle = {Thirty-seventh Conference on Neural Information Processing Systems},\n  year      = {2023},\n  url_paper     = {https://arxiv.org/abs/2305.16264},\n  note = {Outstanding Main Track Paper award, Runner-Up},\n  selected = {yes}\n}\n\n\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n On Provable Copyright Protection for Generative Models.\n \n \n \n \n\n\n \n Vyas, N.; Kakade, S. M.; and Barak, B.\n\n\n \n\n\n\n In International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA, volume 202, of Proceedings of Machine Learning Research, pages 35277–35299, 2023. PMLR\n \n\n\n\n
\n\n\n\n \n \n $\"On$ Paper\n \n \n \n $\"On$ paper\n \n \n \n $\"On$ blog\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/VyasKB23,\n  author       = {Nikhil Vyas and\n                  Sham M. Kakade and\n                  Boaz Barak},\n  title        = {On Provable Copyright Protection for Generative Models},\n  booktitle    = {International Conference on Machine Learning, {ICML} 2023, 23-29 July\n                  2023, Honolulu, Hawaii, {USA}},\n  series       = {Proceedings of Machine Learning Research},\n  volume       = {202},\n  pages        = {35277--35299},\n  publisher    = {{PMLR}},\n  year         = {2023},\n  url          = {https://proceedings.mlr.press/v202/vyas23b.html},\n  timestamp    = {Mon, 28 Aug 2023 17:23:09 +0200},\n  biburl       = {https://dblp.org/rec/conf/icml/VyasKB23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org},\n  url_paper     = {https://arxiv.org/abs/2302.10870},\n  url_blog = {https://windowsontheory.org/2023/02/21/provable-copyright-protection-for-generative-models/},\n  selected = {yes}\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Named Tensor Notation.\n \n \n \n \n\n\n \n Chiang, D.; Rush, A. M.; and Barak, B.\n\n\n \n\n\n\n Transactions on Machine learning Research. 2023.\n \n\n\n\n
\n\n\n\n \n \n $\"Named$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 19 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{chiang2023named,\n  author    = {David Chiang and Alexander M. Rush and Boaz Barak},\n  title     = {Named Tensor Notation},\n  journal   = {Transactions on Machine learning Research},\n  year      = {2023},\n  url_paper           = {https://arxiv.org/abs/2102.13196}\n}\n\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2022\n \n \n (5)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Quantum optimization of maximum independent set using Rydberg atom arrays.\n \n \n \n \n\n\n \n Ebadi, S.; Keesling, A.; Cain, M.; Wang, T. T.; Levine, H.; Bluvstein, D.; Semeghini, G.; Omran, A.; Liu, J.; Samajdar, R.; Luo, X.; Nash, B.; Gao, X.; Barak, B.; Farhi, E.; Sachdev, S.; Gemelke, N.; Zhou, L.; Choi, S.; Pichler, H.; Wang, S.; Greiner, M.; Vuletić, V.; and Lukin, M. D.\n\n\n \n\n\n\n Science, 376(6598): 1209-1215. 2022.\n \n\n\n\n
\n\n\n\n \n \n $\"Quantum$ Paper\n \n \n \n $\"Quantum$ paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 9 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{sciencequantum22,\n\t\tauthor = {S. Ebadi and A. Keesling and M. Cain and T. T. Wang and H. Levine and D. Bluvstein and G. Semeghini and A. Omran and J.-G. Liu and R. Samajdar and X.-Z. Luo and B. Nash and X. Gao and B. Barak and E. Farhi and S. Sachdev and N. Gemelke and L. Zhou and S. Choi and H. Pichler and S.-T. Wang and M. Greiner and V. Vuleti{\\'c} and M. D. Lukin},\n\tdoi = {10.1126/science.abo6587},\n\teprint = {https://www.science.org/doi/pdf/10.1126/science.abo6587},\n\tjournal = {Science},\n\tnumber = {6598},\n\tpages = {1209-1215},\n\ttitle = {Quantum optimization of maximum independent set using Rydberg atom arrays},\n\turl = {https://www.science.org/doi/abs/10.1126/science.abo6587},\n\tvolume = {376},\n\tyear = {2022},\n\turl_paper = {https://arxiv.org/abs/2202.09372}\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Noisy tensor completion via the sum-of-squares hierarchy.\n \n \n \n \n\n\n \n Barak, B.; and Moitra, A.\n\n\n \n\n\n\n Math. Program., 193(2): 513–548. 2022.\n Preliminary version in COLT 2016\n\n\n\n
\n\n\n\n \n \n $\"Noisy$ Paper\n \n \n \n $\"Noisy$ paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 23 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{BarakMoitra22,\n  author    = {Boaz Barak and\n               Ankur Moitra},\n  title     = {Noisy tensor completion via the sum-of-squares hierarchy},\n  journal   = {Math. Program.},\n  volume    = {193},\n  number    = {2},\n  pages     = {513--548},\n  year      = {2022},\n  url       = {https://doi.org/10.1007/s10107-022-01793-9},\n  doi       = {10.1007/s10107-022-01793-9},\n  timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},\n  biburl    = {https://dblp.org/rec/journals/mp/BarakM22.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org},\n  url_paper ={http://arxiv.org/abs/1501.06521},\n  note = {Preliminary version in COLT 2016}\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Deconstructing Distributions: A Pointwise Framework of Learning.\n \n \n \n \n\n\n \n Kaplun, G.; Ghosh, N.; Garg, S.; Barak, B.; and Nakkiran, P.\n\n\n \n\n\n\n CoRR, abs/2202.09931. 2022.\n \n\n\n\n
\n\n\n\n \n \n $\"Deconstructing$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{KaplunGGBN22,\n  author    = {Gal Kaplun and\n               Nikhil Ghosh and\n               Saurabh Garg and\n               Boaz Barak and\n               Preetum Nakkiran},\n  title     = {Deconstructing Distributions: {A} Pointwise Framework of Learning},\n  journal   = {CoRR},\n  volume    = {abs/2202.09931},\n  year      = {2022},\n  url       = {https://arxiv.org/abs/2202.09931},\n  eprinttype = {arXiv},\n  eprint    = {2202.09931},\n  timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},\n  biburl    = {https://dblp.org/rec/journals/corr/abs-2202-09931.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit.\n \n \n \n \n\n\n \n Barak, B.; Edelman, B. L.; Goel, S.; Kakade, S. M.; Malach, E.; and Zhang, C.\n\n\n \n\n\n\n CoRR, abs/2207.08799. 2022.\n \n\n\n\n
\n\n\n\n \n \n $\"Hidden$ Paper\n \n \n \n $\"Hidden$ paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 24 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{BarakEGKMZ22,\n  author    = {Boaz Barak and\n               Benjamin L. Edelman and\n               Surbhi Goel and\n               Sham M. Kakade and\n               Eran Malach and\n               Cyril Zhang},\n  title     = {Hidden Progress in Deep Learning: {SGD} Learns Parities Near the Computational\n               Limit},\n  journal   = {CoRR},\n  volume    = {abs/2207.08799},\n  year      = {2022},\n  url       = {https://doi.org/10.48550/arXiv.2207.08799},\n  doi       = {10.48550/arXiv.2207.08799},\n  eprinttype = {arXiv},\n  eprint    = {2207.08799},\n  url_paper = {https://arxiv.org/abs/2207.08799},\n  timestamp = {Tue, 19 Jul 2022 01:00:00 +0200},\n  biburl    = {https://dblp.org/rec/journals/corr/abs-2207-08799.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Classical algorithms and quantum limitations for maximum cut on high-girth graphs.\n \n \n \n \n\n\n \n Barak, B.; and Marwaha, K.\n\n\n \n\n\n\n In ITCS, volume 215, of LIPIcs, pages 14:1–14:21, 2022. \n Also presented as poster in QIP 2022\n\n\n\n
\n\n\n\n \n \n $\"Classical$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 9 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakMarwaha22,\n  author     = {Boaz Barak and\n                Kunal Marwaha},\n  title      = {Classical algorithms and quantum limitations for maximum cut on high-girth\n                graphs},\n  journal    = {CoRR},\n  booktitle = {ITCS},\n  year       = {2022},\n  url_paper        = {https://arxiv.org/abs/2106.05900},\n  eprinttype = {arXiv},\n  eprint     = {2106.05900},\n  series    = {LIPIcs},\n  volume    = {215},\n  pages     = {14:1--14:21},\n  timestamp  = {Thu, 14 Oct 2021 09:14:50 +0200},\n  biburl     = {https://dblp.org/rec/journals/corr/abs-2106-05900.bib},\n  bibsource  = {dblp computer science bibliography, https://dblp.org},\n  note=  {Also presented as poster in QIP 2022}\n}\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2021\n \n \n (6)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Revisiting Model Stitching to Compare Neural Representations.\n \n \n \n \n\n\n \n Bansal, Y.; Nakkiran, P.; and Barak, B.\n\n\n \n\n\n\n In NeurIPS, 2021. \n \n\n\n\n
\n\n\n\n \n \n $\"Revisiting$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BansalNB21,\n  author     = {Yamini Bansal and\n                Preetum Nakkiran and\n                Boaz Barak},\n  title      = {Revisiting Model Stitching to Compare Neural Representations},\n  journal    = {CoRR},\n  booktitle = {NeurIPS},\n  year       = {2021},\n  url_paper        = {https://arxiv.org/abs/2106.07682},\n  eprinttype = {arXiv},\n  eprint     = {2106.07682},\n  timestamp  = {Tue, 29 Jun 2021 16:55:04 +0200},\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage.\n \n \n \n \n\n\n \n Gao, X.; Kalinowski, M.; Chou, C.; Lukin, M. D.; Barak, B.; and Choi, S.\n\n\n \n\n\n\n CoRR, abs/2112.01657. 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"Limitations$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{GaoKCLBC21,\n  author     = {Xun Gao and\n                Marcin Kalinowski and\n                Chi{-}Ning Chou and\n                Mikhail D. Lukin and\n                Boaz Barak and\n                Soonwon Choi},\n  title      = {Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage},\n  journal    = {CoRR},\n  volume     = {abs/2112.01657},\n  year       = {2021},\n  url_paper        = {https://arxiv.org/abs/2112.01657},\n  eprinttype = {arXiv},\n  eprint     = {2112.01657},\n  timestamp  = {Wed, 08 Dec 2021 14:48:59 +0100},\n  biburl     = {https://dblp.org/rec/journals/corr/abs-2112-01657.bib},\n  bibsource  = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Playing Unique Games on Certified Small-Set Expanders.\n \n \n \n \n\n\n \n Bafna, M.; Barak, B.; Kothari, P.; Schramm, T.; and Steurer, D.\n\n\n \n\n\n\n STOC, abs/2006.09969. 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"Playing$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 17 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{BBKSS21,\n  author        = {Mitali Bafna and\n               Boaz Barak and\n               Pravesh Kothari and\n               Tselil Schramm and\n               David Steurer},\n  title         = {Playing Unique Games on Certified Small-Set Expanders},\n  journal       = {STOC},\n  volume        = {abs/2006.09969},\n  year          = {2021},\n  \n  url           = {https://arxiv.org/abs/2006.09969},\n  archiveprefix = {arXiv},\n  eprint        = {2006.09969},\n  timestamp     = {Tue, 23 Jun 2020 17:57:22 +0200},\n  biburl        = {https://dblp.org/rec/journals/corr/abs-2006-09969.bib},\n  bibsource     = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits.\n \n \n \n \n\n\n \n Barak, B.; Chou, C.; and Gao, X.\n\n\n \n\n\n\n In Lee, J. R., editor(s), 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6-8, 2021, Virtual Conference, volume 185, of LIPIcs, pages 30:1–30:20, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n $\"Spoofing$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 17 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/innovations/BarakCG21,\n  author    = {Boaz Barak and\n               Chi{-}Ning Chou and\n               Xun Gao},\n  editor    = {James R. Lee},\n  title     = {Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits},\n  booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}\n               2021, January 6-8, 2021, Virtual Conference},\n  series    = {LIPIcs},\n  volume    = {185},\n  pages     = {30:1--30:20},\n  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year      = {2021},\n  url       = {https://arxiv.org/abs/2005.02421},\n  doi       = {10.4230/LIPIcs.ITCS.2021.30},\n  timestamp = {Thu, 04 Feb 2021 17:31:41 +0100},\n  biburl    = {https://dblp.org/rec/conf/innovations/BarakCG21.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Work with what you've got.\n \n \n \n \n\n\n \n Barak, B.\n\n\n \n\n\n\n Nature Physics. Feb 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"Work$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 81 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{Barak2021,\n  author   = {Barak, Boaz},\n  title    = {Work with what you've got},\n  journal  = {Nature Physics},\n  year     = {2021},\n  month    = {Feb},\n  day      = {04},\n  abstract = {Quantum computing combines great promise with daunting challenges --- the road to devices that solve real-world problems is still long. Now, an implementation of a quantum algorithm maps the problems we want to solve to the devices we already have.},\n  issn     = {1745-2481},\n  doi      = {10.1038/s41567-020-01126-7},\n  url      = {https://doi.org/10.1038/s41567-020-01126-7}\n}\n\n\n\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n For self-supervised learning, Rationality implies generalization, provably.\n \n \n \n \n\n\n \n Bansal, Y.; Kaplun, G.; and Barak, B.\n\n\n \n\n\n\n In International Conference on Learning Representations, 2021. \n \n\n\n\n
\n\n\n\n \n \n $\"For$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 43 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{bansal2021for,\n  title     = {For self-supervised learning, Rationality implies generalization, provably},\n  author    = {Yamini Bansal and Gal Kaplun and Boaz Barak},\n  booktitle = {International Conference on Learning Representations},\n  year      = {2021},\n  url           = {https://arxiv.org/abs/2010.08508},\n}\n\n\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2020\n \n \n (4)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n On Higher-Order Cryptography.\n \n \n \n \n\n\n \n Barak, B.; Crubillé, R.; and Lago, U. D.\n\n\n \n\n\n\n In Czumaj, A.; Dawar, A.; and Merelli, E., editor(s), 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference), volume 168, of LIPIcs, pages 108:1–108:16, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n $\"On$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 38 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icalp/BarakCL20,\n  author    = {Boaz Barak and\n               Rapha{\\"{e}}lle Crubill{\\'{e}} and\n               Ugo Dal Lago},\n  editor    = {Artur Czumaj and\n               Anuj Dawar and\n               Emanuela Merelli},\n  title     = {On Higher-Order Cryptography},\n  booktitle = {47th International Colloquium on Automata, Languages, and Programming,\n               {ICALP} 2020, July 8-11, 2020, Saarbr{\\"{u}}cken, Germany (Virtual\n               Conference)},\n  series    = {LIPIcs},\n  volume    = {168},\n  pages     = {108:1--108:16},\n  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year      = {2020},\n  url       = {hhttps://arxiv.org/abs/2002.07218},\n  doi       = {10.4230/LIPIcs.ICALP.2020.108}\n  }\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n Physical public templates for nuclear warhead verification.\n \n \n \n\n\n \n Glaser, A.; Barak, B.; Kütt, M.; and Philippe, S.\n\n\n \n\n\n\n Science & Global Security, 28(1): 48–59. 2020.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{glaser2020physical,\n  title={Physical public templates for nuclear warhead verification},\n  author={Glaser, Alexander and Barak, Boaz and K{\\"u}tt, Moritz and Philippe, S{\\'e}bastien},\n  journal={Science \\& Global Security},\n  volume={28},\n  number={1},\n  pages={48--59},\n  year={2020},\n  publisher={Taylor \\& Francis}\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Optimizing testing policies for detecting COVID-19 outbreaks.\n \n \n \n \n\n\n \n Yuval, J.; Nitzan, M.; Tannenbaum, N. R.; and Barak, B.\n\n\n \n\n\n\n arXiv preprint arXiv:2007.04827. 2020.\n \n\n\n\n
\n\n\n\n \n \n $\"Optimizing$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{yuval2020optimizing,\n  title   = {Optimizing testing policies for detecting COVID-19 outbreaks},\n  author  = {Yuval, Janni and Nitzan, Mor and Tannenbaum, Neta Ravid and Barak, Boaz},\n  journal = {arXiv preprint arXiv:2007.04827},\n  year    = {2020},\n  url = {https://arxiv.org/abs/2007.04827}\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Deep Double Descent: Where Bigger Models and More Data Hurt.\n \n \n \n \n\n\n \n Nakkiran, P.; Kaplun, G.; Bansal, Y.; Yang, T.; Barak, B.; and Sutskever, I.\n\n\n \n\n\n\n In ICLR 2020, 2020. \n Also appeared in Journal of Statistical Mechanics, 2021\n\n\n\n
\n\n\n\n \n \n $\"Deep$ Paper\n \n \n \n $\"Deep$ blog\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 28 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:journals/corr/abs-1912-02292,\n  author    = {Preetum Nakkiran and\n               Gal Kaplun and\n               Yamini Bansal and\n               Tristan Yang and\n               Boaz Barak and\n               Ilya Sutskever},\n  title     = {Deep Double Descent: Where Bigger Models and More Data Hurt},\n  booktitle = {ICLR 2020},\n  year      = {2020},\n  url       = {http://arxiv.org/abs/1912.02292},\n  archivePrefix = {arXiv},\n  eprint    = {1912.02292},\n  timestamp = {Thu, 02 Jan 2020 18:08:18 +0100},\n  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1912-02292},\n  bibsource = {dblp computer science bibliography, https://dblp.org},\n  note = {Also appeared in Journal of Statistical Mechanics, 2021},\n  url_blog = {https://windowsontheory.org/2019/12/05/deep-double-descent/},\n  selected = {yes}\n}\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2019\n \n \n (5)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Sum-of-Squares Meets Program Obfuscation, Revisited.\n \n \n \n \n\n\n \n Barak, B.; Hopkins, S. B.; Jain, A.; Kothari, P.; and Sahai, A.\n\n\n \n\n\n\n In EUROCRYPT 2019, pages 226–250, 2019. \n \n\n\n\n
\n\n\n\n \n \n $\"Sum-of-Squares$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 20 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakHJKS19,\n  author    = {Boaz Barak and\n               Samuel B. Hopkins and\n               Aayush Jain and\n               Pravesh Kothari and\n               Amit Sahai},\n  title     = {Sum-of-Squares Meets Program Obfuscation, Revisited},\n  booktitle = {{EUROCRYPT} 2019},\n  pages     = {226--250},\n  year      = {2019},\n  doi       = {10.1007/978-3-030-17653-2\\_8},\n  timestamp = {Tue, 14 May 2019 13:49:02 +0200},\n  biburl    = {https://dblp.org/rec/bib/conf/eurocrypt/BarakHJKS19},\n  bibsource = {dblp computer science bibliography, https://dblp.org},\n  url  = {https://eprint.iacr.org/2018/1237}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n SGD on Neural Networks Learns Functions of Increasing Complexity.\n \n \n \n \n\n\n \n Nakkiran, P.; Kaplun, G.; Kalimeris, D.; Yang, T.; Edelman, B. L.; Zhang, F.; and Barak, B.\n\n\n \n\n\n\n In NeurIPS 2019 (spotlight), volume abs/1905.11604, 2019. \n \n\n\n\n
\n\n\n\n \n \n $\"SGD$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 13 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:journals/corr/abs-1905-11604,\n  author    = {Preetum Nakkiran and\n               Gal Kaplun and\n               Dimitris Kalimeris and\n               Tristan Yang and\n               Benjamin L. Edelman and\n               Fred Zhang and\n               Boaz Barak},\n  title     = {{SGD} on Neural Networks Learns Functions of Increasing Complexity},\n  booktitle = {NeurIPS 2019 (spotlight)},\n  volume    = {abs/1905.11604},\n  year      = {2019},\n  url       = {http://arxiv.org/abs/1905.11604},\n  archivePrefix = {arXiv},\n  eprint    = {1905.11604},\n  timestamp = {Mon, 03 Jun 2019 13:42:33 +0200},\n  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1905-11604},\n  bibsource = {dblp computer science bibliography, https://dblp.org},\n  selected = {yes},\n}\n\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n (Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs.\n \n \n \n \n\n\n \n Barak, B.; Chou, C.; Lei, Z.; Schramm, T.; and Sheng, Y.\n\n\n \n\n\n\n In NeurIPS 2019, 2019. \n \n\n\n\n
\n\n\n\n \n \n $\"(Nearly)$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 26 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BCLSS18,\n  author    = {Boaz Barak and\n               Chi{-}Ning Chou and\n               Zhixian Lei and\n               Tselil Schramm and\n               Yueqi Sheng},\n  title     = {(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated\n               Random Graphs},\n  year      = {2019},\n  booktitle = {NeurIPS 2019},\n  url       = {http://arxiv.org/abs/1805.02349},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture.\n \n \n \n \n\n\n \n Barak, B.; Kothari, P.; and Steurer, D.\n\n\n \n\n\n\n In ITCS 2019, 2019. \n \n\n\n\n
\n\n\n\n \n \n $\"Small-Set$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakKS18,\n  author    = {Boaz Barak and\n               Pravesh Kothari and\n               David Steurer},\n  title     = {Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture},\n  booktitle   = {ITCS 2019},\n  year      = {2019},\n  url       = {https://eccc.weizmann.ac.il/report/2018/077},\n  timestamp = {Tue, 22 May 2018 13:28:58 +0200},\n  biburl    = {https://dblp.org/rec/bib/journals/eccc/BarakKS18},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem.\n \n \n \n \n\n\n \n Barak, B.; Hopkins, S. B.; Kelner, J. A.; Kothari, P. K.; Moitra, A.; and Potechin, A.\n\n\n \n\n\n\n SIAM J. Comput., 48(2): 687–735. 2019.\n Special issue for FOCS 2016\n\n\n\n
\n\n\n\n \n \n $\"A$ paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 9 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{BarakHKKMP19,\n  author    = {Boaz Barak and\n               Samuel B. Hopkins and\n               Jonathan A. Kelner and\n               Pravesh K. Kothari and\n               Ankur Moitra and\n               Aaron Potechin},\n  title     = {A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem},\n  journal   = {{SIAM} J. Comput.},\n  volume    = {48},\n  number    = {2},\n  pages     = {687--735},\n  year      = {2019},\n  doi       = {10.1137/17M1138236},\n  timestamp = {Thu, 23 May 2019 17:55:00 +0200},\n  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/BarakHKKMP19},\n  bibsource = {dblp computer science bibliography, https://dblp.org},\n  url_paper = {http://eccc.hpi-web.de/report/2016/058/},\n   selected = {yes},\n  note = {Special issue for  FOCS 2016}\n}\n\n\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2018\n \n \n (1)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation).\n \n \n \n \n\n\n \n Barak, B.; Brakerski, Z.; Komargodski, I.; and Kothari, P.\n\n\n \n\n\n\n In EUROCRYPT, 2018. \n \n\n\n\n
\n\n\n\n \n \n $\"Limits$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakBKK17,\n  AUTHOR =       {Boaz Barak and  Zvika Brakerski and  Ilan Komargodski and  Pravesh Kothari },\n  TITLE =        {Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation)},\n  booktitle = {EUROCRYPT},\n  year      = {2018},\n  url_paper = {https://eccc.weizmann.ac.il/report/2017/060/},\n  selected = {yes},\n}\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2017\n \n \n (2)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n The Complexity of Public-Key Cryptography.\n \n \n \n \n\n\n \n Barak, B.\n\n\n \n\n\n\n In 2017. \n Tutorial/survey in honor of Oded Goldreich 60th birthday.\n\n\n\n
\n\n\n\n \n \n $\"The$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 15 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{Barak17,\n    author = {Boaz Barak},\n    title = {The Complexity of Public-Key Cryptography},\n    year = {2017},\n    url = {https://eccc.weizmann.ac.il/report/2017/065/},\n    note = {Tutorial/survey in honor of Oded Goldreich 60th birthday.}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Quantum entanglement, sum of squares, and the log rank conjecture.\n \n \n \n \n\n\n \n Barak, B.; Kothari, P.; and Steurer, D.\n\n\n \n\n\n\n In STOC, 2017. \n \n\n\n\n
\n\n\n\n \n \n $\"Quantum$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 12 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakKS17,\n  AUTHOR =       {Boaz Barak and Pravesh Kothari and David Steurer},\n  TITLE =        {Quantum entanglement, sum of squares, and the log rank conjecture},\n  booktitle = {STOC},\n  year      = {2017},\n  url_paper = {https://eccc.weizmann.ac.il/report/2017/011/},\n  selected = {yes},\n}\n\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2016\n \n \n (1)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Hopes, Fears, and Software Obfuscation.\n \n \n \n \n\n\n \n Barak, B.\n\n\n \n\n\n\n Communications of the ACM, 59(3): 88–96. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Hopes,$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{Barak16,\n  author = {Boaz Barak},\n  journal= {Communications of the ACM},\n  title = {Hopes, Fears, and Software Obfuscation},\n  volume = {59},\n  number = {3},\n  pages = {88--96},\n  year = {2016},\n  url_paper = {http://cacm.acm.org/magazines/2016/3/198855-hopes-fears-and-software-obfuscation/fulltext},\n  }\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2015\n \n \n (4)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n Designing protocols for nuclear warhead verification.\n \n \n \n\n\n \n Philippe, S.; Barak, B.; and Glaser, A.\n\n\n \n\n\n\n In Proc. 56th Annual INMM Meeting, 2015. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BNuclear2017,\n  title={Designing protocols for nuclear warhead verification},\n  author={Philippe, S{\\'e}bastien and Barak, Boaz and Glaser, Alexander},\n  booktitle={Proc. 56th Annual INMM Meeting},\n  year={2015}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Beating the random assignment on constraint satisfaction problems of bounded degree.\n \n \n \n \n\n\n \n Barak, B.; Moitra, A.; O'Donnell, R.; Raghavendra, P.; Regev, O.; Steurer, D.; Trevisan, L.; Vijayaraghavan, A.; Witmer, D.; and Wright, J.\n\n\n \n\n\n\n In RANDOM-APPROX, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Beating$ eccc\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakMORRSTVWW15,\ntitle= {Beating the random assignment on constraint satisfaction problems of bounded degree},\nauthor = {Boaz Barak and Ankur Moitra and Ryan O'Donnell and Prasad Raghavendra and Oded Regev and David Steurer and Luca Trevisan and Aravindan Vijayaraghavan and David Witmer and John Wright },\nyear = {2015},\nbooktitle = {RANDOM-APPROX},\n url_eccc = {http://eccc.hpi-web.de/report/2015/082/},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sum of Squares Lower Bounds from Pairwise Independence.\n \n \n \n \n\n\n \n Barak, B.; Chan, S. O.; and Kothari, P.\n\n\n \n\n\n\n In STOC, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Sum$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakCK15,\n  AUTHOR =       {Boaz Barak and Siu On Chan and Pravesh Kothari},\n  booktitle = {STOC},\n  TITLE =        {Sum of Squares Lower Bounds from Pairwise Independence},\n  year      = {2015},\n   url_paper = {http://arxiv.org/abs/1501.00734},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method.\n \n \n \n \n\n\n \n Barak, B.; Kelner, J. A.; and Steurer, D.\n\n\n \n\n\n\n In STOC, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Dictionary$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakKelnerS15b,\n  AUTHOR =       {Boaz Barak and Jonathan A. Kelner and David Steurer},\n  TITLE =        {Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method},\n  year      = {2015},\n  booktitle = {STOC},\n   url_paper = {http://arxiv.org/abs/1407.1543},\n}\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2014\n \n \n (8)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n Authenticating nuclear warheads with high confidence.\n \n \n \n\n\n \n Kütt, M.; Philippe, S.; Barak, B.; Glaser, A.; and Goldston, R. J\n\n\n \n\n\n\n In Proceedings of the 55th Annual INMM Meeting, 2014. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BNuclear2014,\n  title={Authenticating nuclear warheads with high confidence},\n  author={K{\\"u}tt, Moritz and Philippe, Sebastien and Barak, Boaz and Glaser, Alexander and Goldston, Robert J},\n  booktitle={Proceedings of the 55th Annual INMM Meeting},\n  year={2014}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A zero-knowledge protocol for nuclear warhead verification.\n \n \n \n \n\n\n \n Glaser, A.; Barak, B.; and Goldston, R. J.\n\n\n \n\n\n\n Nature, 510: 497-502. 2014.\n See also article by R. Stone (Science, June 2014)\n\n\n\n
\n\n\n\n \n \n $\"A$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@ARTICLE{GlaserBG14,\n  author =       {Glaser, Alexander and Barak, Boaz and Goldston, Robert J.},\n  title =        {A zero-knowledge protocol for nuclear warhead verification},\n  journal =      {Nature},\n  year =         {2014},\n  volume =       {510},\n  pages =        {497-502},\n  selected = {yes},\n   url_paper = {http://www.nature.com/nature/journal/v510/n7506/full/nature13457.html},\n   note = {See also article by R. Stone (Science, June 2014)},\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sum-of-squares proofs and the quest toward optimal algorithms.\n \n \n \n \n\n\n \n Barak, B.; and Steurer, D.\n\n\n \n\n\n\n In Proceedings of International Congress of Mathematicians (ICM), 2014. \n \n\n\n\n
\n\n\n\n \n \n $\"Sum-of-squares$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakS14,\n  AUTHOR =       {Boaz Barak and David Steurer},\n  TITLE =        {Sum-of-squares proofs and the quest toward optimal algorithms},\n  booktitle = {Proceedings of International Congress of Mathematicians (ICM)},\n  year      = {2014},\n   url_paper = {http://eccc.hpi-web.de/report/2014/059/},\n}\n\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Fun and Games with Sums of Squares.\n \n \n \n \n\n\n \n Barak, B.\n\n\n \n\n\n\n 2014.\n Also appeared on the ``Windows on Theory'' blog\n\n\n\n
\n\n\n\n \n \n $\"Fun$ pdf\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@unpublished{Barak14,\n  AUTHOR =       {Boaz Barak},\n  TITLE =        {Fun and Games with Sums of Squares},\n  note = {Also appeared on the ``Windows on Theory'' blog},\n  year      = {2014},\n   url_pdf = {https://www.boazbarak.org/Papers/SOS.pdf},\n}\n\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Rounding sum-of-squares relaxations.\n \n \n \n \n\n\n \n Barak, B.; Kelner, J. A.; and Steurer, D.\n\n\n \n\n\n\n In STOC, pages 31-40, 2014. \n \n\n\n\n
\n\n\n\n \n \n $\"Rounding$ Link\n \n \n \n $\"Rounding$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 11 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakKS14,\n  author    = {Boaz Barak and\n               Jonathan A. Kelner and\n               David Steurer},\n  title     = {Rounding sum-of-squares relaxations},\n  booktitle = {STOC},\n  year      = {2014},\n  pages     = {31-40},\n  ee        = {http://doi.acm.org/10.1145/2591796.2591886},\n  bibsource = {DBLP, http://dblp.uni-trier.de},\n  url_paper = {http://eccc.hpi-web.de/report/2014/059/},\n\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Obfuscation for Evasive Functions.\n \n \n \n \n\n\n \n Barak, B.; Bitansky, N.; Canetti, R.; Kalai, Y. T.; Paneth, O.; and Sahai, A.\n\n\n \n\n\n\n In TCC, pages 26-51, 2014. \n \n\n\n\n
\n\n\n\n \n \n $\"Obfuscation$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakBCKPS14,\n  author    = {Boaz Barak and\n               Nir Bitansky and\n               Ran Canetti and\n               Yael Tauman Kalai and\n               Omer Paneth and\n               Amit Sahai},\n  title     = {Obfuscation for Evasive Functions},\n  booktitle = {TCC},\n  year      = {2014},\n  pages     = {26-51},\n  bibsource = {DBLP, http://dblp.uni-trier.de},\n       url_paper = {http://eprint.iacr.org/2013/668}\n\n}\n\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Protecting Obfuscation against Algebraic Attacks.\n \n \n \n \n\n\n \n Barak, B.; Garg, S.; Kalai, Y. T.; Paneth, O.; and Sahai, A.\n\n\n \n\n\n\n In EUROCRYPT, volume 8441, of Lecture Notes in Computer Science, pages 221-238, 2014. Springer\n \n\n\n\n
\n\n\n\n \n \n $\"Protecting$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakGKPS14,\n  author    = {Boaz Barak and\n               Sanjam Garg and\n               Yael Tauman Kalai and\n               Omer Paneth and\n               Amit Sahai},\n  title     = {Protecting Obfuscation against Algebraic Attacks},\n  booktitle = {EUROCRYPT},\n  publisher = {Springer},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {8441},\n  year      = {2014},\n  pages     = {221-238},\n  url_paper = {http://eprint.iacr.org/2013/631},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Structure vs. Combinatorics in Computational Complexity.\n \n \n \n \n\n\n \n Barak, B.\n\n\n \n\n\n\n Bulletin of the European Association for Theoretical Computer Science, 112. 2014.\n Survey, also posted on Windows on Theory blog. \n\n\n\n
\n\n\n\n \n \n $\"Structure$ paper\n \n \n \n $\"Structure$ blog\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 9 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{Barak14,\n  AUTHOR =       {Boaz Barak},\n  TITLE =        {Structure vs. Combinatorics in Computational Complexity},\n  year      = {2014},\n  journal = {Bulletin of the European Association for Theoretical Computer Science},\n  volume = {112},\n  note = {Survey, also posted on Windows on Theory blog. },\n   url_paper = {http://eccc.hpi-web.de/report/2013/182/},\n   url_blog = {http://windowsontheory.org/2013/10/07/structure-vs-combinatorics-in-computational-complexity/}\n}\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2013\n \n \n (3)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n Toward a Secure Inspection System for Nuclear Warhead Veri\fcation Without Information Barrier.\n \n \n \n\n\n \n Glaser, A.; Barak, B.; and Goldston, R. J.\n\n\n \n\n\n\n 2013.\n Presented at 54th Annual INMM (Institute of Nuclear Materials Management) meeting\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@unpublished{GlaserBG13,\n  AUTHOR =       {Alexander Glaser and Boaz Barak and Robert J. Goldston},\n  TITLE =        {Toward a Secure Inspection System for Nuclear Warhead Veri\fcation Without Information Barrier},\n  note = {Presented at 54th Annual INMM (Institute of Nuclear Materials Management) meeting},\n  year      = {2013},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013.\n \n \n \n \n\n\n \n Barak, B.; Kindler, G.; and Steurer, D.\n\n\n \n\n\n\n In Kleinberg, R. D., editor(s), ITCS, pages 197-214, 2013. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Innovations$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakKS13,\n  author    = {Boaz Barak and\n               Guy Kindler and\n               David Steurer},\n  title     = {On the optimality of semidefinite relaxations for average-case\n               and generalized constraint satisfaction},\n  booktitle = {ITCS},\n  year      = {2013},\n  pages     = {197-214},\n  editor    = {Robert D. Kleinberg},\n  title     = {Innovations in Theoretical Computer Science, ITCS '13, Berkeley,\n               CA, USA, January 9-12, 2013},\n  booktitle = {ITCS},\n  publisher = {ACM},\n  year      = {2013},\n  isbn      = {978-1-4503-1859-4},\n   url_paper = {https://www.boazbarak.org/Papers/sdpopt.pdf},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n How to Compress Interactive Communication.\n \n \n \n \n\n\n \n Barak, B.; Braverman, M.; Chen, X.; and Rao, A.\n\n\n \n\n\n\n SIAM J. Comput., 42(3): 1327-1363. 2013.\n Preliminary version in STOC 2010\n\n\n\n
\n\n\n\n \n \n $\"How$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{BarakBCR13,\n  author    = {Boaz Barak and\n               Mark Braverman and\n               Xi Chen and\n               Anup Rao},\n  title     = {How to Compress Interactive Communication},\n  journal   = {SIAM J. Comput.},\n  volume    = {42},\n  number    = {3},\n  year      = {2013},\n  pages     = {1327-1363},\n    url_paper = {https://www.boazbarak.org/Papers/directsum.pdf},\n  note = {Preliminary version in STOC 2010},\n  selected = {yes},\n }\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2012\n \n \n (7)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Truth vs. Proof in Computational Complexity.\n \n \n \n \n\n\n \n Barak, B.\n\n\n \n\n\n\n Bulletin of the European Association for Theoretical Computer Science, (108). October 2012.\n Appeared in Logic in Computer Science column. Also posted in Windows on theory blog\n\n\n\n
\n\n\n\n \n \n $\"Truth$ paper\n \n \n \n $\"Truth$ blog\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@ARTICLE{Barak12,\n  AUTHOR =       {Boaz Barak},\n  TITLE =        {Truth vs. Proof in Computational Complexity},\n  JOURNAL =      {Bulletin of the European Association for Theoretical Computer Science},\n  YEAR =         {2012},\n  number =       {108},\n  month =        {October},\n  note =         {Appeared in Logic in Computer Science column. Also posted in Windows on theory blog},\n   url_paper = {https://www.boazbarak.org/Papers/truth-proof.pdf},\n   url_blog = {http://windowsontheory.org/2012/07/31/truth-vs-proof-the-unique-games-conjecture-and-feiges-hypothesis/},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A New Approach to Nuclear Warhead Verification Using a Zero-Knowledge Protocol.\n \n \n \n \n\n\n \n Glaser, A.; Barak, B.; and Goldston, R. J.\n\n\n \n\n\n\n 2012.\n Presented at 53rd Annual INMM (Institute of Nuclear Materials Management) meeting\n\n\n\n
\n\n\n\n \n \n $\"A$ paper\n \n \n \n $\"A$ powerpoint\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@unpublished{GlaserBG12,\n  AUTHOR =       {Alexander Glaser and Boaz Barak and Robert J. Goldston},\n  TITLE =        {A New Approach to Nuclear Warhead Verification Using a Zero-Knowledge Protocol},\n  note = {Presented at 53rd Annual INMM (Institute of Nuclear Materials Management) meeting},\n  year      = {2012},\n   url_paper = {https://www.boazbarak.org/Papers/nuclear-zk.pdf},\n   url_powerpoint = {https://www.boazbarak.org/Papers/nuclear-zk.ppsx},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Fractional Sylvester–Gallai theorems.\n \n \n \n \n\n\n \n Barak, B.; Dvir, Z.; Wigderson, A.; and Yehudayoff, A.\n\n\n \n\n\n\n Proceedings of the National Academy of Sciences. 2012.\n Journal version of STOC '11 paper ``Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes''\n\n\n\n
\n\n\n\n \n \n $\"Fractional$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{BarakDWY12,\n  title={Fractional Sylvester--Gallai theorems},\n  author={Barak, Boaz and Dvir, Zeev and Wigderson, Avi and Yehudayoff, Amir},\n  journal={Proceedings of the National Academy of Sciences},\n  year={2012},\n  publisher={National Acad Sciences},\n  note = {Journal version of STOC '11 paper ``Rank Bounds for Design Matrices  with Applications  to\nCombinatorial Geometry and Locally Correctable Codes''},\n   url_paper = {http://www.cs.princeton.edu/~zdvir/papers/BDWYpnas.pdf},\n   selected = {yes},\n}\n\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Making the long code shorter.\n \n \n \n \n\n\n \n Barak, B.; Gopalan, P.; Håstad, J.; Meka, R.; and Raghavendra, P.\n\n\n \n\n\n\n In FOCS, 2012. \n \n\n\n\n
\n\n\n\n \n \n $\"Making$ eccc\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakGHMRS12,\n  AUTHOR =       {Boaz Barak and Parikshit Gopalan and Johan H{\\aa}stad and Raghu Meka and Prasad Raghavendra},\n  TITLE =        {Making the Long Code Shorter},\n  title     = {Making the long code shorter},\n  booktitle = {FOCS},\n  year      = {2012},\n   url_eccc = {http://eccc.hpi-web.de/report/2011/142},\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Hypercontractivity, sum-of-squares proofs, and their applications.\n \n \n \n \n\n\n \n Barak, B.; Brandão, F. G. S. L.; Harrow, A. W.; Kelner, J. A.; Steurer, D.; and Zhou, Y.\n\n\n \n\n\n\n In STOC, pages 307-326, 2012. \n \n\n\n\n
\n\n\n\n \n \n $\"Hypercontractivity,$ arxiv\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakBHKSZ12,\n  author    = {Boaz Barak and\n               Fernando G. S. L. Brand{\\~a}o and\n               Aram Wettroth Harrow and\n               Jonathan A. Kelner and\n               David Steurer and\n               Yuan Zhou},\n  title     = {Hypercontractivity, sum-of-squares proofs, and their applications},\n  booktitle = {STOC},\n  year      = {2012},\n  pages     = {307-326},\n   url_arxiv = {http://arxiv.org/pdf/1205.4484v1},\n}\n\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n 2-source dispersers for $n^{o(1)}$ entropy, and Ramsey graphs beating the Frankl-Wilson construction.\n \n \n \n \n\n\n \n Barak, B.; Rao, A.; Shaltiel, R.; and Wigderson, A.\n\n\n \n\n\n\n Annals of Mathematics, 176(3): 1483–1543. 2012.\n Preliminary version in STOC '06\n\n\n\n
\n\n\n\n \n \n $\"2-source$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{BarakRSW12,\n  title={2-source dispersers for $n^{o(1)}$ entropy, and Ramsey graphs beating the Frankl-Wilson construction},\n  author={Barak, Boaz and Rao, Anup and Shaltiel, Ronen and Wigderson, Avi},\n  journal={Annals of Mathematics},\n  volume={176},\n  number={3},\n  pages={1483--1543},\n  year={2012},\n  publisher={ANNAL MATHEMATICS FINE HALL, WASHINGTON RD, PRINCETON, NJ 08544 USA},\n  note = {Preliminary version in STOC '06},\n   url_paper =  {https://www.boazbarak.org/Papers/disperser.pdf},\n   selected = {yes},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n On the (im)possibility of obfuscating programs.\n \n \n \n \n\n\n \n Barak, B.; Goldreich, O.; Impagliazzo, R.; Rudich, S.; Sahai, A.; Vadhan, S. P.; and Yang, K.\n\n\n \n\n\n\n J. ACM, 59(2): 6. 2012.\n Preliminary version in CRYPTO 2001\n\n\n\n
\n\n\n\n \n \n $\"On$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 21 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/jacm/BarakGIRSVY12,\n  author    = {Boaz Barak and\n               Oded Goldreich and\n               Russell Impagliazzo and\n               Steven Rudich and\n               Amit Sahai and\n               Salil P. Vadhan and\n               Ke Yang},\n  title     = {On the (im)possibility of obfuscating programs},\n  journal   = {J. ACM},\n  volume    = {59},\n  number    = {2},\n  year      = {2012},\n  pages     = {6},\n  note =      {Preliminary version in CRYPTO 2001},\n    url_paper = {https://www.boazbarak.org/Papers/obfuscate.pdf},\n  selected = {yes},\n}\n\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2011\n \n \n (4)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Rounding Semidefinite Programming Hierarchies via Global Correlation.\n \n \n \n \n\n\n \n Barak, B.; Raghavendra, P.; and Steurer, D.\n\n\n \n\n\n\n In FOCS, pages 472-481, 2011. \n \n\n\n\n
\n\n\n\n \n \n $\"Rounding$ Link\n \n \n \n $\"Rounding$ arxiv\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakRS11,\n  author    = {Boaz Barak and\n               Prasad Raghavendra and\n               David Steurer},\n  title     = {Rounding Semidefinite Programming Hierarchies via Global\n               Correlation},\n  booktitle = {FOCS},\n  year      = {2011},\n  pages     = {472-481},\n  ee        = {http://dx.doi.org/10.1109/FOCS.2011.95},\n   url_arxiv = {http://arxiv.org/pdf/1104.4680},\n  bibsource = {DBLP, http://dblp.uni-trier.de}\n}\n\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Leftover Hash Lemma, Revisited.\n \n \n \n \n\n\n \n Barak, B.; Dodis, Y.; Krawczyk, H.; Pereira, O.; Pietrzak, K.; Standaert, F.; and Yu, Y.\n\n\n \n\n\n\n In CRYPTO, 2011. \n According to the New Yorker, this was one of the more obscure titles in the CRYPTO '11 conference, see highlighted text in 4th page linked below\n\n\n\n
\n\n\n\n \n \n $\"Leftover$ paper\n \n \n \n $\"Leftover$ new yorker\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakDKPPSY11,\n    author = {Boaz Barak and Yevgeniy Dodis and Hugo Krawczyk and Olivier Pereira and Krzysztof Pietrzak and Francois-Xavier Standaert and Yu Yu},\n    title = {Leftover Hash Lemma, Revisited},\n    booktitle = {CRYPTO},\n    year = {2011},\n     url_paper = {http://eprint.iacr.org/2011/088.pdf},\n    note = {According to the New Yorker, this was one of the more obscure titles in the CRYPTO '11 conference, see highlighted text in 4th page linked below},\n    url_New_Yorker = {http://www.cs.nyu.edu/~dodis/ps/lhl-newyorker-oct-2011.pdf},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Computational complexity and information asymmetry in financial products.\n \n \n \n \n\n\n \n Arora, S.; Barak, B.; Brunnermeier, M.; and Ge, R.\n\n\n \n\n\n\n Commun. ACM, 54(5): 101-107. 2011.\n \n\n\n\n
\n\n\n\n \n \n $\"Computational$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 9 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{AroraBaBrGe11,\n  author    = {Sanjeev Arora and\n               Boaz Barak and\n               Markus Brunnermeier and\n               Rong Ge},\n  title     = {Computational complexity and information asymmetry in financial\n               products},\n  journal   = {Commun. ACM},\n  volume    = {54},\n  number    = {5},\n  year      = {2011},\n  pages     = {101-107},\n   url_paper =       {http://cacm.acm.org/magazines/2011/5/107705-computational-complexity-and-information-asymmetry-in-financial-products/fulltext},\n   selected = {yes},\n}\n\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Subsampling Mathematical Programs and Average-Case Complexity.\n \n \n \n \n\n\n \n Barak, B.; Hardt, M.; Holenstein, T.; and Steurer, D.\n\n\n \n\n\n\n In SODA, 2011. \n \n\n\n\n
\n\n\n\n \n \n $\"Subsampling$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@Inproceedings{BarakHaHoSt11,\n author = "Boaz Barak and Moritz Hardt and Thomas Holenstein and David Steurer",\n title  =  "Subsampling Mathematical Programs and Average-Case Complexity",\n year = "2011",\n booktitle = "SODA",\n  url_paper = {https://www.boazbarak.org/Papers/propsdp.pdf},\n }\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2010\n \n \n (4)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Subexponential Algorithms for Unique Games and Related problems.\n \n \n \n \n\n\n \n Arora, S.; Barak, B.; and Steurer, D.\n\n\n \n\n\n\n In Proc. of FOCS, pages 563–572, 2010. \n \n\n\n\n
\n\n\n\n \n \n $\"Subexponential$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@INProceedings{AroraBaSt10,\n author = "Sanjeev Arora and Boaz Barak and David Steurer",\n title  =  "Subexponential Algorithms for Unique Games and Related problems",\n booktitle = {Proc. of FOCS},\n year = "2010",\n pages = {563--572},\n  url_paper = {https://www.boazbarak.org/Papers/ssesubexp.pdf},\n  selected = {yes},\n }\n\n\n\n\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Public Key Cryptography from Different Assumptions.\n \n \n \n \n\n\n \n Applebaum, B.; Barak, B.; and Wigderson, A.\n\n\n \n\n\n\n In Proc. of STOC, 2010. \n Preliminary version as cryptology eprint report 2008/335 by Barak and Wigderson\n\n\n\n
\n\n\n\n \n \n $\"Public$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@INProceedings{ApplebaumBaWi10,\n    AUTHOR = {Benny Applebaum  and Boaz Barak and Avi Wigderson},\n    TITLE =  {Public Key Cryptography from Different Assumptions},\n    YEAR  =  {2010},\n    booktitle = {Proc. of STOC},\n     url_paper =    {https://www.boazbarak.org/Papers/ncpkcFull2.pdf},\n    note =   {Preliminary version as cryptology eprint report 2008/335 by Barak and Wigderson}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Bounded Key-Dependent Message Security.\n \n \n \n \n\n\n \n Barak, B.; Haitner, I.; Hofheinz, D.; and Ishai, Y.\n\n\n \n\n\n\n In EUROCRYPT, 2010. \n \n\n\n\n
\n\n\n\n \n \n $\"Bounded$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@InProceedings{BarakHaHoIs10,\n author = "Boaz Barak and Iftach Haitner and Dennis Hofheinz and Yuval Ishai",\n title  =  "Bounded Key-Dependent Message Security",\n year = "2010",\n booktitle = "EUROCRYPT",\n  url_paper = {   url_paper = {http://eprint.iacr.org/2009/511.pdf}},\n }\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Computational Complexity and Information Asymmetry in Financial Products.\n \n \n \n \n\n\n \n Arora, S.; Barak, B.; Brunnermeier, M.; and Ge, R.\n\n\n \n\n\n\n In Innovations in Computer Science (ICS) conference, 2010. \n \n\n\n\n
\n\n\n\n \n \n $\"Computational$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@InProceedings{AroraBaBrGe10,\n author = "Sanjeev Arora and Boaz Barak and Markus Brunnermeier and Rong Ge",\n title  =  "Computational Complexity and Information Asymmetry in Financial Products",\n year = "2010",\n  url_paper = {https://www.boazbarak.org/Papers/derivative.pdf},\n booktitle = "Innovations in Computer Science (ICS) conference",\n }\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2009\n \n \n (3)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Strong Parallel Repetition Theorem for Free Projection Games.\n \n \n \n \n\n\n \n Barak, B.; Rao, A.; Raz, R.; Rosen, R.; and Shaltiel, R.\n\n\n \n\n\n\n In Proceedings RANDOM 2009, pages 365, 2009. Springer\n \n\n\n\n
\n\n\n\n \n \n $\"Strong$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@InProceedings{BarakRaRaRoSh09,\n  title={Strong Parallel Repetition Theorem for Free Projection Games},\n  author={Boaz Barak and Anup Rao and Ran Raz and Ricky Rosen and Ronen Shaltiel},\n  booktitle={Proceedings RANDOM 2009},\n  pages={365},\n  year={2009},\n  organization={Springer},\n    url_paper = {https://www.boazbarak.org/Papers/freegames1.pdf},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n The Uniform Hardcore Lemma via Approximate Bregman Projections.\n \n \n \n \n\n\n \n Barak, B.; Hardt, M.; and Kale, S.\n\n\n \n\n\n\n In Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), 2009. \n \n\n\n\n
\n\n\n\n \n \n $\"The$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@InProceedings{BarakHaKa09,\n author = "Boaz Barak and Moritz Hardt and Satyen Kale",\n title  =  "The Uniform Hardcore Lemma via Approximate Bregman Projections",\n booktitle = "Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA)",\n year = "2009",\n  url_paper = {https://www.boazbarak.org/Papers/hardcore.pdf},\n }\n\n\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Merkle Puzzles are Optimal — an $O(n^2)$ attack on key exchange from a random oracle.\n \n \n \n \n\n\n \n Barak, B.; and Mahmoody-Ghidary, M.\n\n\n \n\n\n\n In Proceedings of CRYPTO '09, 2009. \n \n\n\n\n
\n\n\n\n \n \n $\"Merkle$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@INProceedings{BarakGh09,\n  AUTHOR =       {Boaz Barak and Mohammad Mahmoody-Ghidary},\n  TITLE =        {Merkle Puzzles are Optimal --- an $O(n^2)$ attack on key exchange from a random oracle},\n  year =         {2009},\n    BOOKTITLE =      {Proceedings of CRYPTO '09},\n         url_paper =  {https://www.boazbarak.org/Papers/merkle.pdf},\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2008\n \n \n (5)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Rounding Parallel Repetitions of Unique Games.\n \n \n \n \n\n\n \n Barak, B.; Hardt, M.; Haviv, I.; Rao, A.; Regev, O.; and Steurer, D.\n\n\n \n\n\n\n In Proceedings of 49th FOCS, 2008. \n \n\n\n\n
\n\n\n\n \n \n $\"Rounding$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@INProceedings{BarakHaHaRaReSt08,\n  AUTHOR =       {Boaz Barak and Moriz Hardt and Ishay Haviv and Anup Rao and Oded Regev and David Steurer},\n  TITLE =        {Rounding Parallel Repetitions of Unique Games},\n  BOOKTITLE =      {Proceedings of 49th FOCS},\n  YEAR =         {2008},\n       url_paper =    {https://www.boazbarak.org/Papers/roundpar.pdf},\n}\n\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n On Basing Lower-Bounds for Learning on Worst-Case Assumptions.\n \n \n \n \n\n\n \n Applebaum, B.; Barak, B.; and Xiao, D.\n\n\n \n\n\n\n In Proceedings of 49th FOCS, 2008. \n \n\n\n\n
\n\n\n\n \n \n $\"On$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@INProceedings{ApplebaumBaXi08,\n  AUTHOR = {Benny Applebaum and Boaz Barak and David Xiao},\n  TITLE = {On Basing Lower-Bounds for Learning on Worst-Case Assumptions},\n  BOOKTITLE =      {Proceedings of 49th FOCS},\n  YEAR =         {2008},\n         url_paper =    {https://www.boazbarak.org/Papers/ABX08full.pdf},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Protocols and Lower Bounds for Failure Localization in the Internet.\n \n \n \n \n\n\n \n Barak, B.; Goldberg, S.; and Xiao, D.\n\n\n \n\n\n\n In Proceedings of Eurocrypt 2008, 2008. \n \n\n\n\n
\n\n\n\n \n \n $\"Protocols$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@INProceedings{BarakGoXi08,\n  AUTHOR =       {Boaz Barak and Sharon Goldberg and David Xiao},\n  TITLE =        {Protocols and Lower Bounds for Failure Localization in the Internet},\n  BOOKTITLE =    {Proceedings of Eurocrypt 2008},\n  YEAR =         {2008},\n       url_paper =  {https://www.boazbarak.org/Papers/eurofl.pdf},\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Path-Quality Monitoring in the Presence of Adversaries.\n \n \n \n \n\n\n \n Goldberg, S.; Xiao, D.; Tromer, E.; Barak, B.; and Rexford, J.\n\n\n \n\n\n\n In Proceedings of SIGMETRICS 2008, 2008. \n \n\n\n\n
\n\n\n\n \n \n $\"Path-Quality$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@InProceedings{GoldbergXiTrBaRe08,\n title = "Path-Quality Monitoring in the Presence of Adversaries",\n author = "Sharon Goldberg and David Xiao and Eran Tromer and Boaz Barak and Jennifer Rexford",\n  booktitle = "Proceedings of SIGMETRICS 2008",\n  year = "2008",\n         url_paper =  {https://www.boazbarak.org/Papers/sigfd.pdf},\n  }\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Universal Arguments and their Applications.\n \n \n \n \n\n\n \n Barak, B.; and Goldreich, O.\n\n\n \n\n\n\n SIAM Journal on Computing, 38(5): 1661-1694. 2008.\n Preliminary version in CCC' 02\n\n\n\n
\n\n\n\n \n \n $\"Universal$ powerpoint\n \n \n \n $\"Universal$ ps\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{BarakGo02,\nauthor = {Boaz Barak and Oded Goldreich},\ncollaboration = {},\ntitle = {Universal Arguments and their Applications},\npublisher = {SIAM},\nyear = {2008},\njournal = {SIAM Journal on Computing},\nvolume = {38},\nnumber = {5},\npages = {1661-1694},\n url_powerpoint = {https://www.boazbarak.org/Papers/uargs.pps},\nnote  = {Preliminary version in CCC' 02},\n    url_ps = {https://www.boazbarak.org/Papers/uargs.ps},\nprelimYear = {2002},\n}\n\n\n\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2007\n \n \n (2)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Lower bounds on signatures from symmetric primitives.\n \n \n \n \n\n\n \n Barak, B.; and Mahmoody-Ghidary, M.\n\n\n \n\n\n\n In Proceedings of FOCS '07, 2007. \n \n\n\n\n
\n\n\n\n \n \n $\"Lower$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@InProceedings{BarakGh07,\n    title  = "Lower bounds on signatures from symmetric primitives",\n    author = "Boaz Barak and Mohammad Mahmoody-Ghidary",\n    booktitle = {Proceedings of FOCS '07},\n    year = "2007",\n         url_paper =  {https://www.boazbarak.org/Papers/siglb.pdf},\n    }\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Privacy, accuracy, and consistency too: a holistic solution to contingency table release.\n \n \n \n \n\n\n \n Barak, B.; Chaudhuri, K.; Dwork, C.; Kale, S.; McSherry, F.; and Talwar, K.\n\n\n \n\n\n\n In Libkin, L., editor(s), Proceedings of ACM PODS, pages 273–282, 2007. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Privacy,$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@InProceedings{BarakChDwKaMcTa07,\n  title =\t"Privacy, accuracy, and consistency too: a holistic\n\t\t solution to contingency table release",\n  author =\t"Boaz Barak and Kamalika Chaudhuri and Cynthia Dwork\n\t\t and Satyen Kale and Frank McSherry and Kunal Talwar",\n  booktitle =\t"Proceedings of ACM PODS",\n  publisher =\t"ACM",\n  year = \t"2007",\n  editor =\t"Leonid Libkin",\n  ISBN = \t"978-1-59593-685-1",\n  pages =\t"273--282",\n   url_paper =  {https://www.boazbarak.org/Papers/privacy.pdf},\n}\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2006\n \n \n (3)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Concurrent Non-Malleable Zero Knowledge.\n \n \n \n \n\n\n \n Barak, B.; Prabhakaran, M.; and Sahai, A.\n\n\n \n\n\n\n In Proceedings of FOCS '06, 2006. \n \n\n\n\n
\n\n\n\n \n \n $\"Concurrent$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@InProceedings{BarakPeSa06,\nauthor = "Boaz Barak and Manoj Prabhakaran and Amit Sahai",\ntitle = "Concurrent Non-Malleable Zero Knowledge",\nbooktitle = {Proceedings of FOCS '06},\nyear = "2006",\n   url_paper =  {https://www.boazbarak.org/Papers/cnmzk.pdf},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Extracting Randomness Using Few Independent Sources.\n \n \n \n \n\n\n \n Barak, B.; Impagliazzo, R.; and Wigderson, A.\n\n\n \n\n\n\n SIAM Journal on Computing, 36(4): 1095-1118. 2006.\n Preliminary version in FOCS' 04\n\n\n\n
\n\n\n\n \n \n $\"Extracting$ paper\n \n \n \n $\"Extracting$ powerpoint\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{BarakImWi04,\nauthor = {Boaz Barak and Russell Impagliazzo and Avi Wigderson},\ncollaboration = {},\ntitle = {Extracting Randomness Using Few Independent Sources},\npublisher = {SIAM},\nyear = {2006},\njournal = {SIAM Journal on Computing},\nvolume = {36},\nnumber = {4},\npages = {1095-1118},\n ps = {https://www.boazbarak.org/Papers/msamples.ps},\n  url_paper = {https://www.boazbarak.org/Papers/msamples.pdf},\n  url_powerpoint = {https://www.boazbarak.org/Papers/msamples.pps},\n prelimYear = "2004",\n note = "Preliminary version in FOCS' 04",\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Lower bounds for non-black-box zero knowledge.\n \n \n \n \n\n\n \n Barak, B.; Lindell, Y.; and Vadhan, S.\n\n\n \n\n\n\n J. Comput. Syst. Sci, 72(2): 321–391. 2006.\n Preliminary version in FOCS' 03\n\n\n\n
\n\n\n\n \n \n $\"Lower$ paper\n \n \n \n $\"Lower$ powerpoint\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@Article{BarakLiVa06,\n  title =   "Lower bounds for non-black-box zero knowledge",\n  author =  "Boaz Barak and Yehuda Lindell and Salil Vadhan",\n  journal = "J. Comput. Syst. Sci",\n  year =    "2006",\n  number =  "2",\n  volume =  "72",\n  bibdate = "2006-07-25",\n  bibsource =   "DBLP,\n         http://dblp.uni-trier.de/db/journals/jcss/jcss72.html#BarakLV06",\n  pages =   "321--391",\n  note = {Preliminary version in FOCS' 03},\n  ps = {https://www.boazbarak.org/Papers/zklower.ps},\n   url_paper = {https://www.boazbarak.org/Papers/zklower.pdf},\n   url_powerpoint = {https://www.boazbarak.org/Papers/zklower.pps},\n  prelimYear = {2003},\n}\n\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2005\n \n \n (4)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n An architecture for robust pseudo-random generation and Applications to /dev/random.\n \n \n \n \n\n\n \n Barak, B.; and Halevi, S.\n\n\n \n\n\n\n In ACM, editor(s), Proc. Computing and Communication Security (CCS), 2005. \n \n\n\n\n
\n\n\n\n \n \n $\"An$ ps\n \n \n \n $\"An$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@InProceedings{BarakHa05,\n author = "Boaz Barak and Shai Halevi",\n title = "An architecture for robust pseudo-random generation\n           and Applications to /dev/random",\n           year= "2005",\n           booktitle = "Proc. Computing and Communication Security (CCS)",\n           editor = "ACM",\n           url_ps =  {https://www.boazbarak.org/Papers/devrand.ps},\n            url_paper =  {https://www.boazbarak.org/Papers/devrand.pdf},\n           }\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n How to Play Almost Any Mental Game Over the Net - Concurrent Composition Using Super-Polynomial Simulation.\n \n \n \n \n\n\n \n Barak, B.; and Sahai, A.\n\n\n \n\n\n\n In Proceedings of FOCS '05, 2005. \n \n\n\n\n
\n\n\n\n \n \n $\"How$ ps\n \n \n \n $\"How$ paper\n \n \n \n $\"How$ powerpoint\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@InProceedings{BarakSa05,\n  author =       "Boaz Barak and Amit Sahai",\n  title =        "How to Play Almost Any Mental Game Over the Net -\n  Concurrent Composition Using Super-Polynomial Simulation",\n  year =         "2005",\n  booktitle = {Proceedings of FOCS '05},\n     url_ps =  {https://www.boazbarak.org/Papers/conc-comp.ps},\n     url_paper =  {https://www.boazbarak.org/Papers/conc-comp.pdf},\n     url_powerpoint =  {https://www.boazbarak.org/Papers/conc-comp.pps},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Secure Computation Without Authentication.\n \n \n \n \n\n\n \n Barak, B.; Canetti, R.; Lindell, Y.; Pass, R.; and Rabin, T.\n\n\n \n\n\n\n In Proceedings of CRYPTO '05, 2005. \n \n\n\n\n
\n\n\n\n \n \n $\"Secure$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@InProceedings{BarakCaLiPaRa05,\n  author =       {Boaz Barak and Ran Canetti and Yehuda Lindell and Rafael Pass and Tal Rabin},\n  title =        {Secure Computation Without Authentication},\n  booktitle = {Proceedings of CRYPTO '05},\n  year = {2005},\n   url_paper =  {http://dx.doi.org/10.1007/11535218_22},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors.\n \n \n \n \n\n\n \n Barak, B.; Kindler, G.; Shaltiel, R.; Sudakov, B.; and Wigderson, A.\n\n\n \n\n\n\n In Proceedings of STOC '05, 2005. \n \n\n\n\n
\n\n\n\n \n \n $\"Simulating$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@InProceedings{BarakKiShSuWi05,\nauthor = {Boaz Barak and Guy Kindler and Ronen Shaltiel and Benjamin Sudakov and Avi Wigderson},\ntitle = {Simulating Independence: New Constructions of Condensers, Ramsey\n   Graphs, Dispersers, and Extractors},\n   year = {2005},\n booktitle = {Proceedings of STOC '05},\n   ps =  {https://www.boazbarak.org/Papers/BKSSW.ps},\n       url_paper =  {https://www.boazbarak.org/Papers/BKSSW.pdf},\n}\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2004\n \n \n (4)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n Non-Black-Box Techniques in Cryptography.\n \n \n \n\n\n \n Barak, B.\n\n\n \n\n\n\n Ph.D. Thesis, Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel, 2004.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@PHDTHESIS{Barak04thesis,\n  author =       {Boaz Barak},\n  title =        {Non-Black-Box Techniques in Cryptography},\n  school =       {Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel},\n  year =         {2004},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Universally Composable Protocols with Relaxed Set-Up Assumptions.\n \n \n \n \n\n\n \n Barak, B.; Canetti, R.; Nielsen, J. B.; and Pass, R.\n\n\n \n\n\n\n In Proceedings of FOCS '04, pages 186–195, 2004. \n \n\n\n\n
\n\n\n\n \n \n $\"Universally$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@InProceedings{BarakCaNiPa04,\n  author =       "Boaz Barak and Ran Canetti and Jesper Buus Nielsen and Rafael Pass",\n  title =        "Universally Composable Protocols with Relaxed Set-Up\n                 Assumptions",\n  year =         "2004",\n  pages = "186--195",\n  booktitle = {Proceedings of FOCS '04},\n  ps =  {https://www.boazbarak.org/Papers/ucpki.ps},\n     url_paper =  {https://www.boazbarak.org/Papers/ucpki.pdf},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n On the Possibility of One-Message Weak Zero-Knowledge.\n \n \n \n \n\n\n \n Barak, B.; and Pass, R.\n\n\n \n\n\n\n In First Theory of Cryptography Conference (TCC), 2004. \n \n\n\n\n
\n\n\n\n \n \n $\"On$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakPa04,\n    author = {Boaz Barak and Rafael Pass},\n    title = {On the Possibility of One-Message Weak Zero-Knowledge},\n    booktitle = {First Theory of Cryptography Conference (TCC)},\n    year = {2004},\n    ps = {https://www.boazbarak.org/Papers/uniformNIZK.ps},\n     url_paper = {https://www.boazbarak.org/Papers/uniformNIZK.pdf},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Strict Polynomial-Time in Simulation and Extraction.\n \n \n \n \n\n\n \n Barak, B.; and Lindell, Y.\n\n\n \n\n\n\n SIAM Journal on Computing, 33(4): 783–818. August 2004.\n Extended abstract appeared in STOC 2002\n\n\n\n
\n\n\n\n \n \n $\"Strict$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@Article{BarakLi02,\n  author =       "Boaz Barak and Yehuda Lindell",\n  title =        "Strict Polynomial-Time in Simulation and Extraction",\n  journal =      "SIAM Journal on Computing",\n  volume =       "33",\n  number =       "4",\n  pages =        "783--818",\n  month =        aug,\n  year =         "2004",\n  CODEN =        "SMJCAT",\n  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",\n  bibdate =      "Sat Apr 16 10:19:24 MDT 2005",\n   acknowledgement = ack-nhfb,\n  prelimYear = {2002},\n  note = {Extended abstract appeared in STOC 2002},\n    ps = {https://www.boazbarak.org/Papers/zkpok.ps},\n     url_paper = {https://www.boazbarak.org/Papers/zkpok.pdf},\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2003\n \n \n (3)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n True Random Number Generators Secure in a Changing Environment.\n \n \n \n \n\n\n \n Barak, B.; Shaltiel, R.; and Tromer, E.\n\n\n \n\n\n\n In Workshop on Cryptographic Hardware and Embedded Systems (CHES), of LNCS, pages 166–180, 2003. \n \n\n\n\n
\n\n\n\n \n \n $\"True$ paper\n \n \n \n $\"True$ powerpoint\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@INPROCEEDINGS{BarakShTr03,\n  AUTHOR =       {Boaz Barak and Ronen Shaltiel and Eran Tromer},\n  TITLE =        {True Random Number Generators Secure in a Changing Environment},\n  BOOKTITLE =    {Workshop on Cryptographic Hardware and Embedded Systems (CHES)},\n  YEAR =         {2003},\n  number =       {2779},\n  series =       {LNCS},\n  pages =        {166--180},\n  ps = {https://www.boazbarak.org/Papers/trng.ps},\n   url_paper = {https://www.boazbarak.org/Papers/trng.pdf},\n   url_powerpoint = {https://www.boazbarak.org/Papers/trng.pps},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Computational analogues of entropy.\n \n \n \n \n\n\n \n Barak, B.; Shaltiel, R.; and Wigderson, A.\n\n\n \n\n\n\n In Proc. of $7$th Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), 2003. \n See erratum note in abstract.\n\n\n\n
\n\n\n\n \n \n $\"Computational$ paper\n \n \n \n $\"Computational$ powerpoint\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakShWi03,\n author = {Boaz Barak and Ronen Shaltiel and Avi Wigderson},\n title = {Computational analogues of entropy},\n booktitle ={Proc. of $7$th Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM)},\n year ={2003},\n note = {See erratum note in abstract.},\n  url_paper = {https://www.boazbarak.org/Papers/compent.pdf},\n  url_powerpoint = {https://www.boazbarak.org/Papers/compent.pps},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Derandomization in Cryptography.\n \n \n \n \n\n\n \n Barak, B.; Ong, S. J.; and Vadhan, S.\n\n\n \n\n\n\n In Proceedings of CRYPTO '03, 2003. \n \n\n\n\n
\n\n\n\n \n \n $\"Derandomization$ paper\n \n \n \n $\"Derandomization$ powerpoint\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@INPROCEEDINGS{BarakOnVa03,\n  author =       "Barak, Boaz and Ong, Shien Jin and Vadhan, Salil",\n  title =        "Derandomization in Cryptography",\n  year =         "2003",\n  booktitle = {Proceedings of CRYPTO '03},\n  ps = {https://www.boazbarak.org/Papers/derand-crypto.ps},\n   url_paper = {https://www.boazbarak.org/Papers/derand-crypto.pdf},\n   url_powerpoint = {https://www.boazbarak.org/Papers/derand-crypto.pps},\n}\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2002\n \n \n (2)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n A Probabilistic-Time Hierarchy Theorem for ``Slightly Non-Uniform'' Algorithms.\n \n \n \n \n\n\n \n Barak, B.\n\n\n \n\n\n\n In Proc. of $6$th Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), 2002. \n \n\n\n\n
\n\n\n\n \n \n $\"A$ ps\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@INPROCEEDINGS{Barak02bpp,\n  AUTHOR =       {Boaz Barak},\n  TITLE =        {A Probabilistic-Time Hierarchy Theorem for ``Slightly Non-Uniform'' Algorithms},\n  BOOKTITLE =    {Proc. of $6$th Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM)},\n  YEAR =         {2002},\n  url_ps = {https://www.boazbarak.org/Papers/bptime.ps},\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Constant-Round Coin-Tossing With a Man in the Middle or Realizing the Shared Random String Model.\n \n \n \n \n\n\n \n Barak, B.\n\n\n \n\n\n\n In Proceedings of FOCS '02, 2002. \n See also my thesis.\n\n\n\n
\n\n\n\n \n \n $\"Constant-Round$ paper\n \n \n \n $\"Constant-Round$ powerpoint\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{Barak02,\n  AUTHOR =       "Boaz Barak",\n  TITLE =        "Constant-Round Coin-Tossing With a Man in the Middle or  Realizing the Shared Random String Model",\n  YEAR =         "2002",\n  booktitle = {Proceedings of FOCS '02},\n  note = {See also my thesis.},\n   url_paper = {https://www.boazbarak.org/Papers/nmc.pdf},\n   url_powerpoint = {https://www.boazbarak.org/Papers/nmc.pps},\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2001\n \n \n (3)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Delegateable Signatures.\n \n \n \n \n\n\n \n Barak, B.\n\n\n \n\n\n\n Technical Report 2001.\n \n\n\n\n
\n\n\n\n \n \n $\"Delegateable$ ps\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@TECHREPORT{Barak01delg,\n  AUTHOR =       {Boaz Barak},\n  TITLE =        {Delegateable Signatures},\n  YEAR =         {2001},\n  url_ps =  {https://www.boazbarak.org/Papers/delgsigs.ps},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Resettably-Sound Zero-Knowledge and its Applications.\n \n \n \n \n\n\n \n Barak, B.; Goldreich, O.; Goldwasser, S.; and Lindell, Y.\n\n\n \n\n\n\n In Proceedings of FOCS '01, pages 116–125, 2001. \n \n\n\n\n
\n\n\n\n \n \n $\"Resettably-Sound$ ps\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakGoGoLi01,\n  author =       "Boaz Barak and Oded Goldreich and Shafi Goldwasser and\n                 Yehuda Lindell",\n  title =        "Resettably-Sound Zero-Knowledge and its Applications",\n    pages =        "116--125",\n  booktitle = {Proceedings of FOCS '01},\n  year = {2001},\n  url_ps = {https://www.boazbarak.org/Papers/rszk.ps},\n}\n\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n How to go beyond the black-box simulation barrier.\n \n \n \n \n\n\n \n Barak, B.\n\n\n \n\n\n\n In Proceedings of FOCS '01, pages 106–115, 2001. \n Winner, FOCS 2021 Test of Time Award\n\n\n\n
\n\n\n\n \n \n $\"How$ paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 18 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@InProceedings{Barak01,\n  author =       "Boaz Barak",\n  title =        "How to go beyond the black-box simulation barrier",\n  year =         "2001",\n  pages =        "106--115",\n  booktitle = {Proceedings of FOCS '01},\n  year = {2001},\n    note = {Winner, FOCS 2021 Test of Time Award},\n   url_paper = {https://www.boazbarak.org/Papers/nonbb.pdf},\n   selected = {yes},\n}\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2000\n \n \n (1)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Clock Synchronization with Faults and Recoveries.\n \n \n \n \n\n\n \n Barak, B.; Halevi, S.; Herzberg, A.; and Naor, D.\n\n\n \n\n\n\n In Proc. of 19$th$ ACM Principles of Distributed Computing (PODC), 2000. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Clock$ ps\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakHaHeNa00,\nauthor="Boaz Barak and Shai Halevi and Amir Herzberg and Dalit Naor",\ntitle = "Clock Synchronization with Faults and Recoveries",\nbooktitle={Proc. of 19$th$ ACM Principles of Distributed Computing (PODC)},\npublisher = {ACM},\nyear = {2000},\nurl_ps = {https://www.boazbarak.org/Papers/clockSyn-proc.ps},\n}\n\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 1999\n \n \n (1)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n The Proactive Security Toolkit and Applications.\n \n \n \n \n\n\n \n Barak, B.; Herzberg, A.; Naor, D.; and Shai, E.\n\n\n \n\n\n\n In Proc. of 6$^{th}$ ACM Conference on Computer and Communications Security (CCS), 1999. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"The$ ps\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{BarakHeNaSh99,\nauthor="Boaz Barak and Amir Herzberg and  Dalit Naor and Eldad Shai",\ntitle = "The Proactive Security Toolkit and Applications",\nbooktitle="Proc. of 6$^{th}$ ACM Conference on Computer and Communications\nSecurity (CCS)",\npublisher ={ACM},\nyear = {1999},\nurl_ps = {https://www.boazbarak.org/Papers/proactivePaper-proc.ps},\n}\n\n\n% END OF BIBITEMS\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% CROSSREFS\n

\n\n\n\n

\n\n\n\n\n\n

\n\n\n\n\n

\n\n\n \n\n \n \n \n \n\n