New packing method in somewhat homomorphic encryption and its applications

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

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

Somewhat homomorphic encryption is public key encryption supporting a limited number of additions and multiplications on encrypted data. This encryption gives a powerful tool in performing meaningful computations with protecting data confidentiality, whose property is suitable mainly in cloud computing. In this paper, we focus on the scheme proposed by Brakerski and Vaikuntanathan, and present two types of packed ciphertexts in order to improve performance and reduce size of the encrypted data. One type of our packed ciphertexts is based on the message encoding technique proposed by Lauter, Naehrig and Vaikuntanathan. While their technique empowers efficient secure computation of sums and products over the integers, our second type of packed ciphertexts enables efficient secure computation of more complex functionalities such as multiple inner products and multiple Hamming distances. We apply our packing method to construct several protocols for secure biometric authentication and secure pattern matching computations. Our implementation shows that our method gives faster performance than the state-of-the-art work in such applications.

Original languageEnglish
Pages (from-to)2194-2213
Number of pages20
JournalSecurity and Communication Networks
Volume8
Issue number13
DOIs
Publication statusPublished - 2015 Sep 10
Externally publishedYes

Fingerprint

Cryptography
Hamming distance
Pattern matching
Biometrics
Cloud computing
Authentication

Keywords

  • Multiple Hamming distances
  • Multiple inner products
  • Packing method
  • Somewhat homomorphic encryption

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications

Cite this

New packing method in somewhat homomorphic encryption and its applications. / Yasuda, Masaya; Shimoyama, Takeshi; Kogure, Jun; Yokoyama, Kazuhiro; Koshiba, Takeshi.

In: Security and Communication Networks, Vol. 8, No. 13, 10.09.2015, p. 2194-2213.

Research output: Contribution to journalArticle

Yasuda, Masaya ; Shimoyama, Takeshi ; Kogure, Jun ; Yokoyama, Kazuhiro ; Koshiba, Takeshi. / New packing method in somewhat homomorphic encryption and its applications. In: Security and Communication Networks. 2015 ; Vol. 8, No. 13. pp. 2194-2213.
@article{68e8add44681413dbc1a10f2e5a3538e,
title = "New packing method in somewhat homomorphic encryption and its applications",
abstract = "Somewhat homomorphic encryption is public key encryption supporting a limited number of additions and multiplications on encrypted data. This encryption gives a powerful tool in performing meaningful computations with protecting data confidentiality, whose property is suitable mainly in cloud computing. In this paper, we focus on the scheme proposed by Brakerski and Vaikuntanathan, and present two types of packed ciphertexts in order to improve performance and reduce size of the encrypted data. One type of our packed ciphertexts is based on the message encoding technique proposed by Lauter, Naehrig and Vaikuntanathan. While their technique empowers efficient secure computation of sums and products over the integers, our second type of packed ciphertexts enables efficient secure computation of more complex functionalities such as multiple inner products and multiple Hamming distances. We apply our packing method to construct several protocols for secure biometric authentication and secure pattern matching computations. Our implementation shows that our method gives faster performance than the state-of-the-art work in such applications.",
keywords = "Multiple Hamming distances, Multiple inner products, Packing method, Somewhat homomorphic encryption",
author = "Masaya Yasuda and Takeshi Shimoyama and Jun Kogure and Kazuhiro Yokoyama and Takeshi Koshiba",
year = "2015",
month = "9",
day = "10",
doi = "10.1002/sec.1164",
language = "English",
volume = "8",
pages = "2194--2213",
journal = "Security and Communication Networks",
issn = "1939-0114",
publisher = "John Wiley and Sons Inc.",
number = "13",

}

TY - JOUR

T1 - New packing method in somewhat homomorphic encryption and its applications

AU - Yasuda, Masaya

AU - Shimoyama, Takeshi

AU - Kogure, Jun

AU - Yokoyama, Kazuhiro

AU - Koshiba, Takeshi

PY - 2015/9/10

Y1 - 2015/9/10

N2 - Somewhat homomorphic encryption is public key encryption supporting a limited number of additions and multiplications on encrypted data. This encryption gives a powerful tool in performing meaningful computations with protecting data confidentiality, whose property is suitable mainly in cloud computing. In this paper, we focus on the scheme proposed by Brakerski and Vaikuntanathan, and present two types of packed ciphertexts in order to improve performance and reduce size of the encrypted data. One type of our packed ciphertexts is based on the message encoding technique proposed by Lauter, Naehrig and Vaikuntanathan. While their technique empowers efficient secure computation of sums and products over the integers, our second type of packed ciphertexts enables efficient secure computation of more complex functionalities such as multiple inner products and multiple Hamming distances. We apply our packing method to construct several protocols for secure biometric authentication and secure pattern matching computations. Our implementation shows that our method gives faster performance than the state-of-the-art work in such applications.

AB - Somewhat homomorphic encryption is public key encryption supporting a limited number of additions and multiplications on encrypted data. This encryption gives a powerful tool in performing meaningful computations with protecting data confidentiality, whose property is suitable mainly in cloud computing. In this paper, we focus on the scheme proposed by Brakerski and Vaikuntanathan, and present two types of packed ciphertexts in order to improve performance and reduce size of the encrypted data. One type of our packed ciphertexts is based on the message encoding technique proposed by Lauter, Naehrig and Vaikuntanathan. While their technique empowers efficient secure computation of sums and products over the integers, our second type of packed ciphertexts enables efficient secure computation of more complex functionalities such as multiple inner products and multiple Hamming distances. We apply our packing method to construct several protocols for secure biometric authentication and secure pattern matching computations. Our implementation shows that our method gives faster performance than the state-of-the-art work in such applications.

KW - Multiple Hamming distances

KW - Multiple inner products

KW - Packing method

KW - Somewhat homomorphic encryption

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

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

U2 - 10.1002/sec.1164

DO - 10.1002/sec.1164

M3 - Article

VL - 8

SP - 2194

EP - 2213

JO - Security and Communication Networks

JF - Security and Communication Networks

SN - 1939-0114

IS - 13

ER -