5PM: Secure Pattern Matching

DOI10.1007/978-3-642-32928-9_13zbMath1365.68503OpenAlexW1798619551MaRDI QIDQ2912798

Rafail Ostrovsky, Karim Eldefrawy, Joshua Baron, Kirill Minkovich, Eric Tressler

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32928-9_13

zbMATH Keywords

malicious adversaryhomomorphic encryptionsecure two-party computationwildcard pattern matchingsubstring pattern matchingsecure pattern matchingthreshold encryptionfull simulationnon-binary Hamming distance

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Data encryption (aspects in computer science) (68P25) Algorithms on strings (68W32)

Related Items (4)

Automata evaluation and text search protocols with simulation-based security ⋮ Secure parameterized pattern matching ⋮ Efficient and secure outsourced approximate pattern matching protocol ⋮ Computationally secure pattern matching in the presence of malicious adversaries

Uses Software

• SCiFI
• Kangaroo

This page was built for publication: 5PM: Secure Pattern Matching