Secure statistical analysis using RLWE-based homomorphic encryption

Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba

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

12 Citations (Scopus)

Abstract

Homomorphic encryption enables various calculations while preserving the data confidentiality. Here we apply the homomorphic encryption scheme proposed by Brakerski and Vaikuntanathan (CRYPTO 2011) to secure statistical analysis between two variables. For reduction of ciphertext size and practical performance, we propose a method to pack multiple integers into a few ciphertexts so that it enables efficient computation over the packed ciphertexts. Our packing method is based on Yasuda et al.’s one (DPM 2013). While their method gives efficient secure computation only for small integers, our modification is effective for larger integers. Our implementation shows that our method is faster than the state-of-the-art work. Specifically, for one million integers of 16 bits (resp. 128 bits), it takes about 20 minutes (resp. 3.6 hours) for secure covariance and correlation on an Intel Core i7-3770 3.40 GHz CPU.

Original languageEnglish
Title of host publicationInformation Security and Privacy - 20th Australasian Conference, ACISP 2015, Proceedings
PublisherSpringer Verlag
Pages471-487
Number of pages17
Volume9144
ISBN (Print)9783319199610
DOIs
Publication statusPublished - 2015
Externally publishedYes
Event20th Australasian Conference on Information Security and Privacy, ACISP 2015 - Brisbane, Australia
Duration: 2015 Jun 292015 Jul 1

Publication series

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

Other

Other20th Australasian Conference on Information Security and Privacy, ACISP 2015
CountryAustralia
CityBrisbane
Period15/6/2915/7/1

Fingerprint

Homomorphic Encryption
Cryptography
Statistical Analysis
Statistical methods
Integer
Secure Computation
Program processors
Confidentiality
Packing

Keywords

  • Homomorphic encryption
  • Packing methods
  • Ring-LWE assumption
  • Secure covariance and correlation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yasuda, M., Shimoyama, T., Kogure, J., Yokoyama, K., & Koshiba, T. (2015). Secure statistical analysis using RLWE-based homomorphic encryption. In Information Security and Privacy - 20th Australasian Conference, ACISP 2015, Proceedings (Vol. 9144, pp. 471-487). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9144). Springer Verlag. https://doi.org/10.1007/978-3-319-19962-7_27

Secure statistical analysis using RLWE-based homomorphic encryption. / Yasuda, Masaya; Shimoyama, Takeshi; Kogure, Jun; Yokoyama, Kazuhiro; Koshiba, Takeshi.

Information Security and Privacy - 20th Australasian Conference, ACISP 2015, Proceedings. Vol. 9144 Springer Verlag, 2015. p. 471-487 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9144).

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

Yasuda, M, Shimoyama, T, Kogure, J, Yokoyama, K & Koshiba, T 2015, Secure statistical analysis using RLWE-based homomorphic encryption. in Information Security and Privacy - 20th Australasian Conference, ACISP 2015, Proceedings. vol. 9144, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9144, Springer Verlag, pp. 471-487, 20th Australasian Conference on Information Security and Privacy, ACISP 2015, Brisbane, Australia, 15/6/29. https://doi.org/10.1007/978-3-319-19962-7_27
Yasuda M, Shimoyama T, Kogure J, Yokoyama K, Koshiba T. Secure statistical analysis using RLWE-based homomorphic encryption. In Information Security and Privacy - 20th Australasian Conference, ACISP 2015, Proceedings. Vol. 9144. Springer Verlag. 2015. p. 471-487. (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-19962-7_27
Yasuda, Masaya ; Shimoyama, Takeshi ; Kogure, Jun ; Yokoyama, Kazuhiro ; Koshiba, Takeshi. / Secure statistical analysis using RLWE-based homomorphic encryption. Information Security and Privacy - 20th Australasian Conference, ACISP 2015, Proceedings. Vol. 9144 Springer Verlag, 2015. pp. 471-487 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{101a512bdb6e4319a097c38e5b371cfe,
title = "Secure statistical analysis using RLWE-based homomorphic encryption",
abstract = "Homomorphic encryption enables various calculations while preserving the data confidentiality. Here we apply the homomorphic encryption scheme proposed by Brakerski and Vaikuntanathan (CRYPTO 2011) to secure statistical analysis between two variables. For reduction of ciphertext size and practical performance, we propose a method to pack multiple integers into a few ciphertexts so that it enables efficient computation over the packed ciphertexts. Our packing method is based on Yasuda et al.’s one (DPM 2013). While their method gives efficient secure computation only for small integers, our modification is effective for larger integers. Our implementation shows that our method is faster than the state-of-the-art work. Specifically, for one million integers of 16 bits (resp. 128 bits), it takes about 20 minutes (resp. 3.6 hours) for secure covariance and correlation on an Intel Core i7-3770 3.40 GHz CPU.",
keywords = "Homomorphic encryption, Packing methods, Ring-LWE assumption, Secure covariance and correlation",
author = "Masaya Yasuda and Takeshi Shimoyama and Jun Kogure and Kazuhiro Yokoyama and Takeshi Koshiba",
year = "2015",
doi = "10.1007/978-3-319-19962-7_27",
language = "English",
isbn = "9783319199610",
volume = "9144",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "471--487",
booktitle = "Information Security and Privacy - 20th Australasian Conference, ACISP 2015, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Secure statistical analysis using RLWE-based homomorphic encryption

AU - Yasuda, Masaya

AU - Shimoyama, Takeshi

AU - Kogure, Jun

AU - Yokoyama, Kazuhiro

AU - Koshiba, Takeshi

PY - 2015

Y1 - 2015

N2 - Homomorphic encryption enables various calculations while preserving the data confidentiality. Here we apply the homomorphic encryption scheme proposed by Brakerski and Vaikuntanathan (CRYPTO 2011) to secure statistical analysis between two variables. For reduction of ciphertext size and practical performance, we propose a method to pack multiple integers into a few ciphertexts so that it enables efficient computation over the packed ciphertexts. Our packing method is based on Yasuda et al.’s one (DPM 2013). While their method gives efficient secure computation only for small integers, our modification is effective for larger integers. Our implementation shows that our method is faster than the state-of-the-art work. Specifically, for one million integers of 16 bits (resp. 128 bits), it takes about 20 minutes (resp. 3.6 hours) for secure covariance and correlation on an Intel Core i7-3770 3.40 GHz CPU.

AB - Homomorphic encryption enables various calculations while preserving the data confidentiality. Here we apply the homomorphic encryption scheme proposed by Brakerski and Vaikuntanathan (CRYPTO 2011) to secure statistical analysis between two variables. For reduction of ciphertext size and practical performance, we propose a method to pack multiple integers into a few ciphertexts so that it enables efficient computation over the packed ciphertexts. Our packing method is based on Yasuda et al.’s one (DPM 2013). While their method gives efficient secure computation only for small integers, our modification is effective for larger integers. Our implementation shows that our method is faster than the state-of-the-art work. Specifically, for one million integers of 16 bits (resp. 128 bits), it takes about 20 minutes (resp. 3.6 hours) for secure covariance and correlation on an Intel Core i7-3770 3.40 GHz CPU.

KW - Homomorphic encryption

KW - Packing methods

KW - Ring-LWE assumption

KW - Secure covariance and correlation

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

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

U2 - 10.1007/978-3-319-19962-7_27

DO - 10.1007/978-3-319-19962-7_27

M3 - Conference contribution

SN - 9783319199610

VL - 9144

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

SP - 471

EP - 487

BT - Information Security and Privacy - 20th Australasian Conference, ACISP 2015, Proceedings

PB - Springer Verlag

ER -