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):||21 May 2018|
|PDF File Size:||14.44 Mb|
|ePub File Size:||10.7 Mb|
|Price:||Free* [*Free Regsitration Required]|
Obfuscation using Tensor Products. Trapdoors for hard lattices and new cryptographic constructions. Functional Encryption Without Obfuscation.
Craig Gentry (computer scientist)
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.
The LLL Algorithm Craig GentryCharanjit S. Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing. Craig GentryDaniel Wichs: Cryptanalyses of Candidate Branching Program Obfuscators.
Craig B. Gentry – IBM
Craig GentryBrent Waters: Noncommutative Determinant is Hard: Fully Homomorphic Encryption without Bootstrapping. Computing on the Edge of Chaos: InCraig constructed crsig first fully homomorphic encryption FHE scheme, which allows data to be processed in arbitrarily homomoephic ways while it remains encrypted, solving a major open problem that had been unsolved for 30 years.
Candidate Multilinear Maps from Ideal Lattices. Much of Craig’s recent work, including FHE and cryptographic multilinear maps, generally falls into the area of “lattice-based cryptography”.
Nearly Practical Verifiable Computation.
craiv IEEE Symposium on Security and Privacy for the gwntry workEurocrypt for the cryptographic multilinear maps workCrypto for work in lattice-based cryptographyand FOCS for an identity-based encryption scheme. Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits.
Sampling Discrete Gaussians Efficiently and Obliviously. Public Key Cryptography 2 Homomorphic Encryption from Learning with Errors: Journal of Computer Security 21 5: MacKenzieZulfikar Ramzan: The Geometry of Provable Security: FHE allows data processing to be outsourced e.
LewkoAmit SahaiBrent Waters: Computing on Encrypted Data. Craig GentryShai Halevi: Witness Encryption and its Applications.
Outsourcing Computation to Untrusted Workers. Fully homomorphic encryption using ideal lattices. He also has a law degree from Harvard Law School.
GoldmanShai HaleviCharanjit S. Graph-Induced Multilinear Maps from Lattices. MajiAmit Sahai: Public Key Cryptography The NSA cited this as a reason to begin transitioning to lattice-based encryptiion, or to other “post-quantum” cryptosystems.
Craig Gentry’s PhD Thesis
Better Bootstrapping in Fully Homomorphic Encryption. Encrypted Messages from the Heights of Cryptomania. Privacy Enhancing Technologies 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. Zeroizing Without Low-Level Zeroes: Obfuscation Using Tensor Products.
Craig GentryZulfikar Ramzan: How to Compress Reusable Garbled Circuits. Adaptive Security in Broadcast Encryption Systems. Wireless Personal Communications gentey Security Protocols Workshop Fully Homomorphic Encryption with Polylog Overhead.
JutlaMariana RaykovaDaniel Wichs: Craig GentryAllison B. Field switching in BGV-style homomorphic encryption.
Fully Secure Functional Encryption without Obfuscation. Secure distributed human computation. LewkoBrent Waters: