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.
||Health and Food
||27 October 2007
|PDF File Size:
|ePub File Size:
||Free* [*Free Regsitration Required]
Craig GentryBrent Waters: Encrypted Messages from the Heights of Cryptomania. Witness Encryption from Instance Independent Assumptions.
Journal of Computer Security 21 5: Nearly Practical Verifiable Computation.
LewkoBrent Waters: Craig has also worked on verifiable computation VCwhich allows a user to outsource a computation e. Obfuscation using Tensor Products. How to Compress Reusable Garbled Circuits.
He obtained his Ph.
Craig Gentry (computer scientist)
The LLL Algorithm Structure and randomness in encrypted computation. Craig GentryAllison B. Zeroizing Without Low-Level Zeroes: Attacking cryptographic schemes based on “perturbation polynomials”.
Adaptive Security in Broadcast Encryption Systems. LewkoAmit SahaiBrent Waters: Public Key Cryptography FHE allows data processing to be outsourced e. The Case of Logistic Regression.
Cryptanalyzing multilinear maps without encodings of zero. Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits.
The NSA cited this as a reason to begin transitioning to lattice-based cryptosystems, or to other “post-quantum” cryptosystems. End-to-end security in the presence of intelligent data adapting proxies: Hiding secrets in software: Graph-Induced Multilinear Maps from Lattices.
Craig Gentry’s PhD Thesis
Witness encryption and its applications. JutlaMariana RaykovaDaniel Wichs: Craih GentryDaniel Wichs: Noncommutative Determinant is Hard: He also has a law degree from Harvard Law School.
Craig GentryZulfikar Ramzan: 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. Craig GentryPhilip D. Obfuscation Using Tensor Products.
dblp: Craig Gentry
Computing on Encrypted Data. Outsourcing Computation to Untrusted Workers. Wireless Personal Communications 29 Cryptanalyses of Candidate Branching Program Obfuscators.