REVIEW 1 cited by
Unconditionally secure quantum bit commitment is impossible
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The claim of quantum cryptography has always been that it can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction on the time, space or technology available to the cheaters. We show that this claim does not hold for any quantum bit commitment protocol. Since many cryptographic tasks use bit commitment as a basic primitive, this result implies a severe setback for quantum cryptography. The model used encompasses all reasonable implementations of quantum bit commitment protocols in which the participants have not met before, including those that make use of the theory of special relativity.
Forward citations
Cited by 1 Pith paper
-
Optimal fidelity estimation when one state is pure via algorithmic Uhlmann transform
When at least one of two quantum states is pure, the Uhlmann fidelity can be estimated with Θ(1/ε) queries and Θ(1/ε²) samples without knowing which state is pure, matching the optimal lower bounds.
Discussion (0). Continue with ORCID to comment.