A Formal System for Analysis of an Oblivious Transfer Protocol

Manuel B. Santos, Armando N. Pinto, Paulo Mateus

Abstract Secure multiparty computation has the potential to be a disruptive technique in the realm of data analysis and computation. It enables several parties to compute virtually any function while preserving the privacy of their inputs. However, most of its protocols’ security and efficiency relies on the security and efficiency of oblivious transfer (OT). In this work, we make a detailed comparison between the complexity of the hybrid quantum oblivious transfer (HQOT) protocol presented in [11] and the classical OT [12], which to the best of our knowledge, is the fastest OT protocol. We also propose an optimised version of HQOT and discuss several other OT protocols generated from oblivious keys.

Michael J. Fischer, Silvio M. Micali, Charles Rackoff

Christian L. F. Corniaux, Hossein Ghodosi

Zhide Chen

Oblivious transfer(OT)is used as a key component in many applications of cryptography. In this paper, a1-out-of-n oblivious transfer is constructed based on the sub protocol 1-out-of-2 oblivious transfer;an m-out-of-n oblivious transfer is constructed based on the sub protocol 1-out-of-n oblivious transfer. Finally,a1-out-of-2 oblivious transfer is constructed based on public key system. By this way,any existed public key system can be used to construct m-out-of-n oblivious transfer.

Baiyu Li, Daniele Micciancio

MeiLing, Zhang, Li Jin, YuanHua, Liu +4 more

All existing quantum oblivious transfer protocols are to realize the oblivious transfer of bit or bit-string. In this paper, p-Rabin quantum oblivious transfer of a qubit (abbr. p-Rabin qubit-OT) is achieved by using a probabilistic teleportation (abbr. PT) protocol. Here, this is the first time that the concept of qubit-OT is presented. As the PT protocol is able to transfer an (un)known pure state with a certain probability, this feature makes the PT protocol well fit for Rabin OT. Furthermore, the PT protocol can be used for OT of a bit by encoding classical bit with two pre-agreed orthogonal states. Finally, security analysis shows that the PT protocol can be against participants attacks, and what's more, the discussion of relationship with no-go theorem demonstrates that the PT protocol is able to evade the no-go theorem.