Boaz Barak is a Professor at the Weizmann Institute of Science in the Department of Computer Science, Faculty of Mathematics and Computer Science. With an h-index of 64 and over 17,301 citations, he is a leading researcher in theoretical computer science with significant contributions spanning computational complexity, cryptography, and machine learning theory. His research interests include: Computational Complexity Cryptography Zero-Knowledge Proofs Program Obfuscation Interactive Proofs Privacy-Preserving Computation Machine Learning Theory Barak's publication record reveals a trajectory from foundational work in theoretical computer science to contemporary research at the intersection of theory and practice. His early work established impossibility results for program obfuscation and advanced techniques for zero-knowledge proofs beyond black-box simulation. His influential textbook "Computational Complexity: A Modern Approach" has become a standard reference in the field. More recently, his research has expanded into machine learning phenomena like double descent and scaling laws for language models, demonstrating the evolving nature of his theoretical contributions. His work consistently bridges deep theoretical insights with practical implications for computing. His notable collaborations include extensive work with Sanjeev Arora (77 publications, 6,879 citations), David Steurer (95 publications, 4,945 citations), and Oded Goldreich, among others. Professor Barak leads a research group at the Weizmann Institute focused on theoretical aspects of computer security and complexity theory. His work has been consistently supported by major research funding, enabling significant contributions to the theoretical foundations of computer science. He maintains an active research program with publications spanning over two decades, demonstrating sustained impact in multiple subfields of theoretical computer science.