Batch Symmetric Fully Homomorphic Encryption Using Matrix Polynomials

Clicks: 358
ID: 87427
2018
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Star

Ranked #1 of 2 articles by views in Труды Института системного программирования РАН

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
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

No comments yet. Be the first to comment on this article.