A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A Simple Obfuscation Scheme for Pattern-Matching with Wildcards
[chapter]
2018
Lecture Notes in Computer Science
We give a simple and efficient method for obfuscating pattern matching with wildcards. In other words, we construct a way to check an input against a secret pattern, which is described in terms of prescribed values interspersed with unconstrained "wildcard" slots. As long as the support of the pattern is sufficiently sparse and the pattern itself is chosen from an appropriate distribution, we prove that a polynomial-time adversary cannot find a matching input, except with negligible
doi:10.1007/978-3-319-96878-0_25
fatcat:tczme4ininaj7bqgovnbsbxo2i