In this paper, we consider the problem of secure pattern matching that uses evaluation of non-deterministic string matching automata (NSMA). Our solution is based on a class of hardware-based pattern matching algorithms called bit-parallel pattern matching, which simulates the behavior of NSMAs. The properties of this class of algorithms allow our constructions to handle any ﬁxed-length pattern in a non-interactive way with only two rounds of communication. Our secure protocol is able to handle the Hamming distance computation and substring and subpattern matching for any ﬁnite alphabet. It is also possible to use this protocol for keyword, text, and live text search. Security of our protocol is proved in the semi-honest model. Then, in order to strengthen security of the solution and retain its efﬁciency, we design a variant of the protocol which is proved to be secure with one-sided simulation in the malicious model. As a proof of concept, we also present another protocol that shows how our basic idea can be extended to other scenarios of pattern matching such as secure computation outsourcing. Keywords Secure pattern matching · Two-party computation · Outsourcing · Keyword search · Text search · Bit-parallel pattern matching 1 Introduction ities that requires
International Journal of Information Security – Springer Journals
Published: May 30, 2018
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud