Noninteractive xor Quantum Oblivious Transfer: Optimal Protocols and Their Experimental Implementations

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F23%3A73619035" target="_blank" >RIV/61989592:15310/23:73619035 - isvavai.cz</a>

Výsledek na webu

<a href="https://journals.aps.org/prxquantum/pdf/10.1103/PRXQuantum.4.020320" target="_blank" >https://journals.aps.org/prxquantum/pdf/10.1103/PRXQuantum.4.020320</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1103/PRXQuantum.4.020320" target="_blank" >10.1103/PRXQuantum.4.020320</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Noninteractive xor Quantum Oblivious Transfer: Optimal Protocols and Their Experimental Implementations

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Noninteractive xor Quantum Oblivious Transfer: Optimal Protocols and Their Experimental Implementations

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10306 - Optics (including laser optics and quantum optics)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2023

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

PRX Quantum

ISSN

2691-3399

e-ISSN

2691-3399

Svazek periodika

4

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

24

Strana od-do

"020320-1"-"020320-24"

Kód UT WoS článku

000988680200001

EID výsledku v databázi Scopus

2-s2.0-85139050755