Secure pattern matching using somewhat homomorphic encryption

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

研究成果: Conference contribution

53 引用 (Scopus)

抜粋

The basic pattern matching problem is to find the locations where a pattern occurs in a text. Recently, secure pattern matching has been received much attention in various areas, including privacy-preserving DNA matching and secure biometric authentication. The aim of this paper is to give a practical solution for this problem using homomorphic encryption, which is public key encryption supporting some operations on encrypted data. In this paper, we make use of the somewhat homomorphic encryption scheme presented by Lauter, Naehrig and Vaikuntanathan (ACM CCSW 2011), which supports a limited number of both additions and multiplications on encrypted data. In their work, some message encoding techniques are also presented for enabling us to efficiently compute sums and products over the integers. Based on their techniques, we propose a new packing method suitable for an efficient computation of multiple Hamming distance values on encrypted data. Our main extension gives two types of packed ciphertexts, and a linear computation over packed ciphertexts gives our desired results. We implemented the scheme with our packing method. Our experiments ran in an Intel Xeon at 3.07 GHz with our software library using inline assembly language in C programs. Our optimized implementation shows that the packed encryption of a text or a pattern, the computation of multiple Hamming distance values over packed ciphertexts, and the decryption respectively take about 3.65 milliseconds (ms), 5.31 ms, and 3.47 ms for secure exact and approximate pattern matching of a binary text of length 2048. The total time is about 12.43 ms, which would give the practical performance in real life. Our method gives both faster performance and lower communication than the state-of-the-art work for a binary text of several thousand bits in length.

元の言語English
ホスト出版物のタイトルCCSW 2013 - Proceedings of the 2013 ACM Cloud Computing Security Workshop, Co-located with CCS 2013
ページ65-76
ページ数12
DOI
出版物ステータスPublished - 2013 12 9
外部発表Yes
イベント2013 ACM Cloud Computing Security Workshop, CCSW 2013 - Co-located with the 20th ACM Conference on Computer and Communications Security, CCS 2013 - Berlin, Germany
継続期間: 2013 11 82013 11 8

出版物シリーズ

名前Proceedings of the ACM Conference on Computer and Communications Security
ISSN(印刷物)1543-7221

Other

Other2013 ACM Cloud Computing Security Workshop, CCSW 2013 - Co-located with the 20th ACM Conference on Computer and Communications Security, CCS 2013
Germany
Berlin
期間13/11/813/11/8

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications

フィンガープリント Secure pattern matching using somewhat homomorphic encryption' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Yasuda, M., Shimoyama, T., Kogure, J., Yokoyama, K., & Koshiba, T. (2013). Secure pattern matching using somewhat homomorphic encryption. : CCSW 2013 - Proceedings of the 2013 ACM Cloud Computing Security Workshop, Co-located with CCS 2013 (pp. 65-76). (Proceedings of the ACM Conference on Computer and Communications Security). https://doi.org/10.1145/2517488.2517497