Privacy-preserving multi-pattern matching

Abstract

Multi-pattern matching compares a large set of patterns against a given query string, which has wide application in various domains such as bio-informatics and intrusion detection. This paper presents a privacy-preserving multi-pattern matching system which processes an encrypted query string over an encrypted pattern set. Our construction is a symmetric-key system based on Aho-Corasick automaton. The computation complexity is the same as the basic automaton in the base case, and within a multiplicative cost in the length of the longest pattern in general.