Eyal Kushilevitz

Eyal Kushilevitz
Name	Eyal Kushilevitz
Nationality	Israeli
Fields	Computer science, Cryptography, Algorithms, Complexity theory
Alma mater	Hebrew University of Jerusalem, Massachusetts Institute of Technology
Doctoral advisor	Goldreich, Oded
Known for	Communication complexity, Secure computation, Randomized algorithms

Eyal Kushilevitz is an Israeli computer scientist known for foundational work in theoretical computer science, particularly in communication complexity, cryptography, and randomized algorithms. His research bridges mathematical aspects of Complexity theory and practical implications for Cryptography, influencing fields such as Secure multi-party computation, Streaming algorithms, and Property testing. He has held faculty positions at leading institutions and collaborated with prominent researchers across Israel and the United States.

Early life and education

Kushilevitz completed undergraduate studies in computer science at the Hebrew University of Jerusalem and pursued graduate training at the Massachusetts Institute of Technology under the supervision of Oded Goldreich. During formative years he engaged with the vibrant Israeli theoretical community around the Weizmann Institute of Science, the Technion – Israel Institute of Technology, and seminars linked to Tel Aviv University. His doctoral work drew on interactions with scholars associated with Institute for Advanced Study, Princeton University, and the University of California, Berkeley, situating him within networks that included researchers from Stanford University, Harvard University, and Carnegie Mellon University.

Research and contributions

Kushilevitz's contributions center on several interconnected veins in theoretical computer science. In Communication complexity, he developed techniques that connect the study of two-party protocols with questions in Circuit complexity and Decision tree complexity, influencing subsequent work by researchers at MIT, Rutgers University, and Microsoft Research. His papers on randomized communication protocols interfaced with concepts from Yao's Millionaires' problem and results related to Karchmer–Wigderson frameworks, with implications for researchers at UC San Diego and Columbia University.

In Cryptography, Kushilevitz contributed to foundational aspects of Secure multi-party computation, Private information retrieval, and protocols resilient to adaptive adversaries. These efforts related to work by scholars at Weizmann Institute, Tel Aviv University, Bell Labs, and IBM Research. His approaches combined combinatorial constructions with reductions connected to One-way functions and primitives studied at ETH Zurich and École Polytechnique Fédérale de Lausanne.

Kushilevitz also advanced understanding of Randomized algorithms and their role in sublinear-time computation, exploring links to Property testing and Streaming algorithms. This intersected with research programs at Princeton University, Cornell University, University of Washington, and collaborations that touched on topics pursued at Google Research and Amazon labs. His work produced tools used in analyses of Data structures and Communication networks in contexts investigated by teams at California Institute of Technology and Imperial College London.

He further influenced theoretical methodology through introductions of combinatorial bounds, interactive proofs connections to Zero-knowledge proofs, and adaptations of information-theoretic techniques employed by groups at University of Cambridge, University of Oxford, and New York University.

Academic career and positions

Kushilevitz has held faculty appointments at leading universities, teaching courses and supervising students who later joined institutions such as Tel Aviv University, Hebrew University of Jerusalem, University of Chicago, and University of Michigan. He spent research sabbaticals and visiting positions at centers including the Institute for Advanced Study, Microsoft Research laboratories, and the Simons Institute for the Theory of Computing. His roles connected him with program committees and editorial boards for conferences and journals associated with ACM, IEEE, SIAM, and workshops at FOCS, STOC, CRYPTO, and ICALP.

Beyond academia, Kushilevitz engaged with industry collaborations and consultancy projects with teams at Google Research, Microsoft Research, and startups focusing on cryptographic applications and algorithmic services, facilitating technology transfer between theoretical innovations and practical deployments.

Awards and honors

Kushilevitz received recognition for influential papers and mentorship, including best paper nominations at flagship conferences such as STOC and FOCS, and awards from organizations like the Israeli Ministry of Science and foundations supporting research in Computer science. His students and collaborators have won fellowships and prizes associated with ACM Fellowship and national awards in Israel. He delivered invited talks and plenary lectures at venues including the International Colloquium on Automata, Languages and Programming and the European Association for Theoretical Computer Science meetings.

Selected publications and works

- Kushilevitz authored and co-authored seminal papers on communication complexity that shaped modern treatments of randomized protocols and direct-sum questions; these works are cited alongside foundational contributions by Andrew Yao, Nisan, and Saks. - He published influential articles on private information retrieval and secure computation connecting to research by Oded Goldreich, Silvio Micali, and Shafi Goldwasser. - Collaborative works addressed streaming and sublinear algorithms in contexts related to studies by Piotr Indyk, Moses Charikar, and Sanjeev Arora. - He contributed chapters and survey articles in collections edited by organizers of STOC and FOCS, and co-authored pieces in journals alongside researchers from Princeton University and Stanford University.

Category:Israeli computer scientists Category:Theoretical computer scientists