Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption

Yasuda, Masaya; Shimoyama, Takeshi; Kogure, Jun; Yokoyama, Keitaro; Koshiba, Takeshi

doi:10.1007/978-3-319-08344-5_22

Cited by 20 publications

(16 citation statements)

References 30 publications

(51 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Their scheme has the identical complexity as [21] and security in semi-honest adversary model. In 2014, Yasuda et al [24] considered how to compute many Hamming distances for two encrypted strings using a packing method proposed in [25]. Then, they combined this method with symmetric somewhat homomorphic encryption scheme so as to construct secure wildcard pattern matching protocol.…”

Section: ) Secure Wildcard Pattern Matchingmentioning

confidence: 99%

Permutable Cut-and-Choose Oblivious Transfer and Its Application

Wei

Wang

et al. 2020

IEEE Access

View full text Add to dashboard Cite

Oblivious transfer (OT) is a significant primitive with wide use in secure two-party computation, private set intersection private and other cryptographic schemes. In the past ten years, different variants of OT primitive like cut-and-choose OT (CCOT) and outsourced OT (OOT), have been proposed so as to satisfy various emerging models. In this paper, we firstly propose and formalize a new primitive called permutable cut-and-choose OT (PCCOT) which generalizes the original CCOT functionality. Furthermore, we construct an efficient PCCOT protocol in the presence of malicious adversaries using the Decisional Diffie-Hellman (DDH) hard assumption. It is worth mentioning that we apply the PCCOT primitive to the efficient construction of secure wildcard pattern matching (WPM) protocol. The WPM functionality allows a party to determine the locations of its pattern with wildcard characters occurs in a long text of another party while revealing nothing to either party in addition to the length of their own inputs. Our proposed secure WPM protocol via PCCOT is secure against semi-honest adversary with 2 rounds and has identical communication cost as the the state-of-the-art scheme. INDEX TERMS Secure two-party computation, cut-and-choose oblivious transfer, permutable cut-andchoose oblivious transfer, secure wildcard pattern matching.

show abstract

Section: ) Secure Wildcard Pattern Matchingmentioning

confidence: 99%

Permutable Cut-and-Choose Oblivious Transfer and Its Application

Wei

Wang

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Substring search [14], [15] has been the forefront due to the valuable sequential data, and several techniques have been utilized to solve the substring problem in a privacy-preserving way due to the privacy protection. Such as the garble circuit [16], somewhat homomorphic encryption [17], and secure interaction protocols [18], [19]. However, the existing schemes based on secure interaction protocols require the cloud server to store the gene data in the form of plaintext.…”

Section: ) Searchable Encryption For Substring Searchmentioning

confidence: 99%

Privacy-Preserving Substring Search on Multi-Source Encrypted Gene Data

et al. 2020

View full text Add to dashboard Cite

Substring searching on gene sequence data is widely used for analyzing the association between a list of gene mutations and a specific disease. As substring search usually has a high computational cost, deploying it in the cloud has become a popular solution. Moreover, the cloud allows easier data sharing among medical organizations. Since the gene data contains private information, medical organizations usually outsource encrypted gene data to the cloud and selectively share with others. Most existing solutions for the privacy-preserving substring search problem are based on searchable encryption. However, they mainly focus on single-source gene data, not suitable for handling multi-source gene data because of some practical weaknesses. In this paper, we propose a cryptographic scheme that supports privacy-preserving substring search on multi-source encrypted gene data. The cloud can authorize queriers with access control and perform substring searches over the multi-source encrypted gene data for them. Despite the outsourced gene data is encrypted with different keys, but the authorized querier can issue a substring search only uses its own key. We adopt the composite order bilinear map as the primary underlying cryptographic primitive of our scheme. We mainly focus on protecting the privacy of the outsourced gene data and the substring queries, and we provide a security analysis under the honest-but-curious model. We also perform experiments on different datasets and analyze the experimental results in terms of computation cost and communication cost. The analyses show that our scheme is secure and efficient for substring search on multi-source encrypted gene data. INDEX TERMS Composite order bilinear map, data privacy, gene data, substring search.

show abstract

“…The first work on homomorphic string search and pattern matching was presented in [31,32]. Despite the efficiency of this algorithm, it has several functional drawbacks.…”

Section: Related Workmentioning

confidence: 99%

Homomorphic String Search with Constant Multiplicative Depth

Bonte

Iliashenko

2020

Proceedings of the 2020 ACM SIGSAC Conference on Cloud Computing Security Workshop

View full text Add to dashboard Cite

String search finds occurrences of patterns in a larger text. This general problem occurs in various application scenarios, f.e. Internet search, text processing, DNA analysis, etc. Using somewhat homomorphic encryption with SIMD packing, we provide an efficient string search protocol that allows to perform a private search in outsourced data with minimal preprocessing. At the base of the string search protocol lies a randomized homomorphic equality circuit whose depth is independent of the pattern length. This circuit not only improves the performance but also increases the practicality of our protocol as it requires the same set of encryption parameters for a wide range of patterns of different lengths. This constant depth algorithm is about 12 times faster than the prior work. It takes about 5 minutes on an average laptop to find the positions of a string with at most 50 UTF-32 characters in a text with 1000 characters. In addition, we provide a method that compresses the search results, thus reducing the communication cost of the protocol. For example, the communication complexity for searching a string with 50 characters in a text of length 10000 is about 347 KB and 13.9 MB for a text with 1000000 characters. CCS CONCEPTS • Theory of computation → Circuit complexity; • Information systems → Users and interactive retrieval; • Security and privacy → Management and querying of encrypted data; Privacypreserving protocols.

show abstract

Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption

Cited by 20 publications

References 30 publications

Permutable Cut-and-Choose Oblivious Transfer and Its Application

Permutable Cut-and-Choose Oblivious Transfer and Its Application

Privacy-Preserving Substring Search on Multi-Source Encrypted Gene Data

Homomorphic String Search with Constant Multiplicative Depth

Contact Info

Product

Resources

About