Proceedings of ISP RAS


Batch Symmetric Fully Homomorphic Encryption Using Matrix Polynomials.

Ph. Burtyka.

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

information security, cloud computing, fully homomorphic encryption, batch encryption, matrix polynomials, secret computations

Edition

Proceedings of the Institute for System Programming, vol. 26, issue 5, 2014, pp. 99-116.

ISSN 2220-6426 (Online), ISSN 2079-8156 (Print).

DOI: 10.15514/ISPRAS-2014-26(5)-5

Full text of the paper in pdf (in Russian) Back to the contents of the volume