[Paper Review] Secure quantum string seal exists

Guang Ping He|ArXiv.org|Feb 18, 2006

Quantum Computing Algorithms and Architecture3 citations

TL;DR

This paper demonstrates that imperfect quantum string seals can be unconditionally secure despite claims of insecurity. By showing that the measurement strategy proposed in prior work yields only trivial information—due to high error rates and low fidelity—the paper proves that such seals remain secure against coherent attacks, even when cheating detection probability is limited.

ABSTRACT

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 trivial. Therefore imperfect quantum string seals can be unconditionally secure.

Motivation & Objective

• To challenge the claim that all quantum string seals are insecure.
• To analyze the information gain and detection probability of a proposed cheating measurement strategy.
• To demonstrate that imperfect quantum string seals can maintain unconditional security despite imperfect readability.
• To clarify the distinction between message fidelity and information gain in quantum sealing schemes.

Proposed method

• Re-expresses the cheating measurement strategy from prior work (Eq. 18) in a simplified form (Eq. 2).
• Analyzes the probability distribution of decoded messages using the measurement operator, deriving p_{i'→i} in Eq. (4).
• Shows that each message has at least a 1/(2N) probability of being decoded as any other message, even when unrelated.
• Demonstrates that the expected information gain is zero due to uniform random decoding with 50% probability.
• Compares the cheating strategy to a classical coin-flip method, showing equivalent success rate without quantum resources.
• Uses the string seal scheme from Ref. String as a concrete example, with error rate ε = sin²(Θ/n^α), to illustrate high readability and low p_max.

Experimental results

Research questions

• RQ1 Can imperfect quantum string seals be unconditionally secure despite claims of insecurity?
• RQ2 What is the actual information gain from the cheating measurement strategy proposed in Insecure (2006)?
• RQ3 How does the reliability of the decoded string (b') relate to the probability of correctly identifying the original message (p_max)?
• RQ4 Why is the probability p_max not a sufficient measure of information gain in quantum string sealing?
• RQ5 Can a classical strategy (e.g., coin toss) achieve the same cheating success rate as quantum measurement without detection?

Key findings

• The cheating measurement strategy from Insecure (2006) yields only trivial information, as each message has a 1/(2N) chance of being decoded regardless of content.
• The probability that Bob decodes the correct message is extremely low, with p_max ~ (1 - Θ²/n^{2α})^n, which approaches zero as n increases.
• Even though the error rate ε can be made arbitrarily small, the probability of perfect decoding (p_max) is negligible for large n.
• The actual information gain is not captured by p_max but by the reliability of the decoded string b' in the (1-p) cases, which is low due to high error rate.
• A classical coin-flip strategy achieves the same success rate as the quantum cheating method, proving that no quantum advantage exists for this attack.
• The security of imperfect quantum string seals remains unconditionally secure, as coherent attacks cannot extract meaningful information without high detection probability.