Tight Secure Key Rates for CV-QKD with 8PSK Modulation
- URL: http://arxiv.org/abs/2107.06110v2
- Date: Sun, 25 Jul 2021 15:29:28 GMT
- Title: Tight Secure Key Rates for CV-QKD with 8PSK Modulation
- Authors: Florian Kanitschar and Christoph Pacher
- Abstract summary: We use a recent numerical security proof approach to calculate tight secure key rates in the presence of collective attacks.
We investigate the influence of radial postselection on the secure key rate.
We suggest strategies to reduce the raw key of 8PSK protocols significantly, only on the cost of a slightly lower secure key rate.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We use a recent numerical security proof approach to calculate tight secure
key rates in the presence of collective attacks for a continuous-variable (CV)
eight-state phase-shift keying (8PSK) protocol with heterodyne detection in the
asymptotic limit. The results are compared to achievable secure key rates of a
QPSK protocol obtained with the same security proof technique. Furthermore, we
investigate the influence of radial postselection on the secure key rate and
examine a recently suggested strategy to reduce the computational requirements
on the error-correction phase for four-state phase-shift-keying protocols.
Based on our investigations, we suggest different strategies to reduce the raw
key of 8PSK protocols significantly, only on the cost of a slightly lower
secure key rate. This can be used to lower the computational effort of the
error-correction phase, a known bottleneck in many practical implementations,
considerably.
Related papers
- Improved finite-size effects in QKD protocols with applications to decoy-state QKD [0.0]
We present a finite-size security proof for generic quantum key distribution protocols against independent and identically distributed collective attacks.
We extend our proof to coherent attacks and variable-length protocols.
arXiv Detail & Related papers (2025-02-07T23:37:50Z) - Improved finite-size key rates for discrete-modulated continuous variable quantum key distribution under coherent attacks [0.0]
We consider a prepare-and-measure CVQKD protocol, where Alice chooses from a set of four coherent states and Bob performs a heterodyne measurement.
We provide a security proof against coherent attacks in the finite-size regime, and compute the achievable key rate.
arXiv Detail & Related papers (2024-07-03T13:18:31Z) - Practical quantum secure direct communication with squeezed states [55.41644538483948]
We report the first table-top experimental demonstration of a CV-QSDC system and assess its security.
This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
arXiv Detail & Related papers (2023-06-25T19:23:42Z) - Security of differential phase shift QKD against explicit individual
attacks [1.9849264945671103]
We characterize the security of the 3 and n-pulse Differential Phase Shift Quantum Key Distribution protocols against individual attacks.
We compare the secure key rates thus obtained with the known lower bounds under a general individual attack.
arXiv Detail & Related papers (2023-05-19T16:56:26Z) - Phase-Matching Quantum Key Distribution without Intensity Modulation [25.004151934190965]
We propose a phase-matching quantum key distribution protocol without intensity modulation.
Simulation results show that the transmission distance of our protocol could reach 305 km in telecommunication fiber.
Our protocol provides a promising solution for constructing quantum networks.
arXiv Detail & Related papers (2023-03-21T04:32:01Z) - Data post-processing for the one-way heterodyne protocol under
composable finite-size security [62.997667081978825]
We study the performance of a practical continuous-variable (CV) quantum key distribution protocol.
We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime.
This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
arXiv Detail & Related papers (2022-05-20T12:37:09Z) - Optimizing Continuous-Variable Quantum Key Distribution with Phase-Shift
Keying Modulation and Postselection [0.0]
A numerical security proof technique is used to analyse the security of continuous-variable quantum key distribution (CV-QKD) protocols.
We show that postselection can be used to reduce the key rate gap between scenarios with trusted and untrusted detectors.
arXiv Detail & Related papers (2021-04-19T17:13:02Z) - Composably secure data processing for Gaussian-modulated continuous
variable quantum key distribution [58.720142291102135]
Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties.
We consider a protocol with homodyne detection in the general setting of composable finite-size security.
In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
arXiv Detail & Related papers (2021-03-30T18:02:55Z) - Round-robin differential phase-time-shifting protocol for quantum key
distribution: theory and experiment [58.03659958248968]
Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties.
Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments.
We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario.
Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
arXiv Detail & Related papers (2021-03-15T15:20:09Z) - Learning, compression, and leakage: Minimising classification error via
meta-universal compression principles [87.054014983402]
A promising group of compression techniques for learning scenarios is normalised maximum likelihood (NML) coding.
Here we consider a NML-based decision strategy for supervised classification problems, and show that it attains PAC learning when applied to a wide variety of models.
We show that the misclassification rate of our method is upper bounded by the maximal leakage, a recently proposed metric to quantify the potential of data leakage in privacy-sensitive scenarios.
arXiv Detail & Related papers (2020-10-14T20:03:58Z) - Tight security bounds for decoy-state quantum key distribution [1.1563829079760959]
The BB84 quantum key distribution (QKD) combined with decoy-state method is currently the most practical protocol.
Here, we provide the rigorous and optimal analytic formula to solve the above tasks.
Our results can be widely applied to deal with statistical fluctuation in quantum cryptography protocols.
arXiv Detail & Related papers (2020-02-16T07:48:25Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.