Eitan Kushilevitz

Eitan Kushilevitz is an Israeli computer scientist noted for foundational contributions to communication complexity, cryptography, and data structures. His work spans theoretical computer science topics associated with Andrew Yao, Shafi Goldwasser, Silvio Micali, Oded Goldreich, and institutions such as the Weizmann Institute of Science, Massachusetts Institute of Technology, and Tel Aviv University. He has influenced areas connected to private information retrieval, secure multi-party computation, and bounds in randomized communication, interacting with research by scholars at Harvard University, Princeton University, Stanford University, and University of California, Berkeley.

Early life and education

Kushilevitz was born in Haifa, Israel, and attended the Technion – Israel Institute of Technology for undergraduate studies, where he encountered faculty associated with Michael Rabin and Adi Shamir. He moved to the United States for graduate studies at Massachusetts Institute of Technology under the supervision of Andrew Yao, engaging with research communities connected to MIT Computer Science and Artificial Intelligence Laboratory, Harvard University, and visiting scholars from Bell Labs and IBM Research. During this period he interacted academically with figures from Rutgers University, University of Illinois Urbana–Champaign, Columbia University, and Tel Aviv University through conferences such as STOC, FOCS, ICALP, and SODA.

Academic and research career

Kushilevitz held faculty positions and visiting appointments across leading research centers, including Weizmann Institute of Science, Massachusetts Institute of Technology, and Tel Aviv University, and collaborated with researchers at Microsoft Research, IBM Research, Google Research, and Yahoo! Research. His collaborations involved scholars from Princeton University, Stanford University, Carnegie Mellon University, University of Toronto, and University of Washington, producing work presented at COLT, NeurIPS, ICALP, and CCC. He supervised students and postdocs who later joined departments at Cornell University, Hebrew University of Jerusalem, Technion, and University of California, San Diego. He participated in program committees for STOC, FOCS, PODS, and editorial boards connected to journals such as the Journal of the ACM, SIAM Journal on Computing, and IEEE Transactions on Information Theory.

Contributions to cryptography and communication complexity

Kushilevitz made seminal contributions to communication complexity models, randomized protocols, and lower bounds, building on and influencing work by Andrew Yao, Noga Alon, Madan Lal, Noam Nisan, Amnon Ta-Shma, and Eyal Kushilevitz (note: different). He co-developed techniques for private information retrieval related to the Goldreich–Micali–Wigderson framework and secure computation methods linked to Yao's garbled circuits and Shamir's secret sharing. His research advanced bounds for two-party and multi-party communication, influencing results by Ran Raz, Eyal Kushilevitz (avoid duplicate), Alexander Razborov, Moses Charikar, and Nisan–Wigderson style pseudorandomness. He contributed to protocol constructions and impossibility results that intersect with zero-knowledge proofs, homomorphic encryption, oblivious transfer, and concepts studied at Crypto, Eurocrypt, and Asiacrypt. His work on private information retrieval connected to systems and theory teams at Google, Microsoft Research Redmond, and Facebook AI Research exploring data privacy and retrieval efficiency.

Awards and honors

Kushilevitz received recognition from academic societies and conference committees, earning invitations to give plenary talks at STOC, FOCS, ICALP, and Crypto. He has been associated with fellowships and visiting appointments linked to Simons Foundation, Alfred P. Sloan Foundation, National Science Foundation workshops, and visiting scholar programs at Institute for Advanced Study and Microsoft Research New England. His papers have won best paper distinctions at venues such as ICALP and received citations in award-winning work by researchers from MIT, Princeton University, Harvard University, and Stanford University.

Selected publications and work

Selected influential publications and topics include private information retrieval protocols and complexity lower bounds published in proceedings of STOC, FOCS, and ICALP; investigations of randomized communication complexity and direct-sum/direct-product theorems appearing in Journal of the ACM and SIAM Journal on Computing; and collaborative work on secure multi-party computation and sublinear algorithms presented at Crypto, Eurocrypt, and PODS. Collaborators on these works include Noam Nisan, Moni Naor, Oded Goldreich, Michael Ben-Or, Shafi Goldwasser, Silvio Micali, Ran Raz, Noga Alon, and Moses Charikar.

Category:Israeli computer scientists Category:Theoretical computer scientists Category:Cryptographers