An enhancement of privacy-preserving wildcards pattern matching

Tushar Kanti Saha, Takeshi Koshiba

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

7 Citations (Scopus)

Abstract

We consider secure pattern matching for some alphabet set, where gaps are represented by the character ‘*’. Generally, we know that a wildcard character ‘*’ in the pattern is used to replace zero or more letters in the text. Yasuda et al. (ACISP 2014) proposed a new packing method for somewhat homomorphic encryption for handling wildcards pattern where the wildcards replace one letter in the text. We extend the secure pattern matching so that the wildcards are replaced with any sequences. We propose a method for privacy-preserving wildcards pattern matching using somewhat homomorphic encryption in the semi-honest model. At the same time, we also propose another packing method for executing homomorphic operations between plaintext and encrypted wildcards pattern in three homomorphic multiplications rather than 3k multiplications required by Yasuda et al. method to handle k sub-patterns. Moreover, we have been able to improve the communication complexity of Yasuda et al. method by a factor k denoting the total number of sub-patterns appearing in the pattern. In addition, our practical implementation shows that our method is about k-times faster than that of Yasuda et al. Here, we show some applications of our packing method to computing secure Hamming and Euclidean distances.

Original languageEnglish
Title of host publicationFoundations and Practice of Security - 9th International Symposium, FPS 2016, Revised Selected Papers
PublisherSpringer Verlag
Pages145-160
Number of pages16
Volume10128 LNCS
ISBN (Print)9783319519654
DOIs
Publication statusPublished - 2017
Externally publishedYes
Event9th International Symposium on Foundations and Practice of Security, FPS 2016 - Quebec, Canada
Duration: 2016 Oct 242016 Oct 26

Publication series

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

Other

Other9th International Symposium on Foundations and Practice of Security, FPS 2016
CountryCanada
CityQuebec
Period16/10/2416/10/26

Fingerprint

Pattern matching
Privacy Preserving
Pattern Matching
Enhancement
Cryptography
Packing
Homomorphic Encryption
Homomorphic
Multiplication
Communication
Communication Complexity
Hamming Distance
Euclidean Distance
Computing
Zero

Keywords

  • Bioinformatics
  • Biometrics
  • Hamming and euclidean distances
  • Pattern matching computation
  • Privacy-preserving
  • Repetitive-wildcards
  • Somewhat homomorphic encryption

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Saha, T. K., & Koshiba, T. (2017). An enhancement of privacy-preserving wildcards pattern matching. In Foundations and Practice of Security - 9th International Symposium, FPS 2016, Revised Selected Papers (Vol. 10128 LNCS, pp. 145-160). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10128 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-51966-1_10

An enhancement of privacy-preserving wildcards pattern matching. / Saha, Tushar Kanti; Koshiba, Takeshi.

Foundations and Practice of Security - 9th International Symposium, FPS 2016, Revised Selected Papers. Vol. 10128 LNCS Springer Verlag, 2017. p. 145-160 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10128 LNCS).

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

Saha, TK & Koshiba, T 2017, An enhancement of privacy-preserving wildcards pattern matching. in Foundations and Practice of Security - 9th International Symposium, FPS 2016, Revised Selected Papers. vol. 10128 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10128 LNCS, Springer Verlag, pp. 145-160, 9th International Symposium on Foundations and Practice of Security, FPS 2016, Quebec, Canada, 16/10/24. https://doi.org/10.1007/978-3-319-51966-1_10
Saha TK, Koshiba T. An enhancement of privacy-preserving wildcards pattern matching. In Foundations and Practice of Security - 9th International Symposium, FPS 2016, Revised Selected Papers. Vol. 10128 LNCS. Springer Verlag. 2017. p. 145-160. (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-51966-1_10
Saha, Tushar Kanti ; Koshiba, Takeshi. / An enhancement of privacy-preserving wildcards pattern matching. Foundations and Practice of Security - 9th International Symposium, FPS 2016, Revised Selected Papers. Vol. 10128 LNCS Springer Verlag, 2017. pp. 145-160 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{219e7af904af40dd953ede290622f3cf,
title = "An enhancement of privacy-preserving wildcards pattern matching",
abstract = "We consider secure pattern matching for some alphabet set, where gaps are represented by the character ‘*’. Generally, we know that a wildcard character ‘*’ in the pattern is used to replace zero or more letters in the text. Yasuda et al. (ACISP 2014) proposed a new packing method for somewhat homomorphic encryption for handling wildcards pattern where the wildcards replace one letter in the text. We extend the secure pattern matching so that the wildcards are replaced with any sequences. We propose a method for privacy-preserving wildcards pattern matching using somewhat homomorphic encryption in the semi-honest model. At the same time, we also propose another packing method for executing homomorphic operations between plaintext and encrypted wildcards pattern in three homomorphic multiplications rather than 3k multiplications required by Yasuda et al. method to handle k sub-patterns. Moreover, we have been able to improve the communication complexity of Yasuda et al. method by a factor k denoting the total number of sub-patterns appearing in the pattern. In addition, our practical implementation shows that our method is about k-times faster than that of Yasuda et al. Here, we show some applications of our packing method to computing secure Hamming and Euclidean distances.",
keywords = "Bioinformatics, Biometrics, Hamming and euclidean distances, Pattern matching computation, Privacy-preserving, Repetitive-wildcards, Somewhat homomorphic encryption",
author = "Saha, {Tushar Kanti} and Takeshi Koshiba",
year = "2017",
doi = "10.1007/978-3-319-51966-1_10",
language = "English",
isbn = "9783319519654",
volume = "10128 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "145--160",
booktitle = "Foundations and Practice of Security - 9th International Symposium, FPS 2016, Revised Selected Papers",
address = "Germany",

}

TY - GEN

T1 - An enhancement of privacy-preserving wildcards pattern matching

AU - Saha, Tushar Kanti

AU - Koshiba, Takeshi

PY - 2017

Y1 - 2017

N2 - We consider secure pattern matching for some alphabet set, where gaps are represented by the character ‘*’. Generally, we know that a wildcard character ‘*’ in the pattern is used to replace zero or more letters in the text. Yasuda et al. (ACISP 2014) proposed a new packing method for somewhat homomorphic encryption for handling wildcards pattern where the wildcards replace one letter in the text. We extend the secure pattern matching so that the wildcards are replaced with any sequences. We propose a method for privacy-preserving wildcards pattern matching using somewhat homomorphic encryption in the semi-honest model. At the same time, we also propose another packing method for executing homomorphic operations between plaintext and encrypted wildcards pattern in three homomorphic multiplications rather than 3k multiplications required by Yasuda et al. method to handle k sub-patterns. Moreover, we have been able to improve the communication complexity of Yasuda et al. method by a factor k denoting the total number of sub-patterns appearing in the pattern. In addition, our practical implementation shows that our method is about k-times faster than that of Yasuda et al. Here, we show some applications of our packing method to computing secure Hamming and Euclidean distances.

AB - We consider secure pattern matching for some alphabet set, where gaps are represented by the character ‘*’. Generally, we know that a wildcard character ‘*’ in the pattern is used to replace zero or more letters in the text. Yasuda et al. (ACISP 2014) proposed a new packing method for somewhat homomorphic encryption for handling wildcards pattern where the wildcards replace one letter in the text. We extend the secure pattern matching so that the wildcards are replaced with any sequences. We propose a method for privacy-preserving wildcards pattern matching using somewhat homomorphic encryption in the semi-honest model. At the same time, we also propose another packing method for executing homomorphic operations between plaintext and encrypted wildcards pattern in three homomorphic multiplications rather than 3k multiplications required by Yasuda et al. method to handle k sub-patterns. Moreover, we have been able to improve the communication complexity of Yasuda et al. method by a factor k denoting the total number of sub-patterns appearing in the pattern. In addition, our practical implementation shows that our method is about k-times faster than that of Yasuda et al. Here, we show some applications of our packing method to computing secure Hamming and Euclidean distances.

KW - Bioinformatics

KW - Biometrics

KW - Hamming and euclidean distances

KW - Pattern matching computation

KW - Privacy-preserving

KW - Repetitive-wildcards

KW - Somewhat homomorphic encryption

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

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

U2 - 10.1007/978-3-319-51966-1_10

DO - 10.1007/978-3-319-51966-1_10

M3 - Conference contribution

AN - SCOPUS:85009508248

SN - 9783319519654

VL - 10128 LNCS

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

SP - 145

EP - 160

BT - Foundations and Practice of Security - 9th International Symposium, FPS 2016, Revised Selected Papers

PB - Springer Verlag

ER -