Vinod Vaikuntanathan | |
---|---|
Occupation | Professor |
Known for | homomorphic encryption |
Awards | Gödel Prize |
Academic background | |
Thesis | Randomized algorithms for reliable broadcast (2009) |
Doctoral advisor | Shafi Goldwasser |
Academic work | |
Discipline | cryptography |
Institutions | MIT,CSAIL |
Website | people |
Vinod Vaikuntanathan is a professor of computer science at the Massachusetts Institute of Technology and a principal investigator at the MIT Computer Science and Artificial Intelligence Laboratory. [1] His work is focused on cryptography,including homomorphic encryption. He is the co-recipient of the 2022 Gödel Prize,together with Zvika Brakerski and Craig Gentry. [2] [3] He also co-founded the data start-up Duality,which utilizes technologies he developed revolving around homomorphic encryption. [4]
Vaikuntanathan received his bachelor's degree in computer science from the Indian Institute of Technology Madras in 2003 and his Ph.D in computer science in 2009 from Massachusetts Institute of Technology under the supervision of Shafi Goldwasser. From 2008 to 2010,he was a Josef Raviv postdoctoral fellow at the IBM T.J. Watson Research Center,and from 2010 to 2011,a researcher at Microsoft Research. From Fall 2011 to Spring 2013,he was a professor at the University of Toronto. In Fall 2013,he joined the faculty at MIT.
Ronald Linn Rivest is a cryptographer and computer scientist whose work has spanned the fields of algorithms and combinatorics,cryptography,machine learning,and election integrity. He is an Institute Professor at the Massachusetts Institute of Technology (MIT),and a member of MIT's Department of Electrical Engineering and Computer Science and its Computer Science and Artificial Intelligence Laboratory.
Peter Williston Shor is an American professor of applied mathematics at MIT. He is known for his work on quantum computation,in particular for devising Shor's algorithm,a quantum algorithm for factoring exponentially faster than the best currently-known algorithm running on a classical computer.
The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science,given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory. The award is named in honor of Kurt Gödel. Gödel's connection to theoretical computer science is that he was the first to mention the "P versus NP" question,in a 1956 letter to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.
Shafrira Goldwasser is an Israeli-American computer scientist and winner of the Turing Award in 2012. She is the RSA Professor of Electrical Engineering and Computer Science at Massachusetts Institute of Technology;a professor of mathematical sciences at the Weizmann Institute of Science,Israel;the director of the Simons Institute for the Theory of Computing at the University of California,Berkeley;and co-founder and chief scientist of Duality Technologies.
Silvio Micali is an Italian computer scientist,professor at the Massachusetts Institute of Technology and the founder of Algorand,a proof-of-stake blockchain cryptocurrency protocol. Micali's research at the MIT Computer Science and Artificial Intelligence Laboratory centers on cryptography and information security.
Homomorphic encryption is a form of encryption that allows computations to be performed on encrypted data without first having to decrypt it. The resulting computations are left in an encrypted form which,when decrypted,result in an output that is identical to that produced had the operations been performed on the unencrypted data. Homomorphic encryption can be used for privacy-preserving outsourced storage and computation. This allows data to be encrypted and outsourced to commercial cloud environments for processing,all while encrypted.
Dan Boneh is an Israeli–American professor in applied cryptography and computer security at Stanford University.
Lattice-based cryptography is the generic term for constructions of cryptographic primitives that involve lattices,either in the construction itself or in the security proof. Lattice-based constructions support important standards of post-quantum cryptography. Unlike more widely used and known public-key schemes such as the RSA,Diffie-Hellman or elliptic-curve cryptosystems —which could,theoretically,be defeated using Shor's algorithm on a quantum computer —some lattice-based constructions appear to be resistant to attack by both classical and quantum computers. Furthermore,many lattice-based constructions are considered to be secure under the assumption that certain well-studied computational lattice problems cannot be solved efficiently.
Nir Shavit is an Israeli computer scientist. He is a professor in the Computer Science Department at Tel Aviv University and a professor of electrical engineering and computer science at the Massachusetts Institute of Technology.
Noam Nisan is an Israeli computer scientist,a professor of computer science at the Hebrew University of Jerusalem. He is known for his research in computational complexity theory and algorithmic game theory.
Tal Rabin is a computer scientist and Professor of Computer and Information Science at the University of Pennsylvania and a Director at Amazon Web Services (AWS). She was previously the head of research at the Algorand Foundation and the head of the cryptography research group at IBM's Thomas J. Watson Research Center.
Shai Halevi is a computer scientist who works on cryptography research at Amazon Web Services.
Craig Gentry is an American computer scientist working as CTO of TripleBlind. He is best known for his work in cryptography,specifically fully homomorphic encryption.
Yael Tauman Kalai is a cryptographer and theoretical computer scientist who works as a Senior Principal Researcher at Microsoft Research New England and as an adjunct professor at MIT in the Computer Science and Artificial Intelligence Lab.
Oded Regev is an Israeli-American theoretical computer scientist and mathematician. He is a professor of computer science at the Courant institute at New York University. He is best known for his work in lattice-based cryptography,and in particular for introducing the learning with errors problem.
Homomorphic Encryption library or HElib is a free and open-source cross platform software developed by IBM that implements various forms of homomorphic encryption.
OpenFHE is an open-source cross platform software library that provides implementations of fully homomorphic encryption schemes. OpenFHE is a successor of PALISADE and incorporates selected design features of HElib,HEAAN,and FHEW libraries.
Xi Chen is a computer scientist. He is a professor of computer science at Columbia University. Chen won the 2021 Gödel Prize and Fulkerson Prize for his co-authored paper "Complexity of Counting CSP with Complex Weights" with Jin-Yi Cai.
PALISADE is an open-source cross platform software library that provides implementations of lattice cryptography building blocks and homomorphic encryption schemes.
Zvika Brakerski is an Israeli mathematician,known for his work on homomorphic encryption,particularly in developing the foundations of the second generation FHE schema,for which he was awarded the 2022 Gödel Prize. Brakerski is an associate professor in the Department of Computer Science and Applied Mathematics at the Weizmann Institute of Science.
This article needs additional or more specific categories .(December 2022) |