Welcome to the resource topic for 2018/1025
Title:
Integer Matrices Homomorphic Encryption and Its application
Authors: 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.
ePrint: https://eprint.iacr.org/2018/1025
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .