Batch Symmetric Fully Homomorphic Encryption Using Matrix Polynomials
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.
Keywords
Citation
ID:
87427
References
Blockchain Verification
Account:
NFT Contract Address:
0x95644003c57E6F55A65596E3D9Eac6813e3566dA
Article ID:
87427
Unique Identifier:
Network:
Scimatic Chain (ID: 481)
Loading...
Blockchain Readiness Checklist
Authors
Abstract
Journal Name
Year
Title
Creates 1,000,000 NFT tokens for this article
Token Features:
- ERC-1155 Standard NFT
- 1 Million Supply per Article
- Transferable via MetaMask
- Permanent Blockchain Record
Scan with Saymatik Web3.0 Wallet