Craig Gentry (b. /73) is an American computer scientist. He is best known for his work in cryptography, specifically fully homomorphic encryption. In Fully Homomorphic Encryption Using Ideal Lattices. Craig Gentry. Stanford University and IBM Watson [email protected] ABSTRACT. List of computer science publications by Craig Gentry. (Leveled) fully homomorphic encryption without bootstrapping. ITCS [c43]. view.
|Published (Last):||15 February 2012|
|PDF File Size:||6.96 Mb|
|ePub File Size:||6.42 Mb|
|Price:||Free* [*Free Regsitration Required]|
Craig GentryShai Halevi: Field switching in BGV-style homomorphic encryption. IBM Search for people. Fully Homomorphic Encryption over the Integers.
Trapdoors for hard lattices and new cryptographic constructions. Outsourcing Computation to Untrusted Workers.
Public Key Cryptography 2 Password authenticated key exchange using hidden smooth subgroups. Homomorphic Encryption from Learning with Errors: LewkoBrent Gentdy Adaptive Security in Broadcast Encryption Systems. Craig GentryBrent Waters: Fully Homomorphic Encryption with Polylog Overhead.
Craig GentryPhilip D. Obfuscation using Tensor Products. Structure and randomness in encrypted computation. IEEE Symposium on Security and Privacy for the “Pinocchio” workEurocrypt for the cryptographic multilinear maps workCrypto for work in lattice-based cryptographyand FOCS for an identity-based encryption scheme. JutlaMariana Raykova: How to Compress Reusable Garbled Circuits. Privacy Enhancing Technologies This led to the construction of the first cryptographic program obfuscation schemes with Shai, Sanjam, Mariana Raykova, Amit Sahai, and Brent Watersa major breakthrough that had been thought to be impossible.
Computing arbitrary functions of encrypted data.
Craig Gentry’s PhD Thesis
MacKenzieZulfikar Ramzan: Security Protocols Workshop Functional Encryption Homomorpihc Obfuscation. JutlaMariana RaykovaDaniel Wichs: Craig GentryDaniel Wichs: Unlike FHE, yentry multilinear maps and cryptographic program obfuscation are currently too slow to be feasibly implemented and their in security is not well-understood; this remains an active area of theoretical research.
Noncommutative Determinant is Hard: The LLL Algorithm Cryptanalyzing multilinear maps without encodings of zero. Craig GentryZulfikar Ramzan: Journal of Computer Security 21 5: Encryptiion Multilinear Maps from Lattices. InCraig with Shai and Sanjam Garg, then a postdoc at IBM also constructed the first cryptographic multilinear map scheme, a cryptographic tool that is in some ways even more powerful than FHE.
Candidate Multilinear Maps from Ideal Lattices. Structure and Randomness in Encrypted Computation. He also has a law degree from Harvard Law School.
Craig Gentry (computer scientist)
The NSA cited enceyption as a reason to begin transitioning to lattice-based cryptosystems, or to other “post-quantum” cryptosystems. Craig GentryAllison B.
GoldmanShai HaleviCharanjit S. Fully homomorphic encryption using ideal lattices. Leveled fully homomorphic encryption without bootstrapping. Encrypted Messages from the Heights of Cryptomania.
Craig B. Gentry – IBM
Wireless Personal Communications 29 Computing on the Edge of Chaos: Leveled Fully Homomorphic Homomorphjc without Bootstrapping. He obtained his Ph. Obfuscation Using Tensor Products. Fully Homomorphic Encryption without Bootstrapping.
Separating succinct non-interactive arguments from all falsifiable assumptions. Craig GentryCharanjit S.
Cryptanalyses of Candidate Branching Program Obfuscators. The Geometry of Provable Security: Computing on Encrypted Data. Zeroizing Without Low-Level Zeroes: Nearly Practical Verifiable Computation.