Arrow Research search

Author name cluster

Adeline Langlois

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

1 paper
1 author row

Possible papers

1

STOC Conference 2013 Conference Paper

Classical hardness of learning with errors

  • Zvika Brakerski
  • Adeline Langlois
  • Chris Peikert
  • Oded Regev 0001
  • Damien StehlĂ©

We show that the Learning with Errors (LWE) problem is classically at least as hard as standard worst-case lattice problems. Previously this was only known under quantum reductions. Our techniques capture the tradeoff between the dimension and the modulus of LWE instances, leading to a much better understanding of the landscape of the problem. The proof is inspired by techniques from several recent cryptographic constructions, most notably fully homomorphic encryption schemes.