Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Acta Optica Sinica

Security Analysis of Post-Processing in Quantum Gaussian Key Distributed

阎金 Yan Jin, 王晓凯 Wang Xiaokai, 郭大波 Guo Dabo, 孙艺 Sun Yi

Published Jan 1, 2016• 0 citations
Publisher
DOI
10.3788/aos201636.0327003

Related papers

Security of Post-Selection based Continuous Variable Quantum Key Distribution in the Presence of Gaussian Added Noise

Nathan Walk

•Dec 3, 2007•0 citations

The security of practical post-selection in Gaussian-modulated continuous-variable quantum key distribution

Adam Alderton, Weerasinghe Weerasinghe, Muataz Alhussein +2 more

Abstract Gaussian-modulated coherent-state (GMCS) continuous-variable quantum key distribution (CV-QKD) offers a practical path to quantum-secured communication owing to its compatibility with existing optical fibre networks and use of mature security proofs. Achieving high secret key rates in real-time systems, however, requires post-processing schemes that are both information-theoretically efficient and computationally scalable. In previous experimental work 1 , we have demonstrated record real-time key rates using a one-round sliced reconciliation scheme with guard-band post-selection. Here, we present the corresponding theoretical framework and provide an asymptotic security analysis that considers arbitrary collective attacks, a much broader class of attacks than the usually assumed Gaussian collective attacks. The security analysis applies the entropic continuity of quantum channels justified by a quantum channel estimation procedure. In conditions of high noise, our scheme uses 500 times less classical communication than multidimensional reconciliation.

npj Quantum Information•Sep 26, 2026•0 citations

Deterministic quantum key distribution protocols : development and security analysis

Jesni bin Shamsul Shaari

•Jan 1, 2008•0 citations

Post-processing optimization for continuous-variable quantum key distribution

László Gyöngyösi

The performance of a continuous-variable quantum key distribution (CVQKD) protocol depends on the efficiency of the post-processing of measurement results. The post-processing methods extract statistical information from the raw data, establish the mutual knowledge between the parties, and produce a final key that provides absolute security. The post-processing phase is a bottleneck in CVQKD with crucial importance to the efficiency and protocol attributes. Post-processing uses the raw data of the parties generated by the quantum-level transmission and a classical authenticated channel to generate a secret key between the parties. The current reconciliation procedures require high-complexity coding with moderate resulting efficiency. Here we define an optimization method for post-processing in continuous-variable quantum key distribution. The reconciliation method achieves additive Gaussian noise on the random secret for arbitrarily low dimensional blocks. The model consumes all information from the raw data blocks to provide maximal efficiency and security via standard operations. The results can be realized by generic Gaussian coding schemes, allowing an easily implementation for experimental CVQKD protocols.

Theoretical Computer Science•Sep 1, 2021•8 citations

Security of Quantum Key Distribution

이충만

•Jan 1, 2018•0 citations

Security of continuous-variable quantum cryptography with Gaussian postselection

Nathan Walk, Timothy C. Ralph, Thomas Symul +1 more

We extend the security analysis of continuous variable quantum-key-distribution protocols using a family of post selection schemes to account for arbitrary eavesdropping attacks. We show that the postselection protocol is equivalent to a virtual entanglement-based protocol including a distillation stage. We introduce a particular `Gaussian' post selection and demonstrate that the security can be calculated using only experimentally accessible quantities. Finally, we explicitly evaluate the performance for the case of a noisy Gaussian channel in the limit of unbounded key length and find improvements over all pre-existing continuous variable protocols in realistic regimes.

arXiv:1206.0936•Physical Review A•Feb 21, 2013•81 citations
Abstract Gaussian-modulated coherent-state (GMCS) continuous-variable quantum key distribution (CV-QKD) offers a practical path to quantum-secured communication owing to its compatibility with existing optical fibre networks and use of mature security proofs. Achieving high secret key rates in real-time systems, however, requires post-processing schemes that are both information-theoretically efficient and computationally scalable. In previous experimental work 1 , we have demonstrated record real-time key rates using a one-round sliced reconciliation scheme with guard-band post-selection. Here, we present the corresponding theoretical framework and provide an asymptotic security analysis that considers arbitrary collective attacks, a much broader class of attacks than the usually assumed Gaussian collective attacks. The security analysis applies the entropic continuity of quantum channels justified by a quantum channel estimation procedure. In conditions of high noise, our scheme uses 500 times less classical communication than multidimensional reconciliation.
The performance of a continuous-variable quantum key distribution (CVQKD) protocol depends on the efficiency of the post-processing of measurement results. The post-processing methods extract statistical information from the raw data, establish the mutual knowledge between the parties, and produce a final key that provides absolute security. The post-processing phase is a bottleneck in CVQKD with crucial importance to the efficiency and protocol attributes. Post-processing uses the raw data of the parties generated by the quantum-level transmission and a classical authenticated channel to generate a secret key between the parties. The current reconciliation procedures require high-complexity coding with moderate resulting efficiency. Here we define an optimization method for post-processing in continuous-variable quantum key distribution. The reconciliation method achieves additive Gaussian noise on the random secret for arbitrarily low dimensional blocks. The model consumes all information from the raw data blocks to provide maximal efficiency and security via standard operations. The results can be realized by generic Gaussian coding schemes, allowing an easily implementation for experimental CVQKD protocols.
We extend the security analysis of continuous variable quantum-key-distribution protocols using a family of post selection schemes to account for arbitrary eavesdropping attacks. We show that the postselection protocol is equivalent to a virtual entanglement-based protocol including a distillation stage. We introduce a particular `Gaussian' post selection and demonstrate that the security can be calculated using only experimentally accessible quantities. Finally, we explicitly evaluate the performance for the case of a noisy Gaussian channel in the limit of unbounded key length and find improvements over all pre-existing continuous variable protocols in realistic regimes.