Philipp Burtyka

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn 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)
Fully homomorphic encryption (FHE) is a tool of key importance to organize computations over encrypted data. But its misuse leads to privacy violation in spite of the encryption security. To use FHE correctly in applications one needs to solve a number of rather sophisticated problems. This paper considers delegation of programs evaluation over encrypted(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)
  • 1