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.
|Country:||Sao Tome and Principe|
|Genre:||Health and Food|
|Published (Last):||4 April 2013|
|PDF File Size:||3.9 Mb|
|ePub File Size:||13.64 Mb|
|Price:||Free* [*Free Regsitration Required]|
Privacy Enhancing Technologies Outsourcing Computation to Untrusted Workers.
Craig Gentry’s PhD Thesis
Cryptanalyzing multilinear maps without encodings of zero. FHE allows data processing to be outsourced e.
Secure distributed human computation. Obfuscation using Tensor Products.
Craig GentryZulfikar Ramzan: Hiding secrets in software: Craig GentryAllison B. Homomorphic Encryption from Learning with Errors: Craig GentryBrent Waters: Cryptanalyses of Candidate Branching Program Obfuscators.
JutlaMariana Raykova: MajiAmit Sahai: Craig EncryprionDaniel Wichs: Graph-Induced Multilinear Maps from Lattices. How to Compress Reusable Garbled Circuits.
Craig Gentry’s PhD Thesis
Craig GentryPhilip D. GoldmanShai HaleviCharanjit S. Computing arbitrary functions of encrypted data. Leveled fully homomorphic encryption without bootstrapping. Journal of Computer Security 21 5: InCraig constructed the first fully homomorphic encryption FHE scheme, which allows data to be processed in arbitrarily complex ways while it remains encrypted, solving a major open problem that had been unsolved for 30 years.
IBM Search for people. Adaptive Security in Broadcast Encryption Systems. Encrypted Messages from the Heights of Cryptomania. The Case of Logistic Regression. Leveled Fully Homomorphic Encryption without Bootstrapping. Witness Encryption from Instance Independent Assumptions. 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.
Functional Encryption Without Obfuscation. Better Bootstrapping in Fully Homomorphic Encryption. Witness Encryption and its Applications. Separating succinct non-interactive arguments from all falsifiable assumptions.
Sampling Discrete Gaussians Efficiently and Obliviously. Trapdoors for hard lattices and new cryptographic constructions. 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. Witness encryption and its applications. Zeroizing Without Low-Level Zeroes: Encryphion obtained his Ph.
Fully homomorphic encryption using ideal lattices. Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing. Computing on the edge of chaos: 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. Security Protocols Workshop Computing on the Edge of Chaos: Fully Secure Functional Encryption without Obfuscation.
Obfuscation Using Tensor Products.
Fully Homomorphic Ohmomorphic over the Integers. Craig GentryCharanjit S. Much of Craig’s recent work, including FHE and cryptographic multilinear maps, generally falls into the area of “lattice-based cryptography”. Structure and Randomness in Encrypted Computation. The Geometry of Provable Security: Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits.