Related Research Articles
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.
Johan Torkel Håstad is a Swedish theoretical computer scientist most known for his work on computational complexity theory. He was the recipient of the Gödel Prize in 1994 and 2011 and the ACM Doctoral Dissertation Award in 1986,among other prizes. He has been a professor in theoretical computer science at KTH Royal Institute of Technology in Stockholm,Sweden since 1988,becoming a full professor in 1992. He is a member of the Royal Swedish Academy of Sciences since 2001.
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 out-sourced to commercial cloud environments for processing,all while encrypted.
Avi Wigderson is an Israeli mathematician and computer scientist. He is the Herbert H. Maass Professor in the school of mathematics at the Institute for Advanced Study in Princeton,New Jersey,United States of America. His research interests include complexity theory,parallel algorithms,graph theory,cryptography,distributed computing,and neural networks. Wigderson received the Abel Prize in 2021 for his work in theoretical computer science.
Dan Boneh is an Israeli–American professor in applied cryptography and computer security at Stanford University.
Moni Naor is an Israeli computer scientist,currently a professor at the Weizmann Institute of Science. Naor received his Ph.D. in 1989 at the University of California,Berkeley. His advisor was Manuel Blum.
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.
Matthew Keith "Matt" Franklin is an American cryptographer,and a professor of computer science at the University of California,Davis.
Amit Sahai is an Indian-American computer scientist. He is a professor of computer science at UCLA and the director of the Center for Encrypted Functionalities.
Shai Halevi is a computer scientist who works on cryptography research at Amazon Web Services.
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.
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.
PALISADE is an open-source cross platform software library that provides implementations of lattice cryptography building blocks and homomorphic encryption schemes.
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. 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.
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.
References
- ↑ Craig Gentry at the Mathematics Genealogy Project
- 1 2 3 MacArthur Foundation (17 September 2014). "Craig Gentry". MacArthur Foundation. Retrieved 12 March 2015.
- ↑ Craig Gentry. Fully Homomorphic Encryption Using Ideal Lattices. In the 41st ACM Symposium on Theory of Computing (STOC), 2009.
- ↑ Greenberg, Andy (3 November 2014), "Hacker Lexicon: What is Homomorphic Encryption?", Wired, retrieved 26 October 2015
- ↑ Hayden, Erika (23 March 2015), "Extreme cryptography paves way to personalized medicine", Nature, vol. 519, no. 7544, pp. 400–1, Bibcode:2015Natur.519..400C, doi: 10.1038/519400a , PMID 25810184 , retrieved 26 October 2015
- ↑ "Putnam Competition Individual and Team Winners". Mathematical Association of America . Retrieved December 14, 2021.
- ↑ Gold, Virginia (16 June 2010). "Doctoral Candidate Developed Scheme that Could Spur Advances in Cloud Computing, Search Engine Queries, and E-Commerce" (Press release). New York. The Association for Computing Machinery. Archived from the original on 9 January 2016. Retrieved 2015-10-26.
- ↑ "Craig Gentry" . Retrieved 26 October 2015.
- ↑ "2022 Gödel Prize Citation". ACM Special Interest Group on Algorithms and Computation Theory. Association for Computing Machinery.
| Authority control databases: Academics |
|---|
