GMS: an efficient fully homomorphic encryption scheme for secure outsourced matrix multiplication
Authors: 
Jianxin Gao, Ying GaoAuthors Info & Claims
Jianxin Gao, Ying GaoAuthors Info & ClaimsPages 26435 - 26461
Abstract
Fully homomorphic encryption (FHE) is capable of handling sensitive encrypted data in untrusted computing environments. The efficient application of FHE schemes in secure outsourced computation can effectively address security and privacy concerns. This paper presents a novel fully homomorphic encryption scheme called GMS, based on the n-secret learning with errors (LWE) assumption. By utilizing block matrix and decomposition technology, GMS achieves shorter encryption and decryption times and smaller ciphertext sizes compared to existing FHE schemes. For secure outsourced matrix multiplication with arbitrary dimensions, GMS only requires rotations and one homomorphic multiplication. Compared to the state-of-the-art methods, our approach stands out by achieving a significant reduction in the number of rotations by a factor of , along with a decrease in the number of homomorphic multiplications by a factor of n and . The experimental results demonstrate that GMS shows superior performance for secure outsourced matrix multiplication of any dimension. For example, when encrypting a -dimensional matrix, the size of the ciphertext is only 1.27 MB. The encryption and decryption process takes approximately 0.2 s. For matrix multiplication , the runtime of our method is 39.98 s, achieving a speedup of up to 5X and 2X.
References
[1]
Zhang P, Huang T, Sun X, et al. Privacy-preserving and outsourced multi-party k-means clustering based on multi-key fully homomorphic encryption IEEE Trans Dependable Secure Comput 2023 20 3 2348-2359
[2]
Zhao L and Chen L Sparse matrix masking-based non-interactive verifiable (outsourced) computation, revisited IEEE Trans Dependable Secure Comput 2018 17 6 1188-1206
[3]
Duong DH, Mishra PK, and Yasuda M Efficient secure matrix multiplication over lwe-based homomorphic encryption Tatra Mt Math Publ 2016 67 1 69-83
[4]
Huang H and Zong H Secure matrix multiplication based on fully homomorphic encryption J Supercomput 2023 79 5 5064-5085
[5]
Zhu L, Hua Q, Chen Y, et al (2023) Secure outsourced matrix multiplication with fully homomorphic encryption. In: European Symposium on Research in Computer Security, Springer, pp 249–269,
[6]
Hiromasa R, Abe M, and Okamoto T Packing messages and optimizing bootstrapping in gsw-fhe IEICE Trans Fundam Electron Commun Comput Sci 2016 99 1 73-82
[7]
Van DM, Gentry C, Halevi S, et al (2010) Fully homomorphic encryption over the integers. In: Advances in Cryptology—EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30–June 3, 2010. Proceedings 29, Springer, pp 24–43
[8]
Regev O On lattices, learning with errors, random linear codes, and cryptography J ACM (JACM) 2009 56 6 1-40
[9]
Lpez-Alt A, Tromer E, Vaikuntanathan V, (2012) On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. IACR Cryptol ePrint Arch 2013:94.
[10]
Regev O The learning with errors problem Invit Surv CCC 2010 7 30 11
[11]
Brakerski Z, Gentry C, and Vaikuntanathan V (leveled) fully homomorphic encryption without bootstrapping ACM Trans Comput Theory (TOCT) 2014 6 3 1-36
[12]
Gentry C, Sahai A, Waters B (2013) Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Advances in Cryptology–CRYPTO 2013: 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2013. Proceedings, Part I, Springer, pp 75–92,
[13]
Cheon JH, Kim A, Kim M, et al (2017) Homomorphic encryption for arithmetic of approximate numbers. In: Advances in Cryptology—ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3–7, 2017, Proceedings, Part I 23, Springer, pp 409–437,
[14]
Chillotti I, Gama N, Georgieva M, et al. Tfhe: fast fully homomorphic encryption over the torus J Cryptol 2020 33 1 34-91
[15]
Benarroch D, Brakerski Z, Lepoint T (2017) Fhe over the integers: decomposed and batched in the post-quantum regime. In: IACR International Workshop on Public Key Cryptography, Springer, pp 271–301,
[16]
Canteaut A, Carpov S, Fontaine C, et al. Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression J Cryptol 2018 31 3 885-916
[17]
Genise N, Gentry C, Halevi S, et al (2019) Homomorphic encryption for finite automata. In: Advances in Cryptology—ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings, Part II 25, Springer, pp 473–502
[18]
Pereira HVL (2020) Efficient agcd-based homomorphic encryption for matrix and vector arithmetic. In: International Conference on Applied Cryptography and Network Security, Springer, pp 110–129,
[19]
Atallah MJ, Pantazopoulos KN, Rice JR, et al (2002) Secure outsourcing of scientific computations. In: Advances in Computers, vol 54. Elsevier, pp 215–272
[20]
Lei X, Liao X, Huang T, et al. Achieving security, robust cheating resistance, and high-efficiency for outsourcing large matrix multiplication computation to a malicious cloud Inf Sci 2014 280 205-217
[21]
Fu S, Yu Y, Xu M (2017) A secure algorithm for outsourcing matrix multiplication computation in the cloud. In: Proceedings of the Fifth ACM international workshop on security in cloud computing, pp 27–33,
[22]
Halevi S, Shoup V (2014) Algorithms in helib. In: Advances in Cryptology—CRYPTO 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17–21, 2014, Proceedings, Part I 34, Springer, pp 554–571,
[23]
Lu W, Kawasaki S, Sakuma J (2017) Using fully homomorphic encryption for statistical analysis of categorical, ordinal and numerical data. In: Proceedings 2017 Network and Distributed System Security Symposium, Internet Society,
[24]
Wang S and Huang H Secure outsourced computation of multiple matrix multiplication based on fully homomorphic encryption KSII Trans Internet Inf Syst (TIIS) 2019 13 11 5616-5630
[25]
Lu W, Sakuma J (2018) More practical privacy-preserving machine learning as a service via efficient secure matrix multiplication. In: Proceedings of the 6th Workshop on Encrypted Computing and Applied Homomorphic Cryptography, pp 25–36,
[26]
Jiang X, Kim M, Lauter K, et al (2018) Secure outsourced matrix computation and application to neural networks. In: Proceedings of the 2018 ACM SIGSAC conference on computer and communications security, pp 1209–1222,
[27]
Micciancio D, Walter M (2017) Gaussian sampling over the integers: Efficient, generic, constant-time. In: Advances in Cryptology—CRYPTO 2017: 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20–24, 2017, Proceedings, Part II 37, Springer, pp 455–485,
[28]
Genise N, Micciancio D, Polyakov Y (2019) Building an efficient lattice gadget toolkit: Subgaussian sampling and more. In: Advances in Cryptology—EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19–23, 2019, Proceedings, Part II 38, Springer, pp 655–684,
[29]
Katz J and Lindell Y Introduction to modern cryptography 2020 3 London Chapman and Hall CRC
Index Terms
- GMS: an efficient fully homomorphic encryption scheme for secure outsourced matrix multiplication
Index terms have been assigned to the content through auto-classification.
Recommendations
Secure matrix multiplication based on fully homomorphic encryption
AbstractFully homomorphic encryption allows to perform arbitrary computation over encrypted data which has great practical implications in the secure outsourced computation on an untrusted computation environment. This paper investigates secure matrix ...
Secure Outsourced Matrix Multiplication with Fully Homomorphic Encryption
Computer Security – ESORICS 2023CCA-Secure Keyed-Fully Homomorphic Encryption
Proceedings, Part I, of the 19th IACR International Conference on Public-Key Cryptography --- PKC 2016 - Volume 9614To simultaneously achieve CCA security and homomorphic property for encryption, Emura et al. introduced a new cryptographic primitive named keyed-homomorphic encryption, in which homomorphic ciphertext manipulations can only be performed by someone ...
Comments
Information & Contributors
Information
Published In
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
Publisher
Kluwer Academic Publishers
United States
Publication History
Published: 26 August 2024
Accepted: 11 August 2024
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Jan 2025