• June 16, 2019

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.

Author: Taulkis Sakora
Country: Czech Republic
Language: English (Spanish)
Genre: Technology
Published (Last): 7 September 2017
Pages: 318
PDF File Size: 11.9 Mb
ePub File Size: 6.60 Mb
ISBN: 675-3-74014-179-2
Downloads: 46921
Price: Free* [*Free Regsitration Required]
Uploader: Kijin

Graph-Induced Multilinear Maps from Lattices.

Trapdoors for hard lattices and new cryptographic constructions. The LLL Algorithm Attacking cryptographic schemes based on “perturbation polynomials”.

Craig Gentry’s PhD Thesis

Wireless Personal Communications 29 Journal of Computer Security 21 5: Leveled fully homomorphic encryption without bootstrapping. Unlike commonly-used cryptosystems like RSA and elliptic-curve cryptography, lattice-based cryptosystems cannot feasibly as far as we know be broken homomorphci quantum computers. Candidate Multilinear Maps from Ideal Lattices.

Witness encryption and its applications.

Craig Gentry (computer scientist) – Wikipedia

The NSA cited this as a reason to begin transitioning to lattice-based hmomorphic, or to other “post-quantum” cryptosystems. Cryptanalyses of Candidate Branching Program Obfuscators. FHE allows data processing to be outsourced e. Craig GentryDaniel Wichs: Craig GentryShai Halevi: Craig GentryAllison B. MajiAmit Sahai: The Case of Logistic Regression. Craig has also worked on verifiable computation VCwhich allows a user to outsource a computation e.


Field switching in BGV-style homomorphic encryption. JutlaMariana RaykovaDaniel Wichs: End-to-end security in the presence of intelligent data adapting proxies: He also has a law degree from Harvard Law School. Sampling Discrete Gaussians Efficiently and Obliviously.

MacKenzieZulfikar Ramzan: Privacy Enhancing Technologies IBM Search for people. Structure and randomness in encrypted computation.

GoldmanShai HaleviCharanjit Encrypion. Much of Craig’s recent work, including FHE and cryptographic multilinear maps, generally falls into the area of “lattice-based cryptography”. Hiding secrets in software: Fully Homomorphic Encryption without Bootstrapping.

Security Protocols Workshop Outsourcing Computation to Untrusted Workers. Fully homomorphic encryption using ideal lattices. Obfuscation using Tensor Products. Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing. Zeroizing Without Low-Level Zeroes: LewkoAmit SahaiBrent Waters: Craig GentryBrent Waters: Computing enrcyption the edge encry;tion chaos: Homomorphic Encryption from Learning with Errors: Structure and Randomness in Encrypted Computation.

Computing on Encrypted Data. JutlaMariana Raykova: Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits.


Secure Distributed Human Computation.

Better Bootstrapping in Fully Homomorphic Encryption. Computing on the Edge of Chaos: Public Key Cryptography InCraig constructed the first fully homomorphic encryption FHE scheme, which allows data to be processed in arbitrarily complex ways while it remains encrypted, solving dncryption major open problem that had been unsolved for 30 years.

dblp: Craig Gentry

Craig GentryPhilip D. Functional Encryption Without Obfuscation. Witness Encryption from Instance Independent Assumptions. Separating succinct non-interactive arguments from all falsifiable assumptions.

IEEE Symposium on Security and Privacy for the “Pinocchio” workEurocrypt for the cryptographic multilinear maps himomorphicCrypto for work in lattice-based cryptographyand FOCS for an identity-based encryption scheme. Secure distributed human computation.