Privacy-preserving wildcards pattern matching using symmetric somewhat homomorphic encryption

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

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

8 Citations (Scopus)

Abstract

The basic pattern matching problem is to find the locations where a pattern occurs in a text. We give several computations enabling a client to obtain matching results from a database so that the database can not learn any information about client's queried pattern. For such computations, we apply the symmetric-key variant scheme of somewhat homomorphic encryption proposed by Brakerski and Vaikuntanathan (CRYPTO 2011), which can support a limited number of both polynomial additions and multiplications on encrypted data. We also utilize the packing method introduced by Yasuda et al. (CCSW 2013) for efficiency. While they deal with only basic problems for binary vectors, we address more complex problems such as the approximate and wildcards pattern matching for non-binary vectors. To demonstrate the efficiency of our method, we implemented the encryption scheme for secure wildcards pattern matching of DNA sequences. Our implementation shows that a client can privately search real-world genomes of length 16,500 in under one second on a general-purpose PC.

Original languageEnglish
Title of host publicationInformation Security and Privacy - 19th Australasian Conference, ACISP 2014, Proceedings
PublisherSpringer Verlag
Pages338-353
Number of pages16
Volume8544 LNCS
ISBN (Print)9783319083438
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event19th Australasian Conference on Information Security and Privacy, ACISP 2014 - Wollongong, NSW, Australia
Duration: 2014 Jul 72014 Jul 9

Publication series

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

Other

Other19th Australasian Conference on Information Security and Privacy, ACISP 2014
CountryAustralia
CityWollongong, NSW
Period14/7/714/7/9

Fingerprint

Homomorphic Encryption
Pattern matching
Privacy Preserving
Pattern Matching
Cryptography
DNA sequences
Matching Problem
DNA Sequence
Encryption
Packing
Multiplication
Genome
Genes
Polynomials
Binary
Polynomial
Demonstrate

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yasuda, M., Shimoyama, T., Kogure, J., Yokoyama, K., & Koshiba, T. (2014). Privacy-preserving wildcards pattern matching using symmetric somewhat homomorphic encryption. In Information Security and Privacy - 19th Australasian Conference, ACISP 2014, Proceedings (Vol. 8544 LNCS, pp. 338-353). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8544 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-08344-5_22

Privacy-preserving wildcards pattern matching using symmetric somewhat homomorphic encryption. / Yasuda, Masaya; Shimoyama, Takeshi; Kogure, Jun; Yokoyama, Kazuhiro; Koshiba, Takeshi.

Information Security and Privacy - 19th Australasian Conference, ACISP 2014, Proceedings. Vol. 8544 LNCS Springer Verlag, 2014. p. 338-353 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8544 LNCS).

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

Yasuda, M, Shimoyama, T, Kogure, J, Yokoyama, K & Koshiba, T 2014, Privacy-preserving wildcards pattern matching using symmetric somewhat homomorphic encryption. in Information Security and Privacy - 19th Australasian Conference, ACISP 2014, Proceedings. vol. 8544 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8544 LNCS, Springer Verlag, pp. 338-353, 19th Australasian Conference on Information Security and Privacy, ACISP 2014, Wollongong, NSW, Australia, 14/7/7. https://doi.org/10.1007/978-3-319-08344-5_22
Yasuda M, Shimoyama T, Kogure J, Yokoyama K, Koshiba T. Privacy-preserving wildcards pattern matching using symmetric somewhat homomorphic encryption. In Information Security and Privacy - 19th Australasian Conference, ACISP 2014, Proceedings. Vol. 8544 LNCS. Springer Verlag. 2014. p. 338-353. (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-08344-5_22
Yasuda, Masaya ; Shimoyama, Takeshi ; Kogure, Jun ; Yokoyama, Kazuhiro ; Koshiba, Takeshi. / Privacy-preserving wildcards pattern matching using symmetric somewhat homomorphic encryption. Information Security and Privacy - 19th Australasian Conference, ACISP 2014, Proceedings. Vol. 8544 LNCS Springer Verlag, 2014. pp. 338-353 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{80a4be3ee2974cfb9e5b9d08c77339f5,
title = "Privacy-preserving wildcards pattern matching using symmetric somewhat homomorphic encryption",
abstract = "The basic pattern matching problem is to find the locations where a pattern occurs in a text. We give several computations enabling a client to obtain matching results from a database so that the database can not learn any information about client's queried pattern. For such computations, we apply the symmetric-key variant scheme of somewhat homomorphic encryption proposed by Brakerski and Vaikuntanathan (CRYPTO 2011), which can support a limited number of both polynomial additions and multiplications on encrypted data. We also utilize the packing method introduced by Yasuda et al. (CCSW 2013) for efficiency. While they deal with only basic problems for binary vectors, we address more complex problems such as the approximate and wildcards pattern matching for non-binary vectors. To demonstrate the efficiency of our method, we implemented the encryption scheme for secure wildcards pattern matching of DNA sequences. Our implementation shows that a client can privately search real-world genomes of length 16,500 in under one second on a general-purpose PC.",
author = "Masaya Yasuda and Takeshi Shimoyama and Jun Kogure and Kazuhiro Yokoyama and Takeshi Koshiba",
year = "2014",
doi = "10.1007/978-3-319-08344-5_22",
language = "English",
isbn = "9783319083438",
volume = "8544 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "338--353",
booktitle = "Information Security and Privacy - 19th Australasian Conference, ACISP 2014, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Privacy-preserving wildcards pattern matching using symmetric somewhat homomorphic encryption

AU - Yasuda, Masaya

AU - Shimoyama, Takeshi

AU - Kogure, Jun

AU - Yokoyama, Kazuhiro

AU - Koshiba, Takeshi

PY - 2014

Y1 - 2014

N2 - The basic pattern matching problem is to find the locations where a pattern occurs in a text. We give several computations enabling a client to obtain matching results from a database so that the database can not learn any information about client's queried pattern. For such computations, we apply the symmetric-key variant scheme of somewhat homomorphic encryption proposed by Brakerski and Vaikuntanathan (CRYPTO 2011), which can support a limited number of both polynomial additions and multiplications on encrypted data. We also utilize the packing method introduced by Yasuda et al. (CCSW 2013) for efficiency. While they deal with only basic problems for binary vectors, we address more complex problems such as the approximate and wildcards pattern matching for non-binary vectors. To demonstrate the efficiency of our method, we implemented the encryption scheme for secure wildcards pattern matching of DNA sequences. Our implementation shows that a client can privately search real-world genomes of length 16,500 in under one second on a general-purpose PC.

AB - The basic pattern matching problem is to find the locations where a pattern occurs in a text. We give several computations enabling a client to obtain matching results from a database so that the database can not learn any information about client's queried pattern. For such computations, we apply the symmetric-key variant scheme of somewhat homomorphic encryption proposed by Brakerski and Vaikuntanathan (CRYPTO 2011), which can support a limited number of both polynomial additions and multiplications on encrypted data. We also utilize the packing method introduced by Yasuda et al. (CCSW 2013) for efficiency. While they deal with only basic problems for binary vectors, we address more complex problems such as the approximate and wildcards pattern matching for non-binary vectors. To demonstrate the efficiency of our method, we implemented the encryption scheme for secure wildcards pattern matching of DNA sequences. Our implementation shows that a client can privately search real-world genomes of length 16,500 in under one second on a general-purpose PC.

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

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

U2 - 10.1007/978-3-319-08344-5_22

DO - 10.1007/978-3-319-08344-5_22

M3 - Conference contribution

AN - SCOPUS:84904200577

SN - 9783319083438

VL - 8544 LNCS

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

SP - 338

EP - 353

BT - Information Security and Privacy - 19th Australasian Conference, ACISP 2014, Proceedings

PB - Springer Verlag

ER -