Proposal for founding mistrustful quantum cryptography on coin tossing
- 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, Vol. 68, Issue 1; Other Information: DOI: 10.1103/PhysRevA.68.012312; (c) 2003 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
- Country of Publication:
- United States
- Language:
- English
Similar Records
Variable-bias coin tossing
Quantum coin tossing and bit-string generation in the presence of noise