2014
DOI: 10.1007/978-3-319-08344-5_22
|View full text |Cite
|
Sign up to set email alerts
|

Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption

Abstract: Abstract. The basic pattern matching problem is to find the locations where a pattern occurs in a text. We give several computations enabling a client to obtain matching results from a database so that the database can not learn any information about client's queried pattern. For such computations, we apply the symmetric-key variant scheme of somewhat homomorphic encryption proposed by Brakerski and Vaikuntanathan (CRYPTO 2011), which can support a limited number of both polynomial additions and multiplication… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 21 publications
(16 citation statements)
references
References 30 publications
0
16
0
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%
“…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%
“…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%
“…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%