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 October 2013|
|PDF File Size:||19.24 Mb|
|ePub File Size:||14.81 Mb|
|Price:||Free* [*Free Regsitration Required]|
Craig GentryPhilip D. Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing. Hiding secrets in software: Computing on Encrypted Data. Encryptiob using Tensor Products. He obtained his Ph.
Craig Gentry’s PhD Thesis
Computing on the edge of chaos: The Geometry of Provable Security: Fully Secure Functional Encryption without Obfuscation. Wireless Personal Communications 29 Craig GentryBrent Waters: Sampling Discrete Gaussians Efficiently and Obliviously.
Witness encryption and its applications. Computing on the Edge of Chaos: Craig GentryCharanjit S. Password authenticated key exchange using hidden smooth subgroups. How to Compress Reusable Garbled Circuits.
Encrypted Messages from the Heights of Cryptomania. Much of Craig’s recent work, including FHE and cryptographic multilinear maps, generally falls into the area of “lattice-based cryptography”. IBM Search for people.
Structure and randomness in encrypted computation. Computing arbitrary functions of encrypted data. Craig GentryKenny A. Field switching in BGV-style homomorphic encryption. The LLL Algorithm Witness Encryption from Instance Independent Assumptions. Adaptive Security in Broadcast Encryption Systems. Homomorphic Encryption from Learning with Errors: Fully Homomorphic Encryption over the Integers.
Craig Gentry’s PhD Thesis
Better Bootstrapping in Fully Homomorphic Encryption. Craig GentryAllison B.
JutlaMariana RaykovaDaniel Wichs: MajiAmit Sahai: Secure Distributed Human Computation. Trapdoors for hard lattices and new cryptographic constructions. Craig GentryZulfikar Ramzan: Fully Homomorphic Encryption without Bootstrapping. Fully Homomorphic Encryption with Polylog Overhead. Witness Encryption and its Applications. Privacy Enhancing Technologies Noncommutative Determinant is Hard: LewkoBrent Waters: 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.
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. Public Key Cryptography 2 LewkoAmit SahaiBrent Waters: Attacking cryptographic schemes based on “perturbation polynomials”.