A simple obfuscation scheme for pattern-matching with wildcards

DOI10.1007/978-3-319-96878-0_25MaRDI QIDQ776020zbMATH OpenOpenAlexFDO

Authors Allison Bishop, L. Kowalczyk, Tal Malkin, Valerio Pastro, Mariana Raykova, Kevin Shi

Publication date 30 June 2020

Full work available at URL https://doi.org/10.1007/978-3-319-96878-0_25

zbMATH Keywords

conjunction functionsmultilinear mapsobfuscating

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption
• Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer
• Secure parameterized pattern matching
• Pattern matching on encrypted streams
• SWiM: secure wildcard pattern matching from OT extension
• Pattern matching with arbitrary-length wildcards
• On the average-case complexity of pattern matching with wildcards
• Privacy-preserving pattern matching on encrypted data
• Simple deterministic wildcard matching

Cited in

(9)

• Obfuscated fuzzy Hamming distance and conjunctions from subset product problems
• Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption
• Lockable obfuscation from circularly insecure fully homomorphic encryption
• Nonmalleable digital lockers and robust fuzzy extractors in the plain model
• Small Superset and Big Subset Obfuscation
• Obfuscating evasive decision trees
• Multivariate exponential equations with unknown coefficients
• Obfuscation of evasive algebraic set membership
• Obfuscating finite automata

This page was built for publication: A simple obfuscation scheme for pattern-matching with wildcards

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q776020)