Student Work

Exploiting Vulnerabilities in Homomorphic Encryption with Weak Randomness

Public

Downloadable Content

open in viewer

Suppose I give you a massively overdetermined yet consistent system of linear equations Ax = b over a finite ring, but I change a few of the values of b before showing it to you. Can you still solve for x? This is called the Learning With Errors problem, and it was introduced by Regev in 2009, who showed that it is hard on average. Today it is used in many homomorphic encryption schemes. Such schemes allow anyone to run computations on encrypted data without being able to learn what the data are. In this paper, I look at ways to exploit poor randomness in Learning With Errors. For extremely sparse noise models, I give polynomial-time solutions to the Learning With Errors problem.

  • This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.
Creator
Publisher
Identifier
  • E-project-042816-114516
Advisor
Year
  • 2016
Date created
  • 2016-04-28
Resource type
Major
Rights statement

Relations

In Collection:

Items

Items

Permanent link to this page: https://digital.wpi.edu/show/gm80hx00q