Non-interactive oblivious transfer protocol based on TEE

Li Yang

Constructing oblivious transfer and bit commitment protocols based on chan-nel’s quantum nature to achieve statistical security has always been a basic aspect of quantum cryptography. Here we put forward a scheme to reach this goal. The idea is constructing first a random oblivious transfer (R-OT, an ex-tension of Rabin’s OT) protocol based on non-orthogonal states transmission over a quantum channel, then, as that usually do in modern cryptography, we construct a one-out-of-two oblivious transfer protocol on top of the R-OT protocol. Finally, we present a bit commitment protocol based on the one-out-of-two OT protocol, and show that it is statistically secure both in concealing and binding.

Mihir Bellare Y, Silvio M. Micali

Christian Tobias

Xiaochao Wei, Han Jiang, Chuan Zhao +2 more

In secure two-party computation protocols based on garbled circuit, oblivious transfer (OT) plays an important role in transferring the garbled keys of the participants. In addition to the traditional OT primitive, many other variants of OT have also been presented, such as outsourced oblivious transfer (OOT), cut-and-choose oblivious transfer (CCOT), cut-and-choose bilateral oblivious transfer (CCBOT), etc. These new primitives significantly improve the efficiency and feasibility of secure two-party computation protocols, mainly in optimising computational complexity and interactive rounds. Among these primitives, CCBOT proposed by Zhao et al. in TrustCom 2015 is a novel one and helps to minimize the round complexity of the outer secure two-party computation protocols. In addition, they constructed a CCBOT protocol based on homomorphic encryption scheme in the malicious model. However, their protocol uses the cut-and-choose technique to guarantee security against malicious adversaries, as a result the protocol has an error probability. The commitment scheme is also inevitably involved in their protocol. In this paper, we present a CCBOT protocol with the security against malicious adversaries based on the Decisional Diffie-Hellman (DDH) assumption. Our proposed protocol avoids using the cut-and-choose technique and commitment scheme. In terms of efficiency, our protocol is much more efficient than the previous protocol.

Behzad Malek, Ali Miri

Oblivious transfer is such a strong cryptographic tool that it is directly used both in private data retrieval techniques and secure, multi-party computation paradigms. We propose an optimal oblivious transfer, where the communication complexity is logarithmic in size of the database with minimum computation overhead - the computational complexity in any oblivious transfer protocol is at least linear in the size of the database. Our communication-efficient oblivious transfer protocol is a non-interactive, single-database scheme that is generally based on homomorphic encryption functions.

Soon-Gohn Kim, Heau-Jo Kang