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/0303173

Quantum Seals

Helle Bechmann-Pasquinucci

Published Mar 28, 2003• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.quant-ph/0303173

Related papers

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.

International Journal of Quantum Information•Jun 1, 2003•16 citations

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•12 citations

Improved No-Go for Quantum Seals

Shelby Kimmel, Shimon Kolkowitz

We investigate the feasibility of quantum seals. A quantum seal is a state provided by Alice to Bob along with information which Bob can use to make a measurement, break the seal, and read the classical message stored inside. There are two success criteria for a seal: the probability Bob can successfully read the message without any further information from Alice must be high, and if Alice asks for the state back from Bob, the probability Alice can tell if Bob broke the seal without permission must be high. We build on the work of [Chau, PRA 2007], which gave optimal bounds on these criteria, showing that they are mutually exclusive for high probability. We weaken the assumptions of this previous work by providing Bob with only a classical description of a prescribed measurement, rather than classical descriptions of the possible seal states. We show that this weakening does not affect the bounds but does simplify the analysis. We also prove upper and lower bounds on an alternative operational metric for measuring the success criteria.

•Feb 27, 2018•0 citations

Sealing quantum message by quantum code

H. F. Chau

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

arXiv:quant-ph/0308146•Aug 27, 2003•4 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•9 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
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.
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.
We investigate the feasibility of quantum seals. A quantum seal is a state provided by Alice to Bob along with information which Bob can use to make a measurement, break the seal, and read the classical message stored inside. There are two success criteria for a seal: the probability Bob can successfully read the message without any further information from Alice must be high, and if Alice asks for the state back from Bob, the probability Alice can tell if Bob broke the seal without permission must be high. We build on the work of [Chau, PRA 2007], which gave optimal bounds on these criteria, showing that they are mutually exclusive for high probability. We weaken the assumptions of this previous work by providing Bob with only a classical description of a prescribed measurement, rather than classical descriptions of the possible seal states. We show that this weakening does not affect the bounds but does simplify the analysis. We also prove upper and lower bounds on an alternative operational metric for measuring the success criteria.