arXiv:1306.5863

Bit commitment protocol based on random oblivious transfer via quantum channel

Li Yang

Published Jun 25, 2013• 4 citations

Abstract

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.

Related papers

Practical Quantum Bit Commitment Protocol Based on Quantum Oblivious Transfer

Yaqi Song, Li Yang

Oblivious transfer (OT) and bit commitment (BC) are two-party cryptographic protocols which play crucial roles in the construction of various cryptographic protocols. We propose three practical quantum cryptographic protocols in this paper. We first construct a practical quantum random oblivious transfer (R-OT) protocol based on the fact that non-orthogonal states cannot be reliably distinguished. Then, we construct a fault-tolerant one-out-of-two oblivious transfer ( O T 1 2 ) protocol based on the quantum R-OT protocol. Afterwards, we propose a quantum bit commitment (QBC) protocol which executes the fault-tolerant O T 1 2 several times. Mayers, Lo and Chau (MLC) no-go theorem proves that QBC protocol cannot be unconditionally secure. However, we find that computing the unitary transformation of no-go theorem attack needs so many resources that it is not realistically implementable. We give a definition of physical security for QBC protocols and prove that the practical QBC we proposed is physically secure and can be implemented in the real world.

Applied SciencesOct 19, 20188 citations

Quantum Rabin oblivious transfer using two pure states

Lara Stroh, James T. Peat, Mats Kroneberg +2 more

Oblivious transfer between two untrusting parties is an important primitive in cryptography. There are different variants of oblivious transfer. In Rabin oblivious transfer, the sender Alice holds a bit, and the receiver Bob either obtains the bit, or obtains no information with probability p ? . Alice should not know whether or not Bob obtained the bit. We examine a quantum Rabin oblivious transfer (OT) protocol that uses two pure states. Investigating different cheating scenarios for the sender and for the receiver, we determine optimal cheating probabilities in each case. Comparing the quantum Rabin oblivious transfer protocol to classical Rabin oblivious transfer protocols, we show that the quantum protocol outperforms classical protocols, which do not use a third party, for some values of p ? . We find that quantum Rabin OT protocols that use mixed states can outperform quantum Rabin OT protocols that use pure states for some values of p ? . Published by the American Physical Society 2024

arXiv:2405.04486Physical Review ResearchOct 2, 20242 citations

On Bit Commitment and Oblivious Transfer in Measurement-Device Independent settings

Jérémy Ribeiro, Stephanie Wehner

Among the most studied tasks in Quantum Cryptography one can find Bit Commitment (BC) and Oblivious Transfer (OT), two central cryptographic primitives. In this paper we propose for the first time protocols for these tasks in the measurement-device independent (MDI) settings and analyze their security. We analyze two different cases: first we assume the parties have access to perfect single photon sources (but still in the presence of noise and losses), and second we assume that they only have imperfect single photon sources. In the first case we propose a protocol for both BC and OT and prove their security in the Noisy Quantum Storage model. Interestingly, in the case where honest parties do not have access to perfect single photon sources, we find that BC is still possible, but that it is "more difficult" to get a secure protocol for OT: We show that there is a whole class of protocols that cannot be secure. All our security analyses are done in the finite round regime.

arXiv:2004.10515Apr 22, 20203 citations

Oblivious transfer using quantum entanglement

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.

arXiv:quant-ph/0312161Physical Review AJan 23, 200646 citations

Mixed States in Quantum Rabin Oblivious Transfer

James T. Peat, Lara Stroh, Kenny Campbell +1 more

Oblivious transfer (OT) is a fundamental cryptographic primitive that is useful for realizing any two-party computation. Since information-theoretically secure perfect OT is impossible classically and quantumly, research has focused on imperfect protocols, exploring how close to perfect one can get against unbounded dishonest parties. While current approaches often make use of pure quantum states, recent work suggests that mixed quantum states may improve performance. In this paper, we investigate the use of mixed quantum states in Rabin oblivious transfer, where a sender holds one bit and a receiver learns its value with a certain probability while the sender remains ignorant of whether the receiver learned it. We present three mixed-state protocols constructed with two distinct methods, extending an existing pure-state scheme and employing a probabilistic approach, and demonstrate improved performance compared to classical and quantum pure-state protocols across varying parameters.

quant-pharXiv:2610.09796Oct 8, 20260 citations

A Secured Quantum Two-Bit Commitment Protocol for Communication Systems

Manal Khawasik, Wagdy Gomaa El-Sayed, Magdi Z. Rashad +1 more

Bit commitment is an essential primitive in quantum cryptography. It is the basic building block of many cryptographic protocols in which it provides security over distrustful parties. This paper proposes a secured quantum two-bit commitment protocol for any two classical bits. The protocol contains two parties - a committer and a receiver - who share both quantum and classical communication channels. The main phases of this protocol are commitment and revealing phases where the concealing and binding conditions are proved in order to accept the commitment message. The proposed framework utilizes different security layers to hide specific quantum states in a superposition alongside trivial one qubit operations. The secured unitary transformations are applied by the two parties to meet the concealing and binding conditions. To verify the success of the proposed protocol, the measured output of the two parties are compared. The protocol operates under the assumption that the two parties might cheat and the possible existence of an eavesdropper.

IEEE AccessJan 1, 20228 citations