Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer
DOI10.1016/j.ins.2020.03.087zbMath1459.68073OpenAlexW3019371035MaRDI QIDQ2023253
Lin Xu, Hao Wang, Xiaochao Wei, Ming-Hao Zhao
Publication date: 3 May 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2020.03.087
secure two-party computationcut-and-choose oblivious transfersecure extended wildcard pattern matchingwildcard pattern matching
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Pattern recognition, speech recognition (68T10) Algorithms on strings (68W32)
Related Items (1)
Uses Software
Cites Work
- Computationally secure pattern matching in the presence of malicious adversaries
- Efficient secure two-party protocols. Techniques and constructions
- Efficient and secure outsourced approximate pattern matching protocol
- On Cut-and-Choose Oblivious Transfer and Its Variants
- An Efficient Protocol for Oblivious DFA Evaluation and Applications
- Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
- Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform
- Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
- Text Search Protocols with Simulation Based Security
- Foundations of Cryptography
- Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption
- Outsourced Pattern Matching
- Advances in Cryptology - CRYPTO 2003
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
This page was built for publication: Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer
