Practical packing method in somewhat homomorphic encryption

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

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

26 Citations (Scopus)

Abstract

Somewhat homomorphic encryption is public key encryption supporting a limited number of both additions and multiplications on encrypted data, which is useful for performing fundamental computations with protecting the data confidentiality. In this paper, we focus on the scheme proposed by Lauter, Naehrig and Vaikuntanathan (ACM CCSW 2011), and present two types of packed ciphertexts based on their packing technique. Combinations of two types of our packing method give practical size and performance for wider computations such as statistical analysis and distances. To demonstrate its efficiency, we implemented the scheme with our packing method for secure Hamming distance, which is often used in privacy-preserving biometrics. For secure Hamming distance between two binary vekoshiba@mail.saitama-u.ac.jpctors of 2048-bit, it takes 5.31 ms on an Intel Xeon X3480 at 3.07 GHz. This gives the best performance in the state-of-the-art work using homomorphic encryption.

Original languageEnglish
Title of host publicationData Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers
PublisherSpringer Verlag
Pages34-50
Number of pages17
Volume8247 LNCS
ISBN (Print)9783642545672
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event8th International Workshop on Data Privacy Management, DPM 2013 and 6th International Workshop on Autonomous and Spontaneous Security, SETOP 2013 - Egham, United Kingdom
Duration: 2013 Sep 122013 Sep 13

Publication series

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

Other

Other8th International Workshop on Data Privacy Management, DPM 2013 and 6th International Workshop on Autonomous and Spontaneous Security, SETOP 2013
CountryUnited Kingdom
CityEgham
Period13/9/1213/9/13

Fingerprint

Homomorphic Encryption
Packing
Cryptography
Hamming distance
Hamming Distance
Public Key Encryption
Privacy Preserving
Confidentiality
Biometrics
Statistical Analysis
Statistical methods
Multiplication
Binary
Demonstrate

Keywords

  • Packed ciphertexts
  • Ring-LWE assumption
  • Secure Hamming distance
  • Somewhat homomorphic encryption

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yasuda, M., Shimoyama, T., Kogure, J., Yokoyama, K., & Koshiba, T. (2014). Practical packing method in somewhat homomorphic encryption. In Data Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers (Vol. 8247 LNCS, pp. 34-50). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8247 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-54568-9_3

Practical packing method in somewhat homomorphic encryption. / Yasuda, Masaya; Shimoyama, Takeshi; Kogure, Jun; Yokoyama, Kazuhiro; Koshiba, Takeshi.

Data Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers. Vol. 8247 LNCS Springer Verlag, 2014. p. 34-50 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8247 LNCS).

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

Yasuda, M, Shimoyama, T, Kogure, J, Yokoyama, K & Koshiba, T 2014, Practical packing method in somewhat homomorphic encryption. in Data Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers. vol. 8247 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8247 LNCS, Springer Verlag, pp. 34-50, 8th International Workshop on Data Privacy Management, DPM 2013 and 6th International Workshop on Autonomous and Spontaneous Security, SETOP 2013, Egham, United Kingdom, 13/9/12. https://doi.org/10.1007/978-3-642-54568-9_3
Yasuda M, Shimoyama T, Kogure J, Yokoyama K, Koshiba T. Practical packing method in somewhat homomorphic encryption. In Data Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers. Vol. 8247 LNCS. Springer Verlag. 2014. p. 34-50. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-54568-9_3
Yasuda, Masaya ; Shimoyama, Takeshi ; Kogure, Jun ; Yokoyama, Kazuhiro ; Koshiba, Takeshi. / Practical packing method in somewhat homomorphic encryption. Data Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers. Vol. 8247 LNCS Springer Verlag, 2014. pp. 34-50 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{37c3112764684086b1091f6586a8417d,
title = "Practical packing method in somewhat homomorphic encryption",
abstract = "Somewhat homomorphic encryption is public key encryption supporting a limited number of both additions and multiplications on encrypted data, which is useful for performing fundamental computations with protecting the data confidentiality. In this paper, we focus on the scheme proposed by Lauter, Naehrig and Vaikuntanathan (ACM CCSW 2011), and present two types of packed ciphertexts based on their packing technique. Combinations of two types of our packing method give practical size and performance for wider computations such as statistical analysis and distances. To demonstrate its efficiency, we implemented the scheme with our packing method for secure Hamming distance, which is often used in privacy-preserving biometrics. For secure Hamming distance between two binary vekoshiba@mail.saitama-u.ac.jpctors of 2048-bit, it takes 5.31 ms on an Intel Xeon X3480 at 3.07 GHz. This gives the best performance in the state-of-the-art work using homomorphic encryption.",
keywords = "Packed ciphertexts, Ring-LWE assumption, Secure Hamming distance, Somewhat homomorphic encryption",
author = "Masaya Yasuda and Takeshi Shimoyama and Jun Kogure and Kazuhiro Yokoyama and Takeshi Koshiba",
year = "2014",
doi = "10.1007/978-3-642-54568-9_3",
language = "English",
isbn = "9783642545672",
volume = "8247 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "34--50",
booktitle = "Data Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers",
address = "Germany",

}

TY - GEN

T1 - Practical packing method in somewhat homomorphic encryption

AU - Yasuda, Masaya

AU - Shimoyama, Takeshi

AU - Kogure, Jun

AU - Yokoyama, Kazuhiro

AU - Koshiba, Takeshi

PY - 2014

Y1 - 2014

N2 - Somewhat homomorphic encryption is public key encryption supporting a limited number of both additions and multiplications on encrypted data, which is useful for performing fundamental computations with protecting the data confidentiality. In this paper, we focus on the scheme proposed by Lauter, Naehrig and Vaikuntanathan (ACM CCSW 2011), and present two types of packed ciphertexts based on their packing technique. Combinations of two types of our packing method give practical size and performance for wider computations such as statistical analysis and distances. To demonstrate its efficiency, we implemented the scheme with our packing method for secure Hamming distance, which is often used in privacy-preserving biometrics. For secure Hamming distance between two binary vekoshiba@mail.saitama-u.ac.jpctors of 2048-bit, it takes 5.31 ms on an Intel Xeon X3480 at 3.07 GHz. This gives the best performance in the state-of-the-art work using homomorphic encryption.

AB - Somewhat homomorphic encryption is public key encryption supporting a limited number of both additions and multiplications on encrypted data, which is useful for performing fundamental computations with protecting the data confidentiality. In this paper, we focus on the scheme proposed by Lauter, Naehrig and Vaikuntanathan (ACM CCSW 2011), and present two types of packed ciphertexts based on their packing technique. Combinations of two types of our packing method give practical size and performance for wider computations such as statistical analysis and distances. To demonstrate its efficiency, we implemented the scheme with our packing method for secure Hamming distance, which is often used in privacy-preserving biometrics. For secure Hamming distance between two binary vekoshiba@mail.saitama-u.ac.jpctors of 2048-bit, it takes 5.31 ms on an Intel Xeon X3480 at 3.07 GHz. This gives the best performance in the state-of-the-art work using homomorphic encryption.

KW - Packed ciphertexts

KW - Ring-LWE assumption

KW - Secure Hamming distance

KW - Somewhat homomorphic encryption

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

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

U2 - 10.1007/978-3-642-54568-9_3

DO - 10.1007/978-3-642-54568-9_3

M3 - Conference contribution

SN - 9783642545672

VL - 8247 LNCS

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

SP - 34

EP - 50

BT - Data Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers

PB - Springer Verlag

ER -