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):||25 May 2016|
|PDF File Size:||1.59 Mb|
|ePub File Size:||19.72 Mb|
|Price:||Free* [*Free Regsitration Required]|
Witness encryption and its applications.
Craig Gentry’s PhD Thesis
Leveled Fully Homomorphic Encryption without Bootstrapping. Ordered multisignatures and identity-based sequential aggregate signatures, with encrypton to secure routing. Noncommutative Determinant is Hard: Outsourcing Computation to Untrusted Workers. Craig GentryPhilip D. End-to-end security in the presence of intelligent data adapting proxies: Trapdoors for hard lattices and new cryptographic constructions.
Fully Homomorphic Encryption over the Integers. LewkoBrent Waters: Craig GentryCharanjit S. Much of Craig’s recent work, including FHE and cryptographic multilinear maps, generally falls into the area of “lattice-based cryptography”. Obfuscation Using Tensor Products. Craig has also worked on verifiable computation VCwhich allows a user to outsource a computation e. Obfuscation using Tensor Products.
Separating succinct non-interactive arguments from all falsifiable assumptions. Zeroizing Without Low-Level Zeroes: Fully homomorphic encryption using ideal lattices. Field switching in BGV-style homomorphic encryption. 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.
Leveled fully homomorphic encryption without bootstrapping. JutlaMariana Raykova: 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.
IBM Search for people. Privacy Enhancing Technologies Computing on the edge of chaos: Cryptanalyses of Candidate Branching Program Obfuscators. Cryptanalyzing multilinear maps without encodings of zero.
Candidate Multilinear Maps from Ideal Lattices. Nearly Practical Verifiable Computation. Structure and Randomness in Encrypted Computation. Sampling Discrete Gaussians Efficiently and Obliviously. The Case of Logistic Regression.
Wireless Personal Communications 29 Structure and randomness in encrypted computation.
Craig Gentry’s PhD Thesis
MajiAmit Sahai: Homomorphic Encryption from Learning with Errors: He obtained his Ph. Public Key Cryptography 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. Craig GentryKenny A. Password authenticated key exchange using hidden smooth subgroups.
Fully Secure Functional Encryption without Obfuscation. InCraig constructed the first fully homomorphic encryption FHE scheme, which allows data to be processed in arbitrarily complex enceyption while it remains encrypted, solving a major open problem that had been unsolved for 30 years.
Adaptive Security in Broadcast Encryption Systems. JutlaMariana RaykovaDaniel Wichs: He also has a law degree from Harvard Law School. Witness Encryption from Instance Independent Assumptions. Computing on Encrypted Data. GoldmanShai HaleviCharanjit S.
Craig GentryBrent Waters: