Efficient and secure outsourced approximate pattern matching protocol

DOI10.1007/S00500-017-2560-4zbMath1398.68710OpenAlexW2603755021MaRDI QIDQ1797787

Qiuliang Xu, Xiaochao Wei, Ming-Hao Zhao

Publication date: 22 October 2018

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-017-2560-4

zbMATH Keywords

approximate pattern matchingsecret-sharing schemeoblivious transfer extensionsecure outsourced computing

Mathematics Subject Classification ID

Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Algorithms on strings (68W32)

Related Items (2)

Oblivious DFA evaluation on joint input and its applications ⋮ Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer

Cites Work

• Unnamed Item
• Computationally secure pattern matching in the presence of malicious adversaries
• Efficient secure two-party protocols. Techniques and constructions
• Verifiable outsourced ciphertext-policy attribute-based encryption in cloud computing
• An Efficient Protocol for Oblivious DFA Evaluation and Applications
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• 5PM: Secure Pattern Matching
• Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform
• How to share a secret
• Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
• Text Search Protocols with Simulation Based Security
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Improved Delegation of Computation Using Fully Homomorphic Encryption
• Efficient randomized pattern-matching algorithms
• Fast Pattern Matching in Strings
• Foundations of Cryptography
• Fully homomorphic encryption using ideal lattices
• Multi-Client Verifiable Computation with Stronger Security Guarantees
• Outsourced Pattern Matching
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography
• Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries

This page was built for publication: Efficient and secure outsourced approximate pattern matching protocol