Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0308146

Sealing quantum message by quantum code

H. F. Chau

Published Aug 27, 2003• 9 citations
arXivHTMLPDF

Abstract

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 also be used to seal a quantum message. Specifically, every one can still read the content of the sealed quantum message. But, any such attempt can be detected by an authorized verifier with an exponentially close to one probability

DOI
10.48550/arxiv.quant-ph/0308146

Related papers

Quantum Seals

Sudhir Kumar Singh, R. Srikanth

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 Bechmann–Pasquinucci majority-voting scheme that is impervious to coherent attacks, and further, encompasses sealing quantum messages by means of quantum encryption. The scheme is relatively easy to implement, requiring neither entanglement nor controlled operations during the state preparation, reading or verification stages.

arXiv:quant-ph/0410017•Physica Scripta•Jan 1, 2005•14 citations

Quantum sealing of a classical string

Guang-Ping He

A quantum scheme is proposed which seals a classical string. Each bit of the string can be read out with an arbitrarily small error rate, while reading the string can be detected except with an exponentially small probability.

•Feb 15, 2005•0 citations

QUANTUM BIT STRING SEALING

Guang Ping He

Though it was proven that secure quantum sealing of a single classical bit is impossible in principle, here we propose an unconditionally secure quantum sealing protocol which seals a classical bit string. Any reader can obtain each bit of the sealed string with an arbitrarily small error rate, while reading the string is detectable. The protocol is simple and easy to implement. The possibility of using this protocol to seal a single bit in practice is also briefly discussed.

arXiv:quant-ph/0502091•International Journal of Quantum Information•Aug 1, 2006•11 citations

Quantum Seals

Helle Bechmann-Pasquinucci

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 check if the seal has been broken and the message read. The verification is done without reading nor disturbing the sealed message.

arXiv:quant-ph/0303173•International Journal of Quantum Information•Jun 1, 2003•18 citations

Hiding messages in quantum data

Julio R. Gea-Banacloche

A method is proposed to hide messages in arbitrary quantum data files. The messages may act as “watermarks,” to secure the authenticity and/or integrity of the data. With the help of classical secret keys, they can be made unreadable by other parties and to reveal whether thay have been tampered with. The basic idea is to encode the data using a quantum error-correcting code and hide the message as (correctible) errors, deliberately inserted, which can be read out from the error syndrome. Also discussed briefly is a “reverse encoding,” which would involve putting the actual data in the error syndrome, and letting the encoded qubit itself carry the message.

Journal of Mathematical Physics•Sep 1, 2002•70 citations

Quantum Cryptography Revisited

Susan Loepp, William K. Wootters

Recall that in the Bennett–Brassard key distribution scheme, after Alice and Bob have obtained bit strings that ideally are supposed to be identical, they have to do some further processing to make sure they end up with strings that really are identical. Our first goal in this chapter is to show how they can do this. As you might expect, we will use error-correcting codes of the sort we have been discussing in the preceding chapter. However, the way we use error-correcting codes in quantum key distribution is not quite the same as in classical communication. Normally, one corrects errors by encoding one's message into special codewords that are sufficiently different from each other that they will still be distinguishable after passing through a noisy channel. But in quantum key distribution the “noise” of the channel might actually be the effect of an eavesdropper who is free to manipulate the signals sent by Alice. Ordinary error correction is not designed for such a setting. So instead of using codewords to encode the original transmission, we wait until all the bits have been sent and then use an error-correcting code after the fact . In this respect error correction in quantum key distribution is similar to the use of an error-correcting code in the “hat problem” discussed at the end of Chapter 4. There also, the error-correcting code is applied only after all the data – in that case the vector of hat colors – has been generated and conveyed to the participants.

Cambridge University Press eBooks•Jul 10, 2006•1 citation
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 also be used to seal a quantum message. Specifically, every one can still read the content of the sealed quantum message. But, any such attempt can be detected by an authorized verifier with an exponentially close to one probability
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 Bechmann–Pasquinucci majority-voting scheme that is impervious to coherent attacks, and further, encompasses sealing quantum messages by means of quantum encryption. The scheme is relatively easy to implement, requiring neither entanglement nor controlled operations during the state preparation, reading or verification stages.
A method is proposed to hide messages in arbitrary quantum data files. The messages may act as “watermarks,” to secure the authenticity and/or integrity of the data. With the help of classical secret keys, they can be made unreadable by other parties and to reveal whether thay have been tampered with. The basic idea is to encode the data using a quantum error-correcting code and hide the message as (correctible) errors, deliberately inserted, which can be read out from the error syndrome. Also discussed briefly is a “reverse encoding,” which would involve putting the actual data in the error syndrome, and letting the encoded qubit itself carry the message.
Recall that in the Bennett–Brassard key distribution scheme, after Alice and Bob have obtained bit strings that ideally are supposed to be identical, they have to do some further processing to make sure they end up with strings that really are identical. Our first goal in this chapter is to show how they can do this. As you might expect, we will use error-correcting codes of the sort we have been discussing in the preceding chapter. However, the way we use error-correcting codes in quantum key distribution is not quite the same as in classical communication. Normally, one corrects errors by encoding one's message into special codewords that are sufficiently different from each other that they will still be distinguishable after passing through a noisy channel. But in quantum key distribution the “noise” of the channel might actually be the effect of an eavesdropper who is free to manipulate the signals sent by Alice. Ordinary error correction is not designed for such a setting. So instead of using codewords to encode the original transmission, we wait until all the bits have been sent and then use an error-correcting code after the fact . In this respect error correction in quantum key distribution is similar to the use of an error-correcting code in the “hat problem” discussed at the end of Chapter 4. There also, the error-correcting code is applied only after all the data – in that case the vector of hat colors – has been generated and conveyed to the participants.