PAUNKOVIC, N., Jan BOUDA and P. MATEUS. Fair and Optimistic Quantum Contract Signing. Physical Review A. New York: American Physical Society, 2011, vol. 84, No 6, p. 062331-62341. ISSN 1050-2947. Available from: https://dx.doi.org/10.1103/PhysRevA.84.062331.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Fair and Optimistic Quantum Contract Signing
Authors PAUNKOVIC, N. (688 Serbia), Jan BOUDA (203 Czech Republic, guarantor, belonging to the institution) and P. MATEUS (620 Portugal).
Edition Physical Review A, New York, American Physical Society, 2011, 1050-2947.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
WWW URL
Impact factor Impact factor: 2.878
RIV identification code RIV/00216224:14330/11:00056672
Organization unit Faculty of Informatics
Doi http://dx.doi.org/10.1103/PhysRevA.84.062331
UT WoS 000298604600006
Keywords in English simultaneous contract signing; quantum cryptography
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 20/4/2012 09:14.
Abstract
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 the laws 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 and imperfect quantum memories occur and argue that for a real, good-enough measurement apparatus, transmission channels, and quantum memories, our protocol would still be fair. Apart from stable quantum memories, the other segments of our protocol could be implemented by today's technology, as they require in essence the same type of apparatus as the one needed for the Bennett-Brassard 1984 (BB84) cryptographic protocol. Finally, we briefly discuss two alternative versions of the protocol, one that uses only two states [based on the Bennett 1992 (B92) protocol] and the other that uses entangled pairs, and show that it is possible to generalize our protocol to an arbitrary number of clients
Abstract (in Czech)
V tomto článku prezentujeme férový a optimistický kvantový protokol pro současné podepsání kontraktu. Protokol nevyžaduje žádnou komunikaci s důvěryhodnou třetí stranou během výmeny podpisů. Pravděpodobnost úspešného podváděné je libovolně nízká a klesá s N^{-1/2}, kde N je počet vyměněných zpráv.
Links
MSM0021622419, plan (intention)Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
PrintDisplayed: 12/5/2024 16:49