相关论文: Quantum Bit Commitment with a Composite Evidence
It is shown how the evidence state space in quantum bit commitment may be made to depend on the bit value 0 or 1 with split entangled pairs. As a consequence, one can obtain a protocol that is perfectly concealing, but is also…
Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classical and the quantum world. However, when committing to a string of n bits at once, how far can we stretch the quantum limits? In this letter,…
Bit commitment involves the submission of evidence from one party to another so that the evidence can be used to confirm a later revealed bit value by the first party, while the second party cannot determine the bit value from the evidence…
Bit commitment involves the submission of evidence from one party to another so that the evidence can be used to confirm a later revealed bit value by the first party, while the second party cannot determine the bit value from the evidence…
Quantum bit commitment (QBC) is insecure in the standard non-relativistic quantum cryptographic framework, essentially because Alice can exploit quantum steering to defer making her commitment. Two assumptions in this framework are that:…
We further study the security of the quantum bit commitment (QBC) protocol we previously proposed [Phys. Rev. A 74, 022332 (2006).], by analyzing the reduced density matrix \rho_{b}^{B} which describes the quantum state at Bob's side…
By using local quantum teleportation of a fixed state to one qubit of an entangled pair sent from the other party, it is shown how one party can commit a bit with only classical information as evidence that results in an unconditionally…
Based on the fact that the entanglement can not be created locally, we proposed a quantum bit commitment protocol, in which entangled states and quantum algorithms is used. The bit is not encoded with the form of the quantum states, and…
Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classical and the quantum worlds. But when committing to a string of n bits at once, how far can we stretch the quantum limits? In this paper, we…
The impossibility proof of unconditionally secure quantum bit commitment is crucially dependent on the assertion that Bob is not allowed to generate probability distributions unknown to Alice. This assertion is actually not meaningful,…
Bit commitment is a fundamental cryptographic primitive in which Bob wishes to commit a secret bit to Alice. Perfectly secure bit commitment has been proven impossible through asynchronous exchange of classical and quantum information.…
The proof of the No-Go Theorem of unconditionally secure quantum bit commitment depends on the assumption that Alice knows every detail of the protocol, including the probability distributions associated with all the random variables…
The ``impossibility proof'' on unconditionally secure quantum bit commitment is examined. It is shown that the possibility of juxtaposing quantum and classical randomness has not been properly taken into account. A specific protocol that…
We show that all proposed quantum bit commitment schemes are insecure because the sender, Alice, can almost always cheat successfully by using an Einstein-Podolsky-Rosen type of attack and delaying her measurement until she opens her…
We present a bit commitment protocol based on quantum nonlocality that seems to bring ever-lasting unconditional security. Although security is not rigorously proved, physical arguments and numerical simulations support this conclusion. The…
It is well known that no quantum bit commitment protocol is unconditionally secure. Nonetheless, there can be non-trivial upper bounds on both Bob's probability of correctly estimating Alice's commitment and Alice's probability of…
Bit commitment is a fundamental cryptographic primitive in which Alice wishes to commit a secret bit to Bob. Perfectly secure bit commitment between two mistrustful parties is impossible through asynchronous exchange of quantum information.…
In this paper, we introduce a new quantum bit commitment protocol which is practically secure against entanglement attacks. A general cheating strategy is discussed and shown to be practically ineffective against the proposed approach.
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…
We describe a new classical bit commitment protocol based on cryptographic constraints imposed by special relativity. The protocol is unconditionally secure against classical or quantum attacks. It evades the no-go results of Mayers, Lo and…