Permutable Cut-and-Choose Oblivious Transfer and Its Application

Abstract

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.

Secure Two-Party Computation Based on Fast Cut-and-Choose Bilateral Oblivious Transfer

“…Although the protocols for cut-and-choose can combine the check of circuits and the oblivious transfer for transmitting keys to solve the problem of selective failure attacks [5], these protocols use CCOT [6][7][8] to transmit garbled keys. One significant feature of CCOT is that it can only transmit keys associated with P 2 , s input wire.…”

SWMQ: Secure wildcard pattern matching with query

“…Moreover, for a better view, we plot the experimental results in Figures 10 and 11. The total running time of our protocol is less than 2 s when the text length is 2 16 and the pattern length is 2 12 . Moreover, we observe that the total running time differs little between the different pattern lengths when the text length is 2 16 and 2 18 .…”

“…To better account for the efficiency of the protocol, we assess the performance of SWMQ. Specifically, the running time in the local area network (LAN) and wide area network (WAN) setting is less than 0.4 and 2 s, respectively, when the text length is 2 16 and the pattern length is 2 12 . In fact, our evaluation results suggest that SWMQ has ensured the high efficiency of the protocol while guaranteeing extended functionality.…”

“…Moreover, Qin et al 11 constructed a privacy‐preserving wildcard matching protocol via OT and secret sharing. Their computation and communication costs are the same as the approach of Kolesnikov et al 10 In 2020, Wei et al 12 focused on WPM in the semihonest setting. Their construction mainly relied on a primitive called permutable cut‐and‐choose OT (CCOT) with $${\mathscr{O}}(nm)$$ communication and $${\mathscr{O}}(k)$$ computation.…”

“…In addition, we evaluate the performance of SWMQ. More specifically, the running time in local area network and wide area network settings is less than 0.4 and 2 s, respectively, when the text length is 2 16 and the pattern length is 2 12 . In fact, our evaluation results suggest that SWMQ is not only more broadly Int J Intell Syst.…”