# A Simple Obfuscation Scheme for Pattern-Matching with Wildcards

@article{Bishop2018ASO, title={A Simple Obfuscation Scheme for Pattern-Matching with Wildcards}, author={Allison Bishop and Lucas Kowalczyk and Tal Malkin and Valerio Pastro and Mariana Raykova and Kevin Shi}, journal={IACR Cryptol. ePrint Arch.}, year={2018}, volume={2018}, pages={210} }

We give a simple and efficient method for obfuscating pattern matching with wildcards. [... ] Key Method 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. Expand

## 21 Citations

Obfuscating simple functionalities from knowledge assumptions

- Mathematics, Computer ScienceIACR Cryptol. ePrint Arch.
- 2019

This paper gives simpler and stronger security proofs for obfuscation schemes for point functions, general-output point functions and pattern matching with wildcards and shows how to obfuscate several simple functionalities from a new Knowledge of OrthogonALity Assumption (KOALA) in cyclic groups.

Lockable Obfuscation from Circularly Insecure Fully Homomorphic Encryption

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2021

A generic construction of a lockable obfuscation scheme build from a (leveled) fully homomorphic encryption scheme that is circularly insecure, and shows that there is a connection in both ways between circular insecure encryption and lockables obfuscation.

Obfuscation of Big Subsets and Small Supersets as well as Conjunctions

- Mathematics, Computer Science
- 2020

This work obfuscates the big subset and small superset functionalities in a very simple way and gives a proof of input-hiding for the conjunction obfuscation by Bartusek et al. (see Appendix A).

Constrained PRFs for Bit-fixing from OWFs with Constant Collusion Resistance

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2018

This work gives the first construction of a CPRF that can issue a constant number of constrained keys for bit-fixing predicates, only requiring the existence of one-way functions (OWFs), which is a much weaker assumption compared with all previous constructions.

Obfuscating Finite Automata

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2020

A virtual black box and perfect circuit-hiding obfuscator for evasive deterministic finite automata using a matrix encoding scheme with a limited zero-testing algorithm that solves the open problem of obfuscated substring matching.

Towards a Theory of Special-Purpose Program Obfuscation

- Computer Science, Mathematics2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)
- 2020

This paper introduces a new formalism for practical program obfuscation that still allows rigorous security proofs and believes it will make it easier to analyse the security of obfuscation schemes.

Small Superset and Big Subset Obfuscation

- Computer Science, MathematicsACISP
- 2021

This paper obfuscates SSF and BSF in a very simple and efficient way and proves both input-hiding security and virtual black-box (VBB) security based on the subset product problem.

Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2019

A virtual-black-box (VBB) secure and input-hiding obfuscator for fuzzy matching for Hamming distance, based on certain natural number-theoretic computational assumptions, and can be implemented for a much wider range of parameters.

Big Subset and Small Superset Obfuscation

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2020

This paper obfuscates BSF and SSF in a very simple and efficient way, and proves both virtual black-box (VBB) security and input-hiding security in the standard model based on the subset product problem.

Implementing Token-Based Obfuscation under (Ring) LWE

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2018

This work implements read-once branching programs that are significantly more advanced than those implemented by Halevi et al. (ACM CCS 2017), and achieves program evaluation runtimes that are two orders of magnitude smaller.

## References

SHOWING 1-10 OF 33 REFERENCES

Protecting Obfuscation against Algebraic Attacks

- Computer Science, MathematicsEUROCRYPT
- 2014

A simplified variant of this compiler is described, and it is proved that it is a virtual black box obfuscator in a generic multilinear map model under the learning with errors (LWE) hardness assumption.

Zeroizing Attacks on Indistinguishability Obfuscation over CLT13

- Mathematics, Computer SciencePublic Key Cryptography
- 2017

A new polynomial-time attack on the multilinear maps of Coron, Lepoint, and Tibouchi (CLT13), when used in candidate indistinguishability obfuscation (iO) schemes, which shows that almost all single-input variants of iO over CLT13 are insecure.

Cryptanalyses of Candidate Branching Program Obfuscators

- Computer Science, MathematicsEUROCRYPT
- 2016

We describe new cryptanalytic attacks on the candidate branching program obfuscator proposed by Garg, Gentry, Halevi, Raykova, Sahai and Waters (GGHRSW) using the GGH13 graded encoding, and its…

Obfuscation of Hyperplane Membership

- Computer Science, MathematicsTCC
- 2010

This work constructs an obfuscator for a more complex algebraic functionality: testing for membership in a hyperplane (of constant dimension), and proves the security of the obfuscator under a new strong variant of the Decisional Diffie-Hellman assumption.

Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13

- Mathematics, Computer ScienceICALP
- 2017

This work provides a general efficiently-testable property for two single-input branching programs, called partial inequivalence, which it is shown is sufficient for the variant of annihilation attacks on several obfuscation constructions based on GGH13 multilinear maps.

How to Obfuscate Programs Directly

- Computer Science, MathematicsEUROCRYPT
- 2015

The construction operates directly on straight-line programs (arithmetic circuits), rather than converting them to matrix branching programs as in other known approaches, and proves virtual black-box security for the construction in a generic model of multilinear maps of hidden composite order.

On obfuscating point functions

- Mathematics, Computer ScienceSTOC '05
- 2005

This work provides a simple construction of efficient obfuscators for point functions for a slightly relaxed notion of obfuscation, and yields the first non-trivial obfuscator under general assumptions in the standard model.

Secure Obfuscation in a Weak Multilinear Map Model

- Mathematics, Computer ScienceTCC
- 2016

A new iO candidate is given which can be seen as a small modification or generalization of the original candidate of Garg, Gentry, Halevi, Raykova, Sahai, and Waters FOCS'13, and its security is proved in the weak multilinear map model, thus giving the first iO candidates that is provably secure against all known polynomial-time attacks on GGH13.

How to use indistinguishability obfuscation: deniable encryption, and more

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2013

The 16-year-old open question of Deniable Encryption is resolved by giving the first construction of deniable encryption that does not require any pre-planning by the party that must later issue a denial.

Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs

- Mathematics, Computer ScienceCRYPTO
- 2017

This work considers the question of finding the lowest degree L for which L-linear maps suffice to obtain IO, as no polynomial-stretch PRG with locality lower than 5 exists.