arXiv:quant-ph/0603154

Secure Quantum Bit Commitment Using Unstable Particles

Chi-Yee Cheung

Published Mar 17, 2006• 0 citations

Abstract

Using unstable particles which decay by emitting neutrinos, we propose a quantum bit commitment protocol that is humanly impossible to break. Neutrinos carry away quantum information, but their interaction with matter is so weak that it would take an astronomically-sized machine just to catch them, not to mention performing controlled unitary operations on them. As a result quantum information is lost, and cheating is not possible even if the participants had access to the most powerful quantum computers that could ever be built. Therefore, for all practical purposes, our new protocol is as good as unconditionally secure.

DOI: 10.48550/arxiv.quant-ph/0603154

Related papers

Secure Quantum Bit Commitment Using Unstable Qubits

Chi-Yee Cheung

Using unstable particles (such as neutrons and muons) as qubits, we propose a quantum bit commitment protocol that is humanly impossible to break. Neutrons and muons decay by emitting neutrinos which carry away quantum information, but their interaction with matter is so weak that it would take an astronomically-sized machine just to catch them, not to mention performing controlled unitary operations on them. As a result quantum information is lost, and cheating is not possible even if the participants had access to the most powerful quantum computers that could ever be built. Therefore, for all practical purposes, our new protocol is as good as unconditionally secure.

Mar 17, 20060 citations

Unconditionally secure quantum bit commitment using modified double-slit and unstable particles

Chi-Yee Cheung

We note that the proof of the no-go theorem of unconditionally secure quantum bit commitment is based on a model which is not universal. For protocols not described by the model, this theorem does not apply. Using unstable particles and a modified double-slit setup, we construct such a protocol and show that it is unconditionally secure. In this protocol, the committer transfers no quantum states to the receiver.

arXiv:2305.12902May 22, 20230 citations

Unconditional security in quantum bit commitment

Horace P. Yuen

The commitment of bits between two mutually distrustful parties is a powerful cryptographic primitive with which many cryptographic objectives can be achieved. It is widely believed that unconditionally secure quantum bit commitment is impossible due to quantum entanglement cheating, which is codified in a general impossibility theorem. Gaps in the proof of this impossibility theorem are found. An unconditionally secure bit commitment protocol utilizing anonymous quantum states and the no-clone theorem is presented below with a full security proof.

arXiv:quant-ph/0106001Jun 1, 20010 citations

Unconditionally Secure Quantum Bit Commitment is Impossible

Dominic Mayers

The claim of quantum cryptography has always been that it can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction on the time, space, or technology available to the cheaters. We show that this claim does not hold for any quantum bit commitment protocol. Since many cryptographic tasks use bit commitment as a basic primitive, this result implies a severe setback for quantum cryptography. The model used encompasses all reasonable implementations of quantum bit commitment protocols in which the participants have not met before, including those that make use of the theory of special relativity.

arXiv:quant-ph/9605044Physical Review LettersApr 28, 1997745 citations

Unconditionally Secure Quantum Bit Commitment is Simply Possible

Arindam Mitra

It has been claimed that unconditionally secure quantum bit commitment is impossible. This claim has been widely accepted and is commonly referred to as the no-go theorem. The no-go theorem implicitly raises the question of whether quantum mechanics can be collectively verified with unconditional security against cheating. We demonstrate that by following an alternative quantum encoding scheme, unconditionally secure quantum bit commitment can, in fact, be achieved.

arXiv:physics/0007089Jul 28, 20001 citation

Defeating classical bit commitments with a quantum computer

Gilles Brassard A, Claude Crépeau, Dominic Mayers +1 more

It has been recently shown by Mayers that no bit commitment scheme is secure if the participants have unlimited computational power and technology. However it was noticed that a secure protocol could be obtained by forcing the cheater to perform a measurement. Similar situations had been encountered previously in the design of Quantum Oblivious Transfer. The question is whether a classical bit commitment could be used for this specific purpose. We demonstrate that, surprisingly, classical unconditionally concealing bit commitments do not help.

arXiv:quant-ph/9806031Jun 9, 199820 citations