Philipp Burtyka

  • Citations Per Year
Learn More
We propose a new fully homomorphic encryption (FHE) scheme. Unlike previous ones, our FHE scheme is effective and simple enough for practical applications. Our FHE essentially exploits mathematical body of matrix polynomials which are matrix equations of a particular form. This makes the scheme both faster and (we believe) easier to understand than(More)
The paper considers the problem of organization the computations over encrypted data. This problem has become increasingly important due to the expansion of the cloud computing and the need for suitable measures to protect it. Different primitives were proposed to solve the problem in a limited context, such as garbled circuits, fully homomorphic(More)
  • 1