5PM: Secure pattern matching
TL;DR: The problem of secure pattern matching that allows single-character wildcards and substring matching in the malicious stand-alone setting is considered and the first secure expressive pattern matching protocol designed to optimize round complexity by carefully specifying the entire protocol round by round is considered.
read more
Abstract: In this paper we consider the problem of secure pattern matching that allows single-character wildcards and substring matching in the malicious stand-alone setting. Our protocol, called 5PM, is executed between two parties: Server, holding a text of length n, and Client, holding a pattern of length m to be matched against the text, where our notion of matching is more general than traditionally considered and includes non-binary alphabets, non-binary Hamming distance and non-binary substring matching.5PM is the first secure expressive pattern matching protocol designed to optimize round complexity by carefully specifying the entire protocol round by round. 5PM requires only eight rounds in the malicious static corruptions model. In the malicious model, 5PM requires O((m+n)k2) communication complexity and O(m+n) encryptions, where m is the pattern length and n is the text length. Further, 5PM can hide pattern size with no asymptotic additional costs in either computation or bandwidth.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Citations
Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
Carmit Hazay,Tomas Toft +1 more
TL;DR: The construction guarantees full simulation in the presence of malicious, polynomial-time adversaries (assuming the hardness of DDH assumption) and exhibits computation and communication costs of O(n+m) group elements in a constant round complexity.
New packing method in somewhat homomorphic encryption and its applications
TL;DR: This paper presents two types of packed ciphertexts, one of which is based on the message encoding technique proposed by Brakerski and Vaikuntanathan, and enables efficient secure computation of more complex functionalities such as multiple inner products and multiple Hamming distances.
46
Generalized pattern matching string search on encrypted data in cloud systems
Dongsheng Wang,Xiaohua Jia,Cong Wang,Kan Yang,Shaojing Fu,Ming Xu +5 more
- 24 Aug 2015
TL;DR: This paper proposes a scheme for Generalized Pattern-matching String-search on Encrypted data (GPSE) in cloud systems and implements two most commonly used pattern matching search functions on encrypted data, the substring matching and the longest-prefix-first matching.
Privacy Preserving String Matching for Cloud Computing
Bruhadeshwar Bezawada,Alex X. Liu,Bargav Jayaraman,Ann L. Wang,Rui Li +4 more
- 23 Jul 2015
TL;DR: This work presents the first ever symmetric key based approach to support privacy preserving string matching in cloud computing, and describes an efficient and accurate indexing structure, the PASS tree, which can execute a string pattern query in logarithmic time complexity over a set of data items.
A Privacy-Preserving Outsourced Functional Computation Framework Across Large-Scale Multiple Encrypted Domains
TL;DR: The proposed POFD achieves the goal of calculating a user-defined function across different encrypted domains without privacy leakage to unauthorized parties and is presented as a framework for privacy-preserving outsourced functional computation across large-scale multiple encrypted domains.
31
References
Public-key cryptosystems based on composite degree residuosity classes
Pascal Paillier
- 02 May 1999
TL;DR: A new trapdoor mechanism is proposed and three encryption schemes are derived : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA, which are provably secure under appropriate assumptions in the standard model.
Fully homomorphic encryption using ideal lattices
Craig Gentry
- 31 May 2009
TL;DR: This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.
How to generate and exchange secrets
Andrew Chi-Chih Yao
- 27 Oct 1986
TL;DR: A new tool for controlling the knowledge transfer process in cryptographic protocol design is introduced and it is applied to solve a general class of problems which include most of the two-party cryptographic problems in the literature.
4.1K
•Proceedings Article
How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority
Oded Goldreich,Silvio Micali,Avi Wigderson +2 more
- 01 Jan 1987
TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies are not made or Idistributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machimery.
3.9K
How to play ANY mental game
Oded Goldreich,Silvio Micali,Avi Wigderson +2 more
- 01 Jan 1987
TL;DR: This work presents a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest.
Related Papers (5)
Jonathan Katz,Lior Malka +1 more
- 04 Oct 2010
Andrew Chi-Chih Yao
- 27 Oct 1986
Craig Gentry
- 31 May 2009