No-Go Bounds for Quantum Seals

Abstract

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.

arXiv comment12 pages, 2 figures, 26 references

References in corpus (11)

• Unconditionally secure quantum bit commitment is impossible
• Is Quantum Bit Commitment Really Possible?
• Coding Theorem and Strong Converse for Quantum Channels
• Degrees of concealment and bindingness in quantum bit commitment protocols
• Quantum seals
• Upper bounds of a class of imperfect quantum sealing protocols
• Quantum bit string sealing
• Quantum String Seal Is Insecure
• Insecurity Of Imperfect Quantum Bit Seal
• Comment on "Quantum string seal is insecure"
• Reply To "Comment on 'Quantum String Seal Is Insecure' "