Pattern matching on encrypted streams

DOI10.1007/978-3-030-03326-2_5MaRDI QIDQ1633445zbMATH OpenOpenAlexFDO

Authors Nicolas Desmoulins, Pierre-Alain Fouque, Cristina Onete, Olivier Sanders

Publication date 20 December 2018

Full work available at URL https://doi.org/10.1007/978-3-030-03326-2_5

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Cryptography (94A60)

Recommendations

• Public Key Encryption with Flexible Pattern Matching
• Privacy-preserving pattern matching on encrypted data
• Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption
• SWiM: secure wildcard pattern matching from OT extension
• 5PM: secure pattern matching

Cites work

• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
• 4-round resettably-sound zero knowledge
• Advances in Cryptology – CRYPTO 2004
• Bit commitment using pseudorandomness
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
• Definitions and properties of zero-knowledge proof systems
• Efficient non-interactive secure computation
• Founding Cryptography on Tamper-Proof Hardware Tokens
• From stateful hardware to resettable hardware using symmetric assumptions
• New Constructions for UC Secure Computation Using Tamper-Proof Hardware
• Non-black-box simulation from one-way functions and applications to resettable security
• Non-black-box simulation from one-way functions and applications to resettable security
• Non-interactive secure 2PC in the offline/online and batch settings
• Non-interactive secure computation based on cut-and-choose
• On non-black-box simulation and the impossibility of approximate obfuscation
• On the impossibility of approximate obfuscation and applications to resettable cryptography
• One-Time Programs
• Optimal Pairings
• Resettable zero-knowledge (extended abstract)
• The Knowledge Complexity of Interactive Proof Systems
• Truly efficient string oblivious transfer using resettable tamper-proof tokens
• Two-message witness indistinguishability and secure computation in the plain model from new assumptions
• Unconditional and composable security using a single stateful Tamper-proof hardware token
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Universally Composable Security with Global Setup

Cited in

(9)

• Obfuscating finite automata
• Privacy-preserving pattern matching on encrypted data
• A comparative study of dictionary matching with gaps: limitations, techniques and challenges
• Online parameterized dictionary matching with one gap
• Public Key Encryption with Flexible Pattern Matching
• Pattern matching in encrypted stream from inner product encryption
• Privacy-preserving plaintext-equality of low-entropy inputs
• Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption
• A simple obfuscation scheme for pattern-matching with wildcards

This page was built for publication: Pattern matching on encrypted streams

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