Boaz Barak
Born1974
NationalityAmerican, Israeli
Occupationprofessor of computer science
Known forprofessor of computer science at Harvard University
Academic background
EducationB.Sc. in mathematics and computer science. Ph.D.
Alma materWeizmann Institute of Science
ThesisNon-Black-Box Techniques in Cryptography

Boaz Barak (בועז ברק, born 1974) is an Israeli-American professor of computer science at Harvard University.[1]

Early life and education

He graduated in 1999 with a B.Sc. in mathematics and computer science from Tel Aviv University.[2] In 2004, he received his Ph.D. from the Weizmann Institute of Science with thesis Non-Black-Box Techniques in Cryptography under the supervision of Oded Goldreich.[3] Barak was at the Institute for Advanced Study for two years from 2003 to 2005. He was an assistant professor in the computer science department of Princeton University from 2005 to 2010 and an associate professor from 2010 to 2011. From 2010 to 2016, he was a researcher at Microsoft's New England research laboratory. Since 2016, he is the Gordon McKay Professor of Computer Science in the Harvard John A. Paulson School of Engineering and Applied Sciences. He is a citizen of both Israel and the United States.[2]

Career

He co-authored, with Sanjeev Arora, Computational Complexity: A Modern Approach, published by Cambridge University Press in 2009.[4] Barak also wrote extensive notes with David Steurer on the sum of squares algorithm and occasionally blogs on the Windows on Theory blog.[2] In 2013, he, Robert J. Goldston, and Alexander Glaser worked to design a "zero-knowledge" system to verify that warheads designated for disarmament are actually what they purport to be. By directing high-energy neutrons into the warhead under investigation, and comparing the distribution passing through to the distribution that passed through a known warhead, inspectors can determine whether a warhead being disarmed is genuine or a ruse designed to evade treaty requirements, without leaking nuclear secrets.[5] For this work, he was selected for Foreign Policy's Top 100 Global Thinkers issue for 2014.[6]

In 2014 Barak was an invited speaker at the International Congress of Mathematics at Seoul. With Mark Braverman, Xi Chen, and Anup Rao, he won the 2016 SIAM Outstanding Paper Prize for the paper “How to Compress Interactive Communication”.[2][7] He was named to the 2022 class of ACM Fellows, "for contributions to theoretical computer science, in particular cryptography and computational complexity, and service to the theory community".[8]

Patents

  • U.S. Patent 7,003,677, “Method for operating proactively secured applications on an insecure system” with Amir Herzberg, Dalit Naor and Eldad Shai of IBM Haifa Research Lab. Filed November 1999, granted February 2006.

References

  1. ↑ "Boaz Barak, homepage". boazbarak.
  2. 1 2 3 4 "Boaz Barak — Curriculum Vitae" (PDF).
  3. ↑ Boaz Barak at the Mathematics Genealogy Project
  4. ↑ Arora, Sanjeev; Barak, Boaz (20 April 2009). Computational Complexity: A Modern Approach. Cambridge University Press. ISBN 978-0-521-42426-4.
  5. ↑ Mohan 2014.
  6. ↑ Foreign Policy 2014.
  7. ↑ Barak, Boaz; Braverman, Mark; Chen, Xi; Rao, Anup (2013). "How to Compress Interactive Communication". SIAM Journal on Computing. 42 (3): 1327–1363. doi:10.1137/100811969. ISSN 0097-5397. S2CID 29873040.
  8. ↑ "Global computing association names 57 fellows for outstanding contributions that propel technology today". Association for Computing Machinery. January 18, 2023. Retrieved 2023-01-18.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.