Background
Type: Conference Paper

Secure Parameterized Multi-Pattern Matching in Multi-Text Owner Setting

Journal: ()Year: 2021Volume: Issue: Pages: 6 - 12
Zarezadeh M.Mala H.a

Abstract

The parameterized pattern matching (PPM) problem is seeking occurrences of one string in another, where both strings are given from two parameter and constant alphabet sets. In this matching paradigm, a consistent renaming of symbols from the parameter alphabet is allowed. The parameterized pattern matching is useful in problems in software engineering, computational biology, and other applications. In this paper, for the first time, we consider the problem of secure parameterized multi-pattern matching (SPMPM) that an owner of a set of patterns allows matching of his/her patterns against the text while pattern owner only learns matching results and the text owner learns nothing. In our setting, a pattern owner can find the matching locations in multiple texts in a privacy-preserving manner. The server only performs operations over encrypted values and cannot obtain any information about the text or the patterns. The proposed scheme is efficient for the pattern owner and every text owner. We prove the security of our scheme via the simulation-based paradigm. © 2021 IEEE.