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):||10 January 2016|
|PDF File Size:||7.82 Mb|
|ePub File Size:||20.21 Mb|
|Price:||Free* [*Free Regsitration Required]|
Fully Homomorphic Encryption without Bootstrapping. Better Bootstrapping in Fully Homomorphic Encryption. Fully Homomorphic Encryption over the Integers.
He obtained his Ph. Fully homomorphic encryption using ideal lattices. Structure and randomness in encrypted computation.
Craig B. Gentry – IBM
Public Key Cryptography 2 Graph-Induced Multilinear Maps from Lattices. MacKenzieZulfikar Ramzan: End-to-end security gentru the presence of intelligent data adapting proxies: Craig GentryDaniel Wichs: Crsig and Randomness in Encrypted Computation. Privacy Enhancing Technologies Craig GentryKenny A. GoldmanShai HaleviCharanjit S. Field switching in BGV-style homomorphic encryption.
Trapdoors for hard lattices and new cryptographic constructions. JutlaMariana Raykova: Attacking cryptographic schemes based on “perturbation polynomials”. HomommorphicAmit SahaiBrent Waters: Nearly Practical Verifiable Computation. Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits. 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.
Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing. Witness Encryption and its Applications.
Noncommutative Determinant is Hard: Functional Encryption Without Obfuscation. InCraig constructed the first fully homomorphic encryption FHE scheme, which allows data to be processed in arbitrarily complex ways while it homomirphic encrypted, solving a major open problem that had been unsolved for 30 years. Secure distributed human computation. Computing on Encrypted Data. Zeroizing Without Low-Level Zeroes: Outsourcing Computation to Untrusted Workers. Leveled fully homomorphic encryption without bootstrapping.
Obfuscation Using Tensor Products. Candidate Multilinear Maps from Ideal Lattices. Sampling Discrete Gaussians Efficiently and Obliviously.
Craig Gentry’s PhD Thesis
LewkoBrent Waters: Leveled Fully Homomorphic Encryption without Bootstrapping. Secure Distributed Human Computation.
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. Craig GentryBrent Waters: Cryptanalyzing multilinear maps without encodings of zero.
Craig Gentry (computer scientist)
Wireless Personal Communications 29 Obfuscation using Tensor Products. JutlaMariana RaykovaDaniel Wichs: Fully Secure Functional Encryption without Obfuscation. Unlike commonly-used cryptosystems like RSA and elliptic-curve cryptography, lattice-based cryptosystems cannot feasibly as gntry as we know be broken by quantum computers. Adaptive Security in Broadcast Encryption Systems.
Cryptanalyses of Candidate Branching Program Obfuscators. IBM Search for people. Computing on the Edge of Nomomorphic Computing arbitrary functions of encrypted data. Computing on the edge of chaos: 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.