Yehuda Lindell

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Yehuda Lindell
YehudaLindell.jpg
Born 24th Feb 1971
Australia
Residence Israel
Fields Cryptography
Institutions Bar Ilan University
Alma mater BSc Bar-Ilan University, 1997
MSc Bar-Ilan University, 1998
Ph.D. Weizmann Institute of Science, 2002
Doctoral advisor Oded Goldreich and Moni Naor
Known for Secure multi-party computation

Yehuda Lindell is a professor in the Department of Computer Science at Bar-Ilan University where he conducts research on cryptography with a focus on the theory of secure computation and its application in practice.

Education and Academic Positions[edit]

Lindell received a BSc and Msc degree in computer science from Bar-Ilan University. He then obtained a PhD in computer science from the Weizmann Institute of Science in 2002. After a two year spell with the IBM's cryptography research group at T.J. Watson, Lindell returned in 2004 to Israel to take up an academic position at Bar-Ilan University. Since that time he has also been working as a cryptographic consultant to Safenet, formally Aladdin. Lindell's work on secure computation was recognized in 2009 by the award of a prestigious ERC starting grant.

Research[edit]

Lindell's has worked on various aspects of secure computation, with his main contributions focusing on the examination of the Yao garbled circuit construction. His most cited work is a joint paper with Benny Pinkas on privacy preserving data mining[1] in which the use of secure computation was proposed for performing data mining algorithms; in particular the ID3 algorithm. More recent work has focused on the design of two-party protocols which are secure against active adversaries,[2] the first proof of security for the basic Yao protocol,[3] and the introduction of the concept of covert adversarial models.[4]

Lindell is also the author of a textbook with Katz on modern cryptography. This textbook is utilized in many universities around the world as a standard reference work.

Books[edit]

References[edit]

  1. ^ Privacy preserving data mining. Y Lindell, B Pinkas. Advances in Cryptology — CRYPTO 2000, 36-54
  2. ^ An efficient protocol for secure two-party computation in the presence of malicious adversaries. Y Lindell, B Pinkas. Advances in Cryptology — EUROCRYPT 2007, 52-78
  3. ^ A proof of security of Yao’s protocol for two-party computation. Y Lindell, B Pinkas. Journal of Cryptology, 22(2), 161-188
  4. ^ Security against covert adversaries: Efficient protocols for realistic adversaries. Y Aumann, Y Lindell. Journal of Cryptology, 23(2), 281-343

External links[edit]