High-throughput and fully-pipelined ciphertext multiplier for homomorphic encryption-Reference-Cited by-同舟云学术

High-throughput and fully-pipelined ciphertext multiplier for homomorphic encryption

Published:2024-03-25 Issue:6 Volume:21 Page:20230628-20230628
ISSN:1349-2543
Container-title:IEICE Electronics Express
language:en
Short-container-title:IEICE Electron. Express

Author:

Wang Zeyu¹,Ikeda Makoto¹

Affiliation:

1. Department of Electrical Engineering and Information Systems, The University of Tokyo

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Link

https://www.jstage.jst.go.jp/article/elex/21/6/21_21.20230628/_pdf

Reference34 articles.

1. [1] C. Gentry: “Fully homomorphic encryption using ideal lattices,” Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing (2009) 169 (DOI: 10.1145/1536414.1536440).

2. [2] R. Gilad-Bachrach, et al.: “CryptoNets: applying neural networks to encrypted data with high throughput and accuracy,” Proceedings of The 33rd International Conference on Machine Learning 48 (2016) 201 (DOI: 10.5555/3045390.3045413).

3. [3] J.H. Cheon, et al.: “Homomorphic encryption for arithmetic of approximate numbers,” Advances in Cryptology - ASIACRYPT (2017) 409 (DOI: 10.1007/978-3-319-70694-8_15).

4. [4] Z. Brakerski, et al.: “(Leveled) Fully homomorphic encryption without bootstrapping,” ACM Trans. Comput. Theory 6 (2014) 1 (DOI: 10.1145/2633600).

5. [5] J. Fan and F. Vercauteren: “Somewhat practical fully homomorphic encryption,” Cryptology ePrint Archive (2012) Paper 2012/144.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Toward Bootstrapping-Free Homomorphic Encryption-Based GRU Network for Text Classification;IEEE Access;2024