Batch Symmetric Fully Homomorphic Encryption Using Matrix Polynomials
Clicks: 216
ID: 87427
2018
Fully homomorphic encryption (FHE) is a recognized tool to obtain the cryptographic protec-tion of cloud computing. However, the characteristics of existing FHE schemes are not suffi-cient for use in practice � the security of some FHE is unsatisfying, others require too much computational resources. For improvement the efficiency of the last one IBM researchers pro-posed a method for "ciphertexts batching", which was applied by them to public key FHE scheme whose security is based on the complexity of the lattice theory hardness assumptions. In this paper, we discuss several methods for embedding "ciphertexts batching" into recently proposed symmetric encryption scheme based on matrix polynomials. For one of this method we completely specify how cryptosystem algorithms should work. The results of computer experiments are given.
| Reference Key |
burtyka2018batch
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Burtyka, Ph.; |
| Journal | Труды Института системного программирования РАН |
| Year | 2018 |
| DOI | DOI not found |
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.