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.
AI Summary
The paper studies whether mixed-state encodings improve cheating-probability tradeoffs in imperfect quantum Rabin oblivious transfer: an honest receiver learns a bit with probability $p_s$, while the sender should remain unaware of whether reception succeeded. It compares three mixed-state constructions with a specified probabilistic classical protocol and an existing two-nonorthogonal-pure-state protocol, across $0\leq p_s\leq1$.
The first construction encodes the bit as the parity of two independently encoded qubits. An optimal collective unambiguous-discrimination measurement preserves the pure-state protocol’s honest success probability, $p_s=2\sin^2\phi$, while reducing the receiver’s cheating probability from $\tfrac12[1+\sin(2\phi)]$ to $\tfrac12[1+\sin^2(2\phi)]$. The sender’s cheating probability generally increases; the construction dominates the pure-state comparator for $p_s\geq2/(\sqrt2+1)\approx0.828427$, where their sender-cheating probabilities coincide.
Two further constructions add an orthogonal erasure state and probabilistic receiver measurement. Optimizing parameters at fixed $p_s$ and sender-cheating probability gives performance matching or improving the classical benchmark throughout its parameter region. The construction based on the single-qubit protocol also matches or improves the pure-state comparator for every $p_s$, with improvement below $2/3$.
Receiver cheating is calculated using minimum-error discrimination; sender cheating is analyzed through measurement eigenstates and repeated-run reception-frequency monitoring. Entangled attacks show that additional sampled state-verification tests do not reduce sender cheating under the assumed ideal capabilities. Imperfect sender memory and preparation are outside scope; whether higher-dimensional constructions or analogous techniques improve other cryptographic primitives remains open.
Little sign of AI-generated textIncrementalOverclaimsPossible error
Central claim may not hold: Protocols 4 and 5 underestimate dishonest Alice's success under the specified reception-frequency monitoring because she can change the assumed preparation frequencies while preserving Bob's reception rate.
Appendix B supplies an attack surviving full state testing but does not establish the claimed equivalence with reception-frequency monitoring, whose actual cheating probability can be strictly higher.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
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.
The paper studies whether mixed-state encodings improve cheating-probability tradeoffs in imperfect quantum Rabin oblivious transfer: an honest receiver learns a bit with probability ps, while the sender should remain unaware of whether reception succeeded. It compares three mixed-state constructions with a specified probabilistic classical protocol and an existing two-nonorthogonal-pure-state protocol, across 0≤ps≤1.
The first construction encodes the bit as the parity of two independently encoded qubits. An optimal collective unambiguous-discrimination measurement preserves the pure-state protocol’s honest success probability, ps=2sin2ϕ, while reducing the receiver’s cheating probability from 21[1+sin(2ϕ)] to 21[1+sin2(2ϕ)]. The sender’s cheating probability generally increases; the construction dominates the pure-state comparator for ps≥2/(2+1)≈0.828427, where their sender-cheating probabilities coincide.
Two further constructions add an orthogonal erasure state and probabilistic receiver measurement. Optimizing parameters at fixed ps and sender-cheating probability gives performance matching or improving the classical benchmark throughout its parameter region. The construction based on the single-qubit protocol also matches or improves the pure-state comparator for every ps, with improvement below 2/3.
Receiver cheating is calculated using minimum-error discrimination; sender cheating is analyzed through measurement eigenstates and repeated-run reception-frequency monitoring. Entangled attacks show that additional sampled state-verification tests do not reduce sender cheating under the assumed ideal capabilities. Imperfect sender memory and preparation are outside scope; whether higher-dimensional constructions or analogous techniques improve other cryptographic primitives remains open.
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
Oblivious transfer, a central functionality in modern cryptography, allows a party to send two one-bit messages to another who can choose one of them to read, remaining ignorant about the other, whereas the sender does not learn the receiver's choice. Oblivious transfer the security of which is information-theoretic for both parties is known impossible to achieve from scratch. The joint behavior of certain bi-partite quantum states is non-local, i.e., cannot be explained by shared classical information. In order to better understand such behavior, which is classically explainable only by communication, but does not allow for it, Popescu and Rohrlich have described a "non-locality machine": Two parties both input a bit, and both get a random output bit the XOR of which is the AND of the input bits. We show a close connection, in a cryptographic sense, between OT and the "PR primitive." More specifically, unconditional OT can be achieved from a single realization of PR, and vice versa. Our reductions, which are single-copy, information-theoretic, and perfect, also lead to a simple and optimal protocol allowing for inverting the direction of OT
Oblivious transfer is a fundamental cryptographic primitive that is useful for secure multiparty computation. There are several variants of oblivious transfer. We consider 1-out-of-2 oblivious transfer, where a sender sends two bits of information to a receiver. The receiver receives only one of the two bits, while the sender does not know which bit the receiver has received. Perfect quantum oblivious transfer with information-theoretic security is known to be impossible. We aim to find the lowest possible cheating probabilities. Bounds on cheating probabilities have been investigated for “complete” protocols, where if both parties follow the protocol, the bit value obtained by the receiver matches the sender's bit value. We instead investigate incomplete protocols, where the receiver obtains an incorrect bit value with probability p f . We present optimal noninteractive protocols where Alice's bit values are encoded in four symmetric pure quantum states, and where she cannot cheat better than with a random guess. We find the protocols such that for a given p f , Bob's cheating probability p r is as low as possible, and vice versa. Furthermore, we show that noninteractive quantum protocols can outperform noninteractive classical protocols and give a lower bound on Bob's cheating probability in interactive quantum protocols. Importantly for optical implementations, our protocols do not require entanglement nor quantum memory.
Oblivious transfer has been the interest of study as it can be used as a building block for multiparty computation. There are many forms of oblivious transfer; we explore a variant known as Rabin oblivious transfer. Here the sender Alice has one bit, and the receiver Bob obtains this bit with a certain probability. The sender does not know whether the receiver obtained the bit or not. For a previously suggested protocol, we show a possible attack using a delayed measurement. This allows a cheating party to pass tests carried out by the other party, while gaining more information than if they would have been honest. We show how this attack allows perfect cheating, unless the protocol is modified, and suggest changes which lower the cheating probability for the examined cheating strategies.
Rabin oblivious transfer is the cryptographic task where Alice wishes to receive a bit from Bob but it may get lost with probability 1/2. In this work, we provide protocol designs which yield quantum protocols with improved security. Moreover, we provide a constant lower bound on any quantum protocol for Rabin oblivious transfer. To quantify the security of this task with asymmetric cheating definitions, we introduce the notion of cheating advantage which may be of independent interest in the study of other asymmetric cryptographic primitives.
Abstract We investigate coherent-state implementations of quantum Rabin oblivious transfer (OT) based on unambiguous state discrimination and derive the optimal cheating strategies of a dishonest receiver Bob and sender Alice as functions of the coherent-state amplitude. For Bob, we compare the operational guessing probability with the Helstrom minimum-error bound and identify the parameter regimewhere a genuine quantum advantage arises. For Alice, we analyze optimal cheating under three verification strategies employed by Bob, no testing, statistical monitoring, and full interactive testing, and show that the strongest verification requires entangled probe states. Cheating bounds are obtained for both discrete-variable (DV) and continuous-variable (CV) ancilla encodings, including the case where Alice also attempts to infer Bob’s received bit. We further construct a quantum-optical implementation of the semi classical probabilistic Rabin OT protocol (SC-Rabin OT) along with the fully classical Rabin OT (FC-Rabin OT). These are compared with the coherent-state quantum protocol, demonstrating that in the proposed coherent-state based protocol, while Alice’s capacity to cheat remains identical in both the quantum and classical paradigms, it successfully restricts Bob’s cheating probability below classical limits over experimentally relevant parameter ranges. These results establish a measurable quantum advantage for Rabin OT using only coherent states and unambiguous measurements.