Efficient and secure pattern matching with wildcards using lightweight cryptography.

•A sub-quadratic algorithm to solve the pattern matching problem is proposed.•The algorithm relies on fast convolution computations.•The algorithm has multiple substantiations based on the chosen arithmetic domain.•The perfectly secure protocols use only lightweight cryptographic primitives.•Secure protocols are obtained in the semi-honest model, and by using a helper server.