Name
Abstract | ||
|---|---|---|
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 probability. We rely upon the generic group heuristic (in a regular group, with no multilinearity). Previous work [9,10,32] provided less efficient constructions based on multilinear maps or LWE. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-319-96878-0_25 | ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT III |
DocType | Volume | ISSN |
Conference | 10993 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 24 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Allison B. Lewko | 1 | 1701 | 47.84 |
| Lucas Kowalczyk | 2 | 44 | 4.97 |
| Tal G. Malkin | 3 | 2633 | 152.56 |
| Valerio Pastro | 4 | 455 | 14.12 |
| Mariana Raykova | 5 | 1781 | 63.97 |
| Shi, Kevin | 6 | 4 | 2.54 |