Enhancement for secure multiple matrix multiplications over ring-LWE homomorphic encryption

Pradeep Kumar Mishra, Dung Hoang Duong, Masaya Yasuda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Homomorphic encryption allows to perform various calculations on encrypted data without decryption. In this paper, we propose an efficient method for secure multiple matrix multiplications over the somewhat homomorphic encryption scheme proposed by Brakerski and Vaikuntanathan. Our method is a generalization of Duong et al.’s method, which computes only one multiplication between two matrices. In order to minimize both the ciphertext size and the computation cost, our method packs every matrix into a single ciphertext so that it enables efficient matrix multiplications over the packed ciphertexts. We also propose several modifications to obtain practical performance of secure multiplications among matrices with larger size and entries. We show implementation results of our packing method with modifications for secure multiplications among two and three matrices with 32 × 32 and 64 × 64 sizes and entries from 16-bit to 64-bit.

Original languageEnglish
Title of host publicationInformation Security Practice and Experience - 13th International Conference, ISPEC 2017, Proceedings
EditorsJoseph K. Liu, Pierangela Samarati
PublisherSpringer Verlag
Pages320-330
Number of pages11
ISBN (Print)9783319723587
DOIs
Publication statusPublished - Jan 1 2017
Event13th International Conference on Information Security Practice and Experience, ISPEC 2017 - Melbourne, Australia
Duration: Dec 13 2017Dec 15 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10701 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th International Conference on Information Security Practice and Experience, ISPEC 2017
CountryAustralia
CityMelbourne
Period12/13/1712/15/17

Fingerprint

Homomorphic Encryption
Matrix multiplication
Cryptography
Enhancement
Ring
Multiplication
Packing
Minimise
Costs

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Mishra, P. K., Duong, D. H., & Yasuda, M. (2017). Enhancement for secure multiple matrix multiplications over ring-LWE homomorphic encryption. In J. K. Liu, & P. Samarati (Eds.), Information Security Practice and Experience - 13th International Conference, ISPEC 2017, Proceedings (pp. 320-330). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10701 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-72359-4_18

Enhancement for secure multiple matrix multiplications over ring-LWE homomorphic encryption. / Mishra, Pradeep Kumar; Duong, Dung Hoang; Yasuda, Masaya.

Information Security Practice and Experience - 13th International Conference, ISPEC 2017, Proceedings. ed. / Joseph K. Liu; Pierangela Samarati. Springer Verlag, 2017. p. 320-330 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10701 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mishra, PK, Duong, DH & Yasuda, M 2017, Enhancement for secure multiple matrix multiplications over ring-LWE homomorphic encryption. in JK Liu & P Samarati (eds), Information Security Practice and Experience - 13th International Conference, ISPEC 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10701 LNCS, Springer Verlag, pp. 320-330, 13th International Conference on Information Security Practice and Experience, ISPEC 2017, Melbourne, Australia, 12/13/17. https://doi.org/10.1007/978-3-319-72359-4_18
Mishra PK, Duong DH, Yasuda M. Enhancement for secure multiple matrix multiplications over ring-LWE homomorphic encryption. In Liu JK, Samarati P, editors, Information Security Practice and Experience - 13th International Conference, ISPEC 2017, Proceedings. Springer Verlag. 2017. p. 320-330. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-72359-4_18
Mishra, Pradeep Kumar ; Duong, Dung Hoang ; Yasuda, Masaya. / Enhancement for secure multiple matrix multiplications over ring-LWE homomorphic encryption. Information Security Practice and Experience - 13th International Conference, ISPEC 2017, Proceedings. editor / Joseph K. Liu ; Pierangela Samarati. Springer Verlag, 2017. pp. 320-330 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{5dd5442899c941e799760e96bd0dfb96,
title = "Enhancement for secure multiple matrix multiplications over ring-LWE homomorphic encryption",
abstract = "Homomorphic encryption allows to perform various calculations on encrypted data without decryption. In this paper, we propose an efficient method for secure multiple matrix multiplications over the somewhat homomorphic encryption scheme proposed by Brakerski and Vaikuntanathan. Our method is a generalization of Duong et al.’s method, which computes only one multiplication between two matrices. In order to minimize both the ciphertext size and the computation cost, our method packs every matrix into a single ciphertext so that it enables efficient matrix multiplications over the packed ciphertexts. We also propose several modifications to obtain practical performance of secure multiplications among matrices with larger size and entries. We show implementation results of our packing method with modifications for secure multiplications among two and three matrices with 32 × 32 and 64 × 64 sizes and entries from 16-bit to 64-bit.",
author = "Mishra, {Pradeep Kumar} and Duong, {Dung Hoang} and Masaya Yasuda",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-72359-4_18",
language = "English",
isbn = "9783319723587",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "320--330",
editor = "Liu, {Joseph K.} and Pierangela Samarati",
booktitle = "Information Security Practice and Experience - 13th International Conference, ISPEC 2017, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Enhancement for secure multiple matrix multiplications over ring-LWE homomorphic encryption

AU - Mishra, Pradeep Kumar

AU - Duong, Dung Hoang

AU - Yasuda, Masaya

PY - 2017/1/1

Y1 - 2017/1/1

N2 - Homomorphic encryption allows to perform various calculations on encrypted data without decryption. In this paper, we propose an efficient method for secure multiple matrix multiplications over the somewhat homomorphic encryption scheme proposed by Brakerski and Vaikuntanathan. Our method is a generalization of Duong et al.’s method, which computes only one multiplication between two matrices. In order to minimize both the ciphertext size and the computation cost, our method packs every matrix into a single ciphertext so that it enables efficient matrix multiplications over the packed ciphertexts. We also propose several modifications to obtain practical performance of secure multiplications among matrices with larger size and entries. We show implementation results of our packing method with modifications for secure multiplications among two and three matrices with 32 × 32 and 64 × 64 sizes and entries from 16-bit to 64-bit.

AB - Homomorphic encryption allows to perform various calculations on encrypted data without decryption. In this paper, we propose an efficient method for secure multiple matrix multiplications over the somewhat homomorphic encryption scheme proposed by Brakerski and Vaikuntanathan. Our method is a generalization of Duong et al.’s method, which computes only one multiplication between two matrices. In order to minimize both the ciphertext size and the computation cost, our method packs every matrix into a single ciphertext so that it enables efficient matrix multiplications over the packed ciphertexts. We also propose several modifications to obtain practical performance of secure multiplications among matrices with larger size and entries. We show implementation results of our packing method with modifications for secure multiplications among two and three matrices with 32 × 32 and 64 × 64 sizes and entries from 16-bit to 64-bit.

UR - http://www.scopus.com/inward/record.url?scp=85038081535&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85038081535&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-72359-4_18

DO - 10.1007/978-3-319-72359-4_18

M3 - Conference contribution

AN - SCOPUS:85038081535

SN - 9783319723587

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 320

EP - 330

BT - Information Security Practice and Experience - 13th International Conference, ISPEC 2017, Proceedings

A2 - Liu, Joseph K.

A2 - Samarati, Pierangela

PB - Springer Verlag

ER -