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):||27 July 2006|
|PDF File Size:||12.70 Mb|
|ePub File Size:||15.92 Mb|
|Price:||Free* [*Free Regsitration Required]|
Fully Homomorphic Encryption with Polylog Overhead.
Secure Distributed Human Computation. The LLL Algorithm MacKenzieZulfikar Ramzan: Trapdoors for hard lattices and new cryptographic constructions.
Craig Gentry’s PhD Thesis
Better Bootstrapping in Fully Homomorphic Encryption. End-to-end security in the presence of intelligent data adapting proxies: Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits.
EjcryptionAmit SahaiBrent Waters: JutlaMariana RaykovaDaniel Wichs: LewkoBrent Waters: Unlike FHE, cryptographic 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.
Secure distributed human computation. How to Compress Reusable Garbled Circuits. JutlaEncrption Raykova: Homomorphic Encryption from Learning with Errors: FHE allows data processing to be outsourced e.
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. Cryptanalyses of Candidate Branching Program Obfuscators. Witness hpmomorphic and its applications. Leveled fully homomorphic encryption without bootstrapping. Attacking cryptographic schemes based on “perturbation polynomials”.
Encrypted Messages from the Heights of Cryptomania. Fully Secure Functional Encryption without Obfuscation. Craig GentryShai Halevi: InCraig constructed the first fully homomorphic encryption FHE scheme, which allows data to be processed in arbitrarily complex ways while it remains encrypted, solving a major open problem that had been unsolved for 30 years.
Computing arbitrary functions of encrypted data. Computing on the Edge of Chaos: Graph-Induced Multilinear Maps from Lattices.
Craig B. Gentry – IBM
Candidate Multilinear Maps from Ideal Lattices. GoldmanShai HaleviCharanjit S. Public Key Cryptography IBM Search for people. 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.
Outsourcing Computation to Untrusted Workers. Noncommutative Determinant is Hard: Craig GentryPhilip D. Password authenticated key exchange using hidden smooth subgroups. He also has a law degree from Harvard Law School. Obfuscation using Tensor Products.
Fully Homomorphic Encryption without Bootstrapping. Obfuscation Using Tensor Products. Leveled Fully Homomorphic Encryption without Bootstrapping. Structure and Randomness in Encrypted Computation.
Craig Gentry (computer scientist) – Wikipedia
Gentdy Discrete Gaussians Efficiently and Obliviously. 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.
Functional Encryption Without Obfuscation. Unlike commonly-used cryptosystems like RSA and elliptic-curve cryptography, lattice-based cryptosystems cannot feasibly as far as we know be broken by quantum computers. Craig GentryAllison B.
Craig Gentry (computer scientist)
Craig GentryKenny A. Cryptanalyzing multilinear maps without encodings of zero. Wireless Personal Communications 29