Pattern matching on encrypted streams
From MaRDI portal
Publication:1633445
DOI10.1007/978-3-030-03326-2_5zbMATH Open1446.94125OpenAlexW2898195193MaRDI QIDQ1633445FDOQ1633445
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
Recommendations
Cites Work
- Bit commitment using pseudorandomness
- Resettable zero-knowledge (extended abstract)
- 4-round resettably-sound zero knowledge
- Optimal Pairings
- Definitions and properties of zero-knowledge proof systems
- The Knowledge Complexity of Interactive Proof Systems
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Universally Composable Security with Global Setup
- Founding Cryptography on Tamper-Proof Hardware Tokens
- On non-black-box simulation and the impossibility of approximate obfuscation
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Efficient non-interactive secure computation
- One-Time Programs
- Non-black-box simulation from one-way functions and applications to resettable security
- On the impossibility of approximate obfuscation and applications to resettable cryptography
- Non-black-box simulation from one-way functions and applications to resettable security
- Unconditional and composable security using a single stateful Tamper-proof hardware token
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Truly efficient string oblivious transfer using resettable tamper-proof tokens
- From stateful hardware to resettable hardware using symmetric assumptions
- Non-interactive secure 2PC in the offline/online and batch settings
- Non-interactive secure computation based on cut-and-choose
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware
- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
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)
