Integer Matrices Homomorphic Encryption and Its application

Yanan Bai; Jingwei Chen; Yong Feng; Wenyuan Wu

Paper 2018/1025 Original: eprint.iacr.org/2018/1025 ↗

Integer Matrices Homomorphic Encryption and Its application

Yanan Bai

Jingwei Chen

Yong Feng

Wenyuan Wu

Abstract

We construct an integer matrices encryption scheme based on binary matrices encryption scheme proposed in Hiromasa et al.(PKC 2015). Our scheme supports homomorphic addition and multiplication operations, we prove the correctness and analyze the security. Besides, we implement four encryption schemes including public-key and symmetric-key binary matrices encryption schemes from Hiromasa et al.(PKC 2015), and public-key and symmetric-key integer matrices encryption schemes from this work. The experimental results show that the running time of homomorphic multiplycation just costs 3.03sec for integer matrix with $60\times 60$ entry size. It provides a promising prospect for applications. Finally, we apply integer matrices encryption to homomorphiclly solve a problem that computes the number of length-$k$ walks between any two vertices of a graph. The implement of the algorithm shows the effectiveness.

Metadata

Available format(s): PDF
Publication info: Preprint.
History: 2018-11-23: last updated; 2018-10-26: published
Short URL: https://ia.cr/2018/1025
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2018/1025,
      author = {Yanan Bai and Jingwei Chen and Yong Feng and Wenyuan Wu},
      title = {Integer Matrices Homomorphic Encryption and Its application},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/1025},
      year = {2018},
      url = {https://eprint.iacr.org/2018/1025}
}