An Enhancement of Privacy-Preserving Wildcards Pattern Matching

Saha, Tushar Kanti; Koshiba, Takeshi

doi:10.1007/978-3-319-51966-1_10

Cited by 5 publications

(8 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, RLWE-based SwHE is considered a post-quantum encryption. Given this advantageous nature of RLWE-based SwHE, it is used in many applications in the cloud such as statistics computation [17,18], genomic computations [19,20], private equality tests [21,22], private database queries [23][24][25], and private inequality tests [26,27]. In these applications, data-encoding methods, also called packing methods, play an important role in the efficiency.…”

Section: Motivationmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Private Conjunctive Query Protocol Over Encrypted Data

Saha

Koshiba

2021

Cryptography

Self Cite

View full text Add to dashboard Cite

Conjunctive queries play a key role in retrieving data from a database. In a database, a query containing many conditions in its predicate, connected by an “and/&/∧” operator, is called a conjunctive query. Retrieving the outcome of a conjunctive query from thousands of records is a heavy computational task. Private data access to an outsourced database is required to keep the database secure from adversaries; thus, private conjunctive queries (PCQs) are indispensable. Cheon, Kim, and Kim (CKK) proposed a PCQ protocol using search-and-compute circuits in which they used somewhat homomorphic encryption (SwHE) for their protocol security. As their protocol is far from being able to be used practically, we propose a practical batch private conjunctive query (BPCQ) protocol by applying a batch technique for processing conjunctive queries over an outsourced database, in which both database and queries are encoded in binary format. As a main technique in our protocol, we develop a new data-packing method to pack many data into a single polynomial with the batch technique. We further enhance the performances of the binary-encoded BPCQ protocol by replacing the binary encoding with N-ary encoding. Finally, we compare the performance to assess the results obtained by the binary-encoded BPCQ protocol and the N-ary-encoded BPCQ protocol.

show abstract

Section: Motivationmentioning

confidence: 99%

“…To ensure the privacy both of the database and queries and to support encrypted computations, the RLWE-based SwHE [10] provides a suitable solution. To effectively use RLWE-based SwHE in different applications, several data packing methods [17][18][19][20] have been proposed.…”

Section: Motivationmentioning

confidence: 99%

Efficient Private Conjunctive Query Protocol Over Encrypted Data

Saha

Koshiba

2021

Cryptography

Self Cite

View full text Add to dashboard Cite

show abstract

“…Then, they combined this method with symmetric somewhat homomorphic encryption scheme so as to construct secure wildcard pattern matching protocol. Considering outsourced computation model, Saha and Koshiba [26] made a change of the above packing method and achieved outsourced wildcard pattern matching. Their new packing method improves the efficiency of protocol in k-times, however with information reveal about the pattern itself.…”

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

“…Modifying the protocol to support compound queries yields an inefficient protocol and poor space complexity as N has to be quite large to guarantee security but key attribute lengths are much smaller than N in general for such queries. The enhanced protocol by Saha and Koshiba [187] allows more than one $ wildcard but otherwise follows the same structure of Yasuda et al [206]. Therefore, we can expect the same problems if we try to extend it.…”

Section: Introductionmentioning

confidence: 93%

“…With homomorphic encryption, there are two related work proposed by Yasuda et al [206] and an enhanced variant by Saha and Koshiba [187]. Yasuda et al [206] allows pattern matching where the pattern may contain at most one $.…”

Section: Introductionmentioning

confidence: 99%

Privacy-preserving protocols from lattice cryptography

Tan¹

View full text Add to dashboard Cite

An Enhancement of Privacy-Preserving Wildcards Pattern Matching

Cited by 5 publications

References 21 publications

Efficient Private Conjunctive Query Protocol Over Encrypted Data

Efficient Private Conjunctive Query Protocol Over Encrypted Data

Permutable Cut-and-Choose Oblivious Transfer and Its Application

Privacy-preserving protocols from lattice cryptography

Contact Info

Product

Resources

About