REVIEW 3 cited by
The Universal Composable Security of Quantum Key Distribution
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
Signed reviews
read the original abstract
The existing unconditional security definitions of quantum key distribution (QKD) do not apply to joint attacks over QKD and the subsequent use of the resulting key. In this paper, we close this potential security gap by using a universal composability theorem for the quantum setting. We first derive a composable security definition for QKD. We then prove that the usual security definition of QKD still implies the composable security definition. Thus, a key produced in any QKD protocol that is unconditionally secure in the usual definition can indeed be safely used, a property of QKD that is hitherto unproven. We propose two other useful sufficient conditions for composability. As a simple application of our result, we show that keys generated by repeated runs of QKD degrade slowly.
Forward citations
Cited by 3 Pith papers
-
On estimating operator norm distance, with optimal trace distance estimation when one state is pure
Rank-independent quantum estimators achieve Θ(1/ε) queries for operator-norm (and trace) distance when one state is pure, and Õ(1/ε^{3/2}) queries for general states, proving BQP-completeness.
-
On estimating Schatten norm and power distances between quantum states
For constant alpha > 1, the quantum Schatten alpha-norm distance between states given by preparation circuits can be estimated in polynomial time, and the corresponding decision problem QSD_alpha is BQP-complete; for ...
-
Composable and Finite Computational Security of Quantum Message Transmission
Secure quantum message transmission can be defined and proven in a finite, composable way, and common game-based definitions are stronger than necessary.
Discussion (0). Continue with ORCID to comment.