Cryptology ePrint Archive: Report 2018/210

A Simple Obfuscation Scheme for Pattern-Matching with Wildcards

Allison Bishop and Lucas Kowalczyk and Tal Malkin and Valerio Pastro and Mariana Raykova and Kevin Shi

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 provided less efficient constructions based on multilinear maps or LWE.

Category / Keywords: obfuscation, generic group, virtual black box

Date: received 17 Feb 2018, last revised 3 Mar 2018

Contact author: luke at cs columbia edu

Available format(s): PDF | BibTeX Citation

Version: 20180303:080042 (All versions of this report)

Short URL: ia.cr/2018/210

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]