C
Craig Gentry
Researcher at IBM
Publications - 223
Citations - 44234
Craig Gentry is an academic researcher from IBM. The author has contributed to research in topics: Encryption & Homomorphic encryption. The author has an hindex of 75, co-authored 222 publications receiving 39327 citations. Previous affiliations of Craig Gentry include Stanford University & NTT DoCoMo.
Papers
More filters
Posted Content
Pinocchio: Nearly Practical Verifiable Computation.
TL;DR: Pinocchio as discussed by the authors is a built system for efficiently verifying general computations while relying only on cryptographic assumptions, where the client creates a public evaluation key to describe her computation; this setup is proportional to evaluating the computation once.
Book ChapterDOI
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
Dan Boneh,Craig Gentry,Sergey Gorbunov,Shai Halevi,Valeria Nikolaenko,Gil Segev,Vinod Vaikuntanathan,Dhinakaran Vinayagamurthy +7 more
TL;DR: The first (key-policy) attribute-based encryption (ABE) system with short secret keys is constructed, and the first reusable circuit garbling scheme that produces garbled circuits whose size is the same as the original circuit plus an additive poly(λ,d) bits is obtained.
Journal ArticleDOI
Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
TL;DR: This work gives constructions for indistinguishability obfuscation and functional encryption that supports all polynomial-size circuits and describes a candidate construction for blurry obfuscation for $\mathbf{NC}^1$ circuits.
Book ChapterDOI
Single-database private information retrieval with constant communication rate
Craig Gentry,Zulfikar Ramzan +1 more
TL;DR: A single-database private information retrieval (PIR) scheme with communication complexity ${\mathcal O}(k+d)$, where k ≥ log n is a security parameter that depends on the database size n and d is the bit-length of the retrieved database block.
Posted Content
Fully Homomorphic Encryption with Polylog Overhead.
TL;DR: This work presents a construction of fully homomorphic encryption schemes that for security parameter λ can evaluate any width-Ω(λ) circuit with t gates in time t· polylog(λ), and introduces permuting/routing techniques to move plaintext elements across these vectors efficiently.