Share This Author
Fully Homomorphic Encryption over the Integers
- Marten van Dijk, Craig Gentry, S. Halevi, V. Vaikuntanathan
- Mathematics, Computer ScienceEUROCRYPT
- 30 May 2010
A fully homomorphic encryption scheme, using only elementary modular arithmetic, that reduces the security of the scheme to finding an approximate integer gcd, and investigates the hardness of this task, building on earlier work of Howgrave-Graham.
A Forward-Secure Public-Key Encryption Scheme
The first constructions of (non-interactive) forward-secure public-key encryption schemes are presented and the main construction achieves security against chosen-plaintext attacks in the standard model, and all parameters are poly-logarithmic in the total number of time periods.
Chosen-Ciphertext Security from Identity-Based Encryption
- D. Boneh, R. Canetti, S. Halevi, Jonathan Katz
- Computer Science, MathematicsSIAM J. Comput.
- 2 May 2004
This work proposes a simple and efficient construction of a CCA-secure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme, which avoids non-interactive proofs of “well-formedness” which were shown to underlie most previous constructions.
Implementing Gentry's Fully-Homomorphic Encryption Scheme
A working implementation of a variant of Gentry's fully homomorphic encryption scheme, similar to the variant used in an earlier implementation effort by Smart and Vercauteren (PKC 2010), with a number of optimizations that allow it to implement all aspects of the scheme, including the bootstrapping functionality.
Algorithms in HElib
Some of the algorithms and optimization techniques that are used in HElib for data movement, linear algebra, and other operations over this “platform” are described.
Homomorphic Evaluation of the AES Circuit
- Craig Gentry, S. Halevi, N. Smart
- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 19 August 2012
A working implementation of leveled homomorphic encryption without bootstrapping that can evaluate the AES-128 circuit in three different ways, and develops both AES-specific optimizations as well as several "generic" tools for FHE evaluation.
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits
- Sanjam Garg, Craig Gentry, S. Halevi, Mariana Raykova, A. Sahai, Brent Waters
- Computer Science, MathematicsIEEE 54th Annual Symposium on Foundations of…
- 26 October 2013
This work gives constructions for indistinguishability obfuscation and functional encryption that supports all polynomial-size circuits and shows how to use them together with Fully Homomorphic Encryption to achieve functional encryption for all circuits.
Proofs of ownership in remote storage systems
This work identifies attacks that exploit client-side deduplication, allowing an attacker to gain access to arbitrary-size files of other users based on a very small hash signatures of these files, and introduces the notion of proofs-of-ownership (PoWs), which lets a client efficiently prove to a server that that the client holds a file, rather than just some short information about it.
Candidate Multilinear Maps from Ideal Lattices
We describe plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm groups, and show an example application of such…
Public-Key Cryptosystems from Lattice Reduction Problems
A new proposal for a trapdoor one-way function, from which the security of the new construction is based on the conjectured computational difficulty of lattice-reduction problems, providing a possible alternative to existing public-key encryption algorithms and digital signatures such as RSA and DSS.