Oblivious transfer using quantum entanglement (9 pages)

Xinglan Zhang, Fei Chen, Yankun Guo +2 more

Xiao Qiang Guo, Yan Yan, Hong Wang +1 more

The Oblivious Transfer (OT) is a typical foundation agreement of secure multi-party computations. It can be used to solve the “ Millionaire” interesting question raised by the winner of the Turing Award in 1982, Mr. Yao , thus to build more complex secure multi-party computation protocol or to solve practical problems,such as electronic voting, elections, e-commerce. Using of the quantum channel and the principles of the quantum mechanics , Quantum Oblivious Transfer (QOT) can be solve the classic oblivious transfer problems. QOT can be achieved higher security and higher efficiency than the Classic Oblivious Transfer, while it also has a unique advantage in found eavesdropping. We had given a very novel QOT scheme based on three-particle entangled states. Although the use more particles , the process is better concise.

HU YANGLIN

Mariana F. Ramos, Michael Hentschel, Federico Valbusa +7 more

We present an experimentally feasible implementation of a secure multiparty computation application enabled by quantum oblivious transfer (QOT) on an entanglement-based physical layer. The QOT protocol uses polarization-encoded entangled states to share oblivious keys between two parties with quantum key distribution (QKD) providing authentication. Our system integrates the post-processing for QOT and QKD, both sharing a single physical layer, ensuring efficient key generation and authentication, respectively. Authentication involves hashing messages into a cryptographic context, verifying tags, and replenishing keys. This process uses a parallel QKD pipeline specifically for authentication, not for secure key generation. Oblivious keys are generated over a distance up to 25.8 km with a channel loss of 8.47 dB. In a back-to-back setup, a QOT rate of [Formula: see text] OTs/second is achieved, corresponding to 1 minute and 53 seconds per OT, primarily limited by the entanglement source. Using pre-distributed oblivious keys improved the rate to 0.11 OTs/second, or 9.1 seconds per OT. The considered QOT protocol is statistically correct, computationally secure for an honest receiver, and statistically secure for an honest sender, assuming a computationally hiding, statistically binding commitment. An experimentally feasible use case is demonstrated for privacy-preserving fingerprint matching against no-fly lists for border control. The fingerprint is secret-shared across two sites, ensuring security, while the matching is performed using the MASCOT protocol, supported by QOT. The application required 128 1-out-of-2 OTs, each with message length of 128 bits, with the highest security achieved in 20 minutes and 39 seconds. This work demonstrates the feasibility of QOT in secure quantum communication applications.

Amit Agarwal, James Bartusek, Dakshita Khurana +1 more

Guang Ping He, Z. D. Wang

Based on quantum entanglement, an all-or-nothing oblivious transfer (OT) protocol is proposed and is proven to be secure. The distinct merit of the present protocol lies in that it is not based on quantum bit commitment. More intriguingly, this OT protocol does not belong to a class of protocols denied by Lo's no-go theorem of one-sided two-party secure computation, and thus its security can be achieved.