• Publications
  • Influence
Trapdoors for hard lattices and new cryptographic constructions
TLDR
We show how to construct a variety of "trapdoor" cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the shortest nonzero vector to within certain polynomial factors). Expand
  • 1,536
  • 205
  • PDF
(Leveled) fully homomorphic encryption without bootstrapping
TLDR
We present a new way of constructing leveled fully homomorphic encryption schemes (capable of evaluating arbitrary polynomial-size circuits), without Gentry's bootstrapping procedure. Expand
  • 1,311
  • 164
  • PDF
Fully Homomorphic Encryption over the Integers
TLDR
We construct a simple fully homomorphic encryption scheme from a “bootstrappable” somewhat homomorphic scheme. Expand
  • 1,463
  • 125
  • PDF
Efficient Fully Homomorphic Encryption from (Standard) LWE
TLDR
We present a fully homomorphic encryption scheme that is based solely on the(standard) learning with errors (LWE) assumption. Expand
  • 1,275
  • 70
  • PDF
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
TLDR
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems on ideal lattices. Expand
  • 811
  • 68
  • PDF
Can homomorphic encryption be practical?
TLDR
The prospect of outsourcing an increasing amount of data storage and management to cloud services raises many new privacy concerns for individuals and businesses alike. Expand
  • 835
  • 64
  • PDF
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
TLDR
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted "cloud" server. Expand
  • 591
  • 64
  • PDF
Gazelle: A Low Latency Framework for Secure Neural Network Inference
TLDR
The growing popularity of cloud-based machine learning raises a natural question about the privacy guarantees that can be provided in such a setting. Expand
  • 225
  • 52
  • PDF
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
TLDR
We show that the public-key encryption scheme proposed by Regev (STOC 2005), and the identity-based encryption 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. Expand
  • 457
  • 43
  • PDF
A Framework for Efficient and Composable Oblivious Transfer
TLDR
We propose a simple and general framework for constructing oblivious transfer (OT) protocols that are efficient, universally composable, and generally realizableunder any one of a variety of standard number-theoretic assumptions, including the decisional Diffie-Hellman assumption, the quadratic residuosity and decisional composuosity assumptions, and worst-caselattice assumptions. Expand
  • 573
  • 38
  • PDF