Approximate pattern matching (APM) measures whether the Hamming distance between
two strings is less than a threshold value. APM has been widely utilized, such as gene …

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 …

Secure pattern matching allows a client who holds a substring (pattern) to find all the
substring's locations appearing in the long string (text) stored in a server. Meanwhile, the …

The computation and communication costs of many secure multiparty protocols would
benefit from a preprocessing that replaces large inputs with much smaller values without …

Multiparty computation refers to a scenario in which multiple distinct yet connected parties
aim to jointly compute a functionality. Over recent decades, with the rapid spread of the …

Secure pattern matching allows a client who holds a substring (pattern) to find all the
substring's locations appearing in the long string (text) stored in a server. Meanwhile, the …