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

15 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
ISBN (Print)9783319083438
DOIs
Publication statusPublished - 2014 Jan 1
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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Privacy-preserving wildcards pattern matching using symmetric somewhat homomorphic encryption'. Together they form a unique fingerprint.

  • 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 (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