相关论文: An Unconditionally Secure Quantum Bit Commitment S…
This article describes a quantum bit commitment protocol, QBC3, based on entanglement destruction via forced measurements and proves its unconditional security. Some comments on the current status of the field are also made.
In a recent letter (Phys. Lett. A 377 (2013) 1076, arXiv:0905.3801), the authors presented an impossibility proof of quantum bit commitment, which attempted to cover all possible protocols that involve both quantum and classical…
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,…
Information-theoretic key agreement is impossible to achieve from scratch and must be based on some - ultimately physical - premise. In 2005, Barrett, Hardy, and Kent showed that unconditional security can be obtained in principle based on…
A new cryptographic tool, anonymous quantum key technique, is introduced that leads to unconditionally secure key distribution and encryption schemes that can be readily implemented experimentally in a realistic environment. If quantum…
This paper has been withdrawn.
We propose an entanglement-based quantum bit string commitment protocol whose composability is proven in the random oracle model. This protocol has the additional property of preserving the privacy of the committed message. Even though this…
There had been well known claims of ``provably unbreakable'' quantum protocols for bit commitment and coin tossing. However, we, and independently Mayers, showed that all proposed quantum bit commitment (and therefore coin tossing) schemes…
Zero-knowledge proof system is an important protocol that can be used as a basic block for construction of other more complex cryptographic protocols. Quantum zero-knowledge protocols have been proposed but, since their implementation…
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…
Unconditionally secure two-party bit commitment based solely on the principles of quantum mechanics (without exploiting special relativistic signalling constraints, or principles of general relativity or thermodynamics) has been shown to be…
When submitting ``Coin-Flipping-based Quantum Oblivious Transfer'' (quant-ph/0605027v4) to Indocrypt-2006, I received valuable reviews. Due to the attacks in these reviews, my major protocols, for cheat-sensitive and coin-flipping-based 2-1…
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,…
Recently, Zhang, Li, and Guo have proposed a particular eavesdropping attack [Phys. Rev. A {\bf 63}, 036301 (2001), quant-ph/0009042] which shows that my quantum key distribution protocol based on entanglement swapping [Phys. Rev. A {\bf…
This paper was withdrawn on 20.11.97.
The paper has been withdrawn.
We present an extension of the first proof for the unconditional security of the BB84 quantum key distribution protocol which was given by Mayers. We remove the constraint that a perfect BB84 quantum source is required and the proof given…
In 2015, Li et al. (Quantum Inf Process (2015) 14:2171-2181) proposed an arbitrated quantum signature (AQS) scheme based on the chained controlled-NOT operations encryption. However, this paper points out that in their scheme an attacker…
This paper has been withdrawn by the authors.
Einstein-Podolsky-Rosen- (EPR) and the more powerful Mayers-Lo-Chau attack impose a serious constraint on quantum bit commitment (QBC). As a way to circumvent them, it is proposed that the quantum system encoding the commitment chosen by…