Jogan, Takuma and Matsuzawa, Tomofumi and Takeda, Masayuki (2019) Acceleration of Homomorphic Arithmetic Processing Based on the ElGamal Cryptosystem. Communications and Network, 11 (01). pp. 1-10. ISSN 1949-2421
CN_2019012314591985.pdf - Published Version
Download (659kB)
Abstract
In recent years, opportunities for using cloud services as computing resources have increased and there is a concern that private information may be leaked when processes data. The data processing while maintaining confidentiality is called secret computation. Cryptosystems can add and multiply plaintext through the manipulation of ciphertexts of homomorphic cryptosystems, but most of them have restrictions on the number of multiplications that can be performed. Among the different types of cryptosystems, fully homomorphic encryption can perform arbitrary homomorphic addition and multiplication, but it takes a long time to eliminate the limitation on the number of homomorphic operations and to carry out homomorphic multiplication. Therefore, in this paper, we propose an arithmetic processing method that can perform an arbitrary number of homomorphic addition and multiplication operations based on ElGamal cryptosystem. The results of experiments comparing with the proposed method with HElib in which the BGV scheme of fully homomorphic encryption is implemented showed that, although the processing time for homomorphic addition per ciphertext increased by about 35%, the processing time for homomorphic multiplication was reduced to about 1.8%, and the processing time to calculate the statistic (variance) had approximately a 15% reduction.
Item Type: | Article |
---|---|
Subjects: | Scholar Eprints > Computer Science |
Depositing User: | Managing Editor |
Date Deposited: | 15 Feb 2023 06:13 |
Last Modified: | 13 Sep 2024 08:06 |
URI: | http://repository.stmscientificarchives.com/id/eprint/512 |