Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption

[1] BONEH, D.—GOH, E.—NISSIM, K.: Evaluating 2-DNF formulas on ciphertexts, in: Theory of Cryptography—TCC ’05, Lecture Notes in Comput. Sci., Vol. 3378, Springer-Verlag, Berlin, 2005, pp. 325–341.Search in Google Scholar

[2] BRAKERSKI, A., LANGLOIS, A., PEIKERT, C.—REGEV, O.—STEHLÉ, D.: Classical hardness of learning with errors, in: Symposium on Theory of Computing—STOC ’13, ACM New York, NY, USA, 2013, pp. 575–584.10.1145/2488608.2488680Search in Google Scholar

[3] BRAKERSKI, A.—VAIKUNTANATHAN, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages, in: Advances in cryptology–CRYPTO ’11, (P. Rogaway, ed.), Lecture Notes in Comput. Sci., Vol. 6841, Springer, Heidelberg, 2011. pp. 505–524.Search in Google Scholar

[4] GENTRY, C.: Fully homomorphic encryption using ideal lattices, in: Proceedings of the 41th Symposium on Theory of Computing—STOC ’09, ACM New York, NY, USA, 2009, pp. 169–178.10.1145/1536414.1536440Search in Google Scholar

[5] LAUTER, K.—NAEHRIG, M.—VAIKUNTANATHAN, V.: Can homomorphic encryption be practical ?, in: Proceedings of the 3rd ACM workshop on Cloud computing security workshop—CCSW ’11, ACM New York, NY, USA, 2011, pp. 113–124.10.1145/2046660.2046682Search in Google Scholar

[6] LYUBASHEVSKY, V.—PEIKERT, C.—REGEV, O.: On ideal lattices and learning with errors over rings, in: Advances in cryptology—EUROCRYPT ’10, Lecture Notes in Comput. Sci., Vol. 6110, Springer-Verlag, Berlin, 2010, pp. 1–23.Search in Google Scholar

[7] RIVEST, R.—SHAMIR, A.—ADLEMAN, L.: A method for obtaining digital signatures and public-key cryptosystems, Commun. ACM 21 (1978), no.(2), 120–126.10.21236/ADA606588Search in Google Scholar

[8] The PARI Group, Bordeaux, PARI/GP. http://pari.math.u-bordeaux.fr/doc.htmlSearch in Google Scholar

[9] YASUDA, M.—SHIMOYAMA, T.—KOGURE, J.—YOKOYAMA, K.—KOSHIBA, T.: New packing method in somewhat homomorphic encryption and its applications, Security and Communication Networks, 8 (2015), 2194–2213.10.1002/sec.1164Search in Google Scholar

[10] YASUDA, M.—SHIMOYAMA, T.—KOGURE, J.—YOKOYAMA, K.—KOSHIBA, T.: Secure statistical analysis using RLWE-based homomorphic encryption, ACISP ’15 (E. Foo and D. Stebila, eds.), Lectute Notes in Comput Sci., Vol. 9144, Springer-Verlag, Berllin, 2015, pp. 471–487.Search in Google Scholar