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/0501073 · International Journal of Quantum Information

IMPOSSIBILITY OF PERFECT QUANTUM SEALING OF CLASSICAL INFORMATION

Helle Bechmann-Pasquinucci, Giacomo Mauro D’Ariano, Chiara Macchiavello

Published May 31, 2005• 12 citations
arXivHTMLPDF

Abstract

Sealing information means making it publicly available, but with the possibility of knowing if it has been read. Commenting on Ref. 1, we will show that perfect quantum sealing is not possible for perfectly retrievable information, due to the possibility of performing a perfect measurement without disturbance, even on unknown states. The measurement is a collective one, and this makes the protocol of quantum sealing very interesting as the only example of the power of collective measurements in breaking security.

DOI
10.1142/s0219749905000955

Related papers

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

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

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

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•Mar 28, 2003•0 citations

Quantum string seal is insecure

H. F. Chau

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 disturb the quantum state and is likely to be detected by an authorized verifier. In this way, the intactness of the encoded quantum state plays the role of a wax seal in the digital world. Here we analyze the security of quantum string seal by studying the information disturbance trade-off of a measurement. This information disturbance trade-off analysis extends the earlier results of Bechamann-Pasquinucci, D'Ariano, and Macchiavello [Int. J. Quant. Inform. 3, 435 (2005)] and Chau [Phys. Lett. A 354, 31 (2006)] by concluding that all quantum string seals are insecure. Specifically, we find a way to obtain nontrivial available information on the string that escapes the verifier's detection with at least 50% chance.

arXiv:quant-ph/0602099•Physical Review A•Jan 24, 2007•8 citations

An information-theoretic security analysis of quantum string sealing

Masaki Nakanishi, Seiichiro Tani, Shigeru Yamashita

Abstract: A quantum sealing protocol is a quantum cryptographic protocol that can detect unsealing of a message. It is known that quantum bit sealing is insecure. However, this does not imply that quantum string sealing is also insecure. So the possibility of quantum string sealing has been studied. In this paper, we propose a quantum sealing protocol and give an information theoretic analysis. We also show that our protocol is almost optimal for uniformly distributed inputs in the sense that the upper bound of information leaks almost matches the trivial lower bound.

•Dec 14, 2007•1 citation
Sealing information means making it publicly available, but with the possibility of knowing if it has been read. Commenting on Ref. 1, we will show that perfect quantum sealing is not possible for perfectly retrievable information, due to the possibility of performing a perfect measurement without disturbance, even on unknown states. The measurement is a collective one, and this makes the protocol of quantum sealing very interesting as the only example of the power of collective measurements in breaking security.
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.
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 disturb the quantum state and is likely to be detected by an authorized verifier. In this way, the intactness of the encoded quantum state plays the role of a wax seal in the digital world. Here we analyze the security of quantum string seal by studying the information disturbance trade-off of a measurement. This information disturbance trade-off analysis extends the earlier results of Bechamann-Pasquinucci, D'Ariano, and Macchiavello [Int. J. Quant. Inform. 3, 435 (2005)] and Chau [Phys. Lett. A 354, 31 (2006)] by concluding that all quantum string seals are insecure. Specifically, we find a way to obtain nontrivial available information on the string that escapes the verifier's detection with at least 50% chance.
Abstract: A quantum sealing protocol is a quantum cryptographic protocol that can detect unsealing of a message. It is known that quantum bit sealing is insecure. However, this does not imply that quantum string sealing is also insecure. So the possibility of quantum string sealing has been studied. In this paper, we propose a quantum sealing protocol and give an information theoretic analysis. We also show that our protocol is almost optimal for uniformly distributed inputs in the sense that the upper bound of information leaks almost matches the trivial lower bound.