相关论文: Quantum bit string sealing

Quantum bit seal is a way to encode a classical bit quantum mechanically so that everyone can obtain non-zero information on the value of the bit. Moreover, such an attempt should have a high chance of being detected by an authorized…

It was claimed that all quantum string seals are insecure [H. F. Chau, quant-ph/0602099]. However, here it will be shown that for imperfect quantum string seals, the information obtained by the measurement proposed in that reference is…

This paper devises a simple quantum bit commitment protocol that is just as easy to implement as any existing practical quantum bit commitment protocols but will be more secure. It will be infinitely close to being unconditionally fully…

A quantum seal is a way of encoding a classical message into quantum states, so that everybody can read the message error-free, but at the same time the sender and all intended readers who have some prior knowledge of the quantum seal, can…

A quantum string seal encodes the value of a (bit) string as a quantum state in such a way that everyone can extract a non-negligible amount of available information on the string by a suitable measurement. Moreover, such measurement must…

The relationship between the quantum bit commitment (QBC) and quantum seal (QS) is studied. It is elaborated that QBC and QS are not equivalent, but QS protocols satisfying a stronger unconditional security requirement can lead to an…

Sealing information means making it publicly available, but with the possibility of knowing if it has been read. Commenting on [1], we will show that perfect quantum sealing is not possible for perfectly retrievable information, due to the…

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…

A quantum seal is a way of encoding a message into quantum states, so that anybody may read the message with little error, while authorized verifiers can detect that the seal has been broken. We present a simple extension to the…

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…

We give a simple proof that it is impossible to guarantee the classicality of inputs into any mistrustful quantum cryptographic protocol. The argument illuminates the impossibility of unconditionally secure quantum implementations of…

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…

A bit string commitment protocol securely commits $N$ classical bits in such a way that the recipient can extract only $M<N$ bits of information about the string. Classical reasoning might suggest that bit string commitment implies bit…

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…

The model of the quantum protocols sealing a classical bit is studied. It is shown that there exist upper bounds on its security. For any protocol where the bit can be read correctly with the probability $\alpha $, and reading the bit can…

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…

Quantum error correcting code is a useful tool to combat noise in quantum computation. It is also an important ingredient in a number of unconditionally secure quantum key distribution schemes. Here, I am going to show that quantum code can…

Given a ciphertext, is it possible to prove the deletion of the underlying plaintext? Since classical ciphertexts can be copied, clearly such a feat is impossible using classical information alone. In stark contrast to this, we show that…

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.…

Bit commitment is a fundamental cryptographic primitive and a cornerstone for numerous two-party cryptographic protocols, including zero-knowledge proofs. However, it has been proven that unconditionally secure bit commitment, both…