TY - JOUR
T1 - Non-interactive XOR quantum oblivious transfer: optimal protocols and their experimental implementations
AU - Stroh, Lara
AU - Horová, Nikola
AU - Stárek, Robert
AU - Puthoor, Ittoop Vergheese
AU - Mičuda, Michal
AU - Dušek, Miloslav
AU - Andersson, Anna Erika Elisabeth
N1 - Funding Information:
This work was supported by the United Kingdom Engineering and Physical Sciences Research Council (EPSRC) under Grants No. EP/T001011/1 and No. EP/R513386/1. R.S., N.H., and M.D. acknowledge support by Palacký University under Grants No. IGA-PrF-2021-006 and No. IGA-PrF-2022-005.
Publisher Copyright:
© 2023 authors. Published by the American Physical Society. Published by the American Physical Society under the terms of the "https://creativecommons.org/licenses/by/4.0/"Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.
PY - 2023/5/4
Y1 - 2023/5/4
N2 - Oblivious transfer (OT) is an important cryptographic primitive. Any multiparty computation can be realized with OT as building block. xor oblivious transfer (XOT) is a variant where the sender Alice has two bits and a receiver Bob obtains either the first bit, the second bit, or their xor. Bob should not learn anything more than this and Alice should not learn what Bob has learnt. Perfect quantum OT with information-theoretic security is known to be impossible. We determine the smallest possible cheating probabilities for unrestricted dishonest parties in noninteractive quantum XOT protocols using symmetric pure states and present an optimal protocol, which outperforms classical protocols. We also "reverse"this protocol, so that Bob becomes sender of a quantum state and Alice the receiver who measures it, while still implementing oblivious transfer from Alice to Bob. Cheating probabilities for both parties stay the same as for the unreversed protocol. We optically implement both the unreversed and the reversed protocols, and cheating strategies, noting that the reversed protocol is easier to implement.
AB - Oblivious transfer (OT) is an important cryptographic primitive. Any multiparty computation can be realized with OT as building block. xor oblivious transfer (XOT) is a variant where the sender Alice has two bits and a receiver Bob obtains either the first bit, the second bit, or their xor. Bob should not learn anything more than this and Alice should not learn what Bob has learnt. Perfect quantum OT with information-theoretic security is known to be impossible. We determine the smallest possible cheating probabilities for unrestricted dishonest parties in noninteractive quantum XOT protocols using symmetric pure states and present an optimal protocol, which outperforms classical protocols. We also "reverse"this protocol, so that Bob becomes sender of a quantum state and Alice the receiver who measures it, while still implementing oblivious transfer from Alice to Bob. Cheating probabilities for both parties stay the same as for the unreversed protocol. We optically implement both the unreversed and the reversed protocols, and cheating strategies, noting that the reversed protocol is easier to implement.
KW - quantum technology
KW - quantum communication
KW - quantum cryptography
KW - quantum oblivious transfer
UR - http://www.scopus.com/inward/record.url?scp=85163406159&partnerID=8YFLogxK
U2 - 10.1103/PRXQuantum.4.020320
DO - 10.1103/PRXQuantum.4.020320
M3 - Article
SN - 2691-3399
VL - 4
JO - PRX Quantum
JF - PRX Quantum
IS - 2
M1 - 020320
ER -