Prof. Yehuda Lindell is an Associate Professor in the Computer Science Department at Bar-Ilan University. Lindell came to Bar-Ilan after completing a postdoctoral fellowship at the IBM T.J. Watson Research Center where he was a Raviv fellow.
His Ph.D. studies were carried out and completed at the Weizmann Institute of Science. Lindell is one of three faculty members in the cryptography and security research group.
Lindell and his group’s main research interests are in the field of cryptography, with a focus on secure protocols.
Their research concentrates both on questions of feasibility and efficiency. The former question asks what cryptographic tasks can be realized and under what assumptions, and is related to the theoretical foundations of cryptography. The focus of the latter question is the construction of efficient cryptographic schemes and protocols that have rigorous proofs of security and correctness.
This research includes the development of new models and definitions for secure computation that enables the construction of highly efficient protocols. A primary aim of the lab’s research in this area is to demonstrate that secure computation has potential for real-world use, and that many real-world problems can already be solved today.
In many cases, there is still a long way to go in order to obtain protocols that are efficient enough to be used in practice. In these cases, Lindell and his team are interested in the algorithmic process of finding more and more efficient protocols.
The erosion of privacy in today’s society is now a given. Furthermore, it is clear that a legal approach to this problem will not suffice; one reason for this is the inability of the legal community to keep up with such rapidly changing technology.
Lindell and his team argue that the solution to this problem must combine legal and technological solutions. Secure cryptographic protocols can form the cornerstone of technological solutions in this realm. Such protocols enable parties to utilize their data in online computations, without revealing anything but the final result.
Thus, for example, it is possible for parties to search the Internet and sensitive databases without revealing their search query, to authenticate themselves without revealing their exact identity, and to complete online surveys while guaranteeing cryptographically that their personal data is not revealed to anyone and in particular to the party carrying out the survey.
In this area, Lindell and his group are designing and implementing privacy-preserving protocols with the aim of demonstrating that this new technology can be made practical.
In future research, Lindell and his team aim to continue their current projects of simultaneously carrying out in-depth research on the theoretical aspects of cryptography and cryptographic protocols, while also studying the algorithmic angle of constructing more and more efficient protocols.
His long term vision is to harness the rich and beautiful theory of secure cryptographic protocols for practical use.