Proposal for founding mistrustful quantum cryptography on coin tossing

Journal Article · Tue Jul 01 04:00:00 EDT 2003 · Physical Review. A

DOI:https://doi.org/10.1103/PhysRevA.68.012312· OSTI ID:20639878

Kent, Adrian ^[1]

---

1. Centre for Quantum Computation, DAMTP, Centre for Mathematical Sciences, University of Cambridge, Cambridge CB3 0WA, (United Kingdom)

A significant branch of classical cryptography deals with the problems which arise when mistrustful parties need to generate, process, or exchange information. As Kilian showed a while ago, mistrustful classical cryptography can be founded on a single protocol, oblivious transfer, from which general secure multiparty computations can be built. The scope of mistrustful quantum cryptography is limited by no-go theorems, which rule out, inter alia, unconditionally secure quantum protocols for oblivious transfer or general secure two-party computations. These theorems apply even to protocols which take relativistic signaling constraints into account. The best that can be hoped for, in general, are quantum protocols which are computationally secure against quantum attack. Here a method is described for building a classically certified bit commitment, and hence every other mistrustful cryptographic task, from a secure coin-tossing protocol. No security proof is attempted, but reasons are sketched why these protocols might resist quantum computational attack.

• OSTI ID: 20639878
• Journal Information: Physical Review. A, Journal Name: Physical Review. A Journal Issue: 1 Vol. 68; ISSN 1050-2947; ISSN PLRAAN
• Country of Publication: United States
• Language: English

Related Subjects

74 ATOMIC AND MOLECULAR PHYSICS
CORRELATIONS
ENERGY LEVELS
INFORMATION
QUANTUM MECHANICS
RELATIVISTIC RANGE
SECRECY PROTECTION