Fair and Optimistic Quantum Contract Signing

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F11%3A00056672" target="_blank" >RIV/00216224:14330/11:00056672 - isvavai.cz</a>

Výsledek na webu

<a href="http://pra.aps.org/abstract/PRA/v84/i6/e062331" target="_blank" >http://pra.aps.org/abstract/PRA/v84/i6/e062331</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Fair and Optimistic Quantum Contract Signing

Popis výsledku v původním jazyce

We present a fair and optimistic quantum-contract-signing protocol between two clients that requires no communication with the third trusted party during the exchange phase. We discuss its fairness and show that it is possible to design such a protocol for which the probability of a dishonest client to cheat becomes negligible and scales as N^{-1/2}, where N is the number of messages exchanged between the clients. Our protocol is not based on the exchange of signed messages: Its fairness is based on thelaws of quantum mechanics. Thus, it is abuse free, and the clients do not have to generate new keys for each message during the exchange phase. We discuss a real-life scenario when measurement errors and qubit-state corruption due to noisy channels andimperfect quantum memories occur and argue that for a real, good-enough measurement apparatus, transmission channels, and quantum memories, our protocol would still be fair.

Název v anglickém jazyce

Fair and Optimistic Quantum Contract Signing

Popis výsledku anglicky

We present a fair and optimistic quantum-contract-signing protocol between two clients that requires no communication with the third trusted party during the exchange phase. We discuss its fairness and show that it is possible to design such a protocol for which the probability of a dishonest client to cheat becomes negligible and scales as N^{-1/2}, where N is the number of messages exchanged between the clients. Our protocol is not based on the exchange of signed messages: Its fairness is based on thelaws of quantum mechanics. Thus, it is abuse free, and the clients do not have to generate new keys for each message during the exchange phase. We discuss a real-life scenario when measurement errors and qubit-state corruption due to noisy channels andimperfect quantum memories occur and argue that for a real, good-enough measurement apparatus, transmission channels, and quantum memories, our protocol would still be fair.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2011

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

Physical Review A

ISSN

1050-2947

e-ISSN

—

Svazek periodika

84

Číslo periodika v rámci svazku

6

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

11

Strana od-do

062331

Kód UT WoS článku

000298604600006

EID výsledku v databázi Scopus

—