The paper proves finite-size general security for relativistic phase shift keying (RPSK) achieving secret key rates beyond 12 dB with 10^5 signals via entropy accumulation, Rényi leftover hashing, and conic optimization.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
method 2
citation-polarity summary
fields
quant-ph 3verdicts
UNVERDICTED 3roles
method 2polarities
use method 2representative citing papers
Rigorous security proofs for variable-length QKD, phase-error bounding with imperfect detectors, marginal-constrained entropy accumulation, and authentication reductions place practical QKD on firmer mathematical ground.
A virtual protocol based on universal source compression enables asymptotically tight finite-size security proofs for permutation-symmetrizable QKD by reducing the problem to conditional Rényi entropy estimation.
citing papers explorer
-
Finite-size general security for relativistic phase shift keying via variable-length quantum key distribution
The paper proves finite-size general security for relativistic phase shift keying (RPSK) achieving secret key rates beyond 12 dB with 10^5 signals via entropy accumulation, Rényi leftover hashing, and conic optimization.
-
Rigorous Security Proofs for Practical Quantum Key Distribution
Rigorous security proofs for variable-length QKD, phase-error bounding with imperfect detectors, marginal-constrained entropy accumulation, and authentication reductions place practical QKD on firmer mathematical ground.