Secure pattern matching based on bit parallelism

Secure pattern matching based on bit parallelism 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 fixed-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 finite 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 efficiency, 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 http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Information Security Springer Journals

Secure pattern matching based on bit parallelism

Loading next page...
 
/lp/springer_journal/secure-pattern-matching-based-on-bit-parallelism-QU80F3jckT
Publisher
Springer Journals
Copyright
Copyright © 2018 by Springer-Verlag GmbH Germany, part of Springer Nature
Subject
Computer Science; Data Encryption; Computer Communication Networks; Operating Systems; Coding and Information Theory; Management of Computing and Information Systems; Communications Engineering, Networks
ISSN
1615-5262
eISSN
1615-5270
D.O.I.
10.1007/s10207-018-0410-8
Publisher site
See Article on Publisher Site

Abstract

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 fixed-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 finite 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 efficiency, 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

Journal

International Journal of Information SecuritySpringer Journals

Published: May 30, 2018

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

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

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off