• Publications
  • Influence
Trapdoors for hard lattices and new cryptographic constructions
TLDR
A new notion of trapdoor function with preimage sampling, simple and efficient "hash-and-sign" digital signature schemes, and identity-based encryption are included.
(Leveled) fully homomorphic encryption without bootstrapping
TLDR
A novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions, using some new techniques recently introduced by Brakerski and Vaikuntanathan (FOCS 2011).
Fully Homomorphic Encryption over the Integers
TLDR
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.
Gazelle: A Low Latency Framework for Secure Neural Network Inference
TLDR
Gazelle is designed, a scalable and low-latency system for secure neural network inference, using an intricate combination of homomorphic encryption and traditional two-party computation techniques (such as garbled circuits).
Efficient Fully Homomorphic Encryption from (Standard) LWE
TLDR
A new dimension-modulus reduction technique is introduced, which shortens the cipher texts and reduces the decryption complexity of the scheme, showing that ``somewhat homomorphic'' encryption can be based on LWE, using a new re-linearization technique.
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
TLDR
A somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security reduces to the worst-case hardness of problems on ideal lattices using the RLWE assumption, which allows us to completely abstract out the lattice interpretation.
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
TLDR
The construction of (multikey) FHE from NTRU encryption is constructed, which is capable of operating on inputs encrypted under multiple, unrelated keys, and a ciphertext resulting from a multikey evaluation can be jointly decrypted using the secret keys of all the users involved in the computation.
Can homomorphic encryption be practical?
TLDR
A proof-of-concept implementation of the recent somewhat homomorphic encryption scheme of Brakerski and Vaikuntanathan, whose security relies on the "ring learning with errors" (Ring LWE) problem, and a number of application-specific optimizations to the encryption scheme, including the ability to convert between different message encodings in a ciphertext.
A Framework for Efficient and Composable Oblivious Transfer
TLDR
A multi-bit amortized version of Regev's lattice-based cryptosystem (STOC 2005) whose time and space complexity are improved by a linear factor in the security parameter n.
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
TLDR
The public-key encryption scheme of Regev, and the identity-basedryption scheme of Gentry, Peikert and Vaikuntanathan are remarkably robust against memory attacks where the adversary can measure a large fraction of the bits of the secret-key, or more generally, can compute an arbitrary function of thesecret-key of bounded output length.
...
...