• Publications
  • Influence
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
TLDR
We give new methods for generating and using "strong trapdoors" in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), and asymptotically optimal with very small hidden constants. Expand
  • 720
  • 99
  • PDF
Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions
TLDR
This paper provides theoretical foundations for the group signature primitive. Expand
  • 655
  • 72
  • PDF
Worst-Case to Average-Case Reductions Based on Gaussian Measures
TLDR
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost linear in the dimension of the lattice. Expand
  • 508
  • 58
  • PDF
Multicast security: a taxonomy and some efficient constructions
TLDR
Multicast communication is becoming the basis for a growing number of applications. Expand
  • 790
  • 45
  • PDF
FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
TLDR
We present a new method to homomorphically compute simple bit operations, and refresh (bootstrap) the resulting output, which runs on a personal computer in just about half a second. Expand
  • 283
  • 37
  • PDF
Worst-case to average-case reductions based on Gaussian measures
TLDR
We show that solving modular linear equation on the average is at least as hard as approximating several lattice problems in the worst case within a factor almost linear in the rank of the lattice. Expand
  • 347
  • 31
  • PDF
Generalized Compact Knapsacks Are Collision Resistant
TLDR
An edited version of this paper appears in International Colloquium on Automata, Languages and Programming - Proceedings of ICALP 2006, Venice, Italy. Expand
  • 290
  • 29
  • PDF
A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost
TLDR
We present a simple, new paradigm for the design of collision-free hash functions. Expand
  • 253
  • 26
  • PDF
Complexity of lattice problems
TLDR
Borrow to your friends and don't know when to give back it to her or him. Expand
  • 402
  • 23
Faster exponential time algorithms for the shortest vector problem
TLDR
We present new faster algorithms for the exact solution of the shortest vector problem in arbitrary lattices in time 2<sup><i>O(n)</i></sup>. Expand
  • 187
  • 22
  • PDF
...
1
2
3
4
5
...