Practical Single-Round Secure Wildcard Pattern Matching

Jun Xu, Shengnan Zhao, Chuan Zhao, Zhenxiang Chen, Zhe Liu, Liming Fang

Abstract: 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 server should not learn any information about the pattern or the matching results. Wildcard pattern matching (WPM) problem, a specific variant with more realistic significance, defines that the pattern contains wildcards that can match any character in the text.