Composable finite-size effects in free-space CV-QKD systems

• URL: http://arxiv.org/abs/2002.03476v1
• Date: Mon, 10 Feb 2020 00:22:30 GMT
• Title: Composable finite-size effects in free-space CV-QKD systems
• Authors: Nedasadat Hosseinidehaj, Nathan Walk, Timothy C. Ralph
• Abstract summary: We consider two classical post-processing strategies, post-selection of high-transmissivity data and data clusterization, to reduce the fluctuation-induced noise of the channel. We show that these strategies are still able to enhance the finite-size key rate against both individual and collective attacks.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Free-space channels provide the possibility of establishing continuous-variable quantum key distribution (CV-QKD) in global communication networks. However, the fluctuating nature of transmissivity in these channels introduces an extra noise which reduces the achievable secret key rate. We consider two classical post-processing strategies, post-selection of high-transmissivity data and data clusterization, to reduce the fluctuation-induced noise of the channel. We undertake the first investigation of such strategies utilising a composable security proof in a realistic finite-size regime against both collective and individual attacks. We also present an efficient parameter estimation approach to estimate the effective Gaussian parameters over the post-selected data or the clustered data. Although the composable finite-size effects become more significant with the post-selection and clusterization both reducing the size of the data, our results show that these strategies are still able to enhance the finite-size key rate against both individual and collective attacks with a remarkable improvement against collective attacks--even moving the protocol from an insecure regime to a secure regime under certain conditions.

Related papers

• Balancing Security and Accuracy: A Novel Federated Learning Approach for Cyberattack Detection in Blockchain Networks [10.25938198121523]
  This paper presents a novel Collaborative Cyberattack Detection (CCD) system aimed at enhancing the security of blockchain-based data-sharing networks. We explore the effects of various noise types on key performance metrics, including attack detection accuracy, deep learning model convergence time, and the overall runtime of global model generation. Our findings reveal the intricate trade-offs between ensuring data privacy and maintaining system performance, offering valuable insights into optimizing these parameters for diverse CCD environments.
  arXiv  Detail & Related papers  (2024-09-08T04:38:07Z)
• Dual-Segment Clustering Strategy for Federated Learning in Heterogeneous Environments [25.405210975577834]
  Federated learning (FL) is a distributed machine learning paradigm with high efficiency and low communication load. The non-independent and identically distributed (Non-IID) data characteristic has a negative impact on this paradigm. This letter proposes a dual-segment clustering (DSC) strategy, which first clusters the clients according to the heterogeneous communication conditions.
  arXiv  Detail & Related papers  (2024-05-15T11:46:47Z)
• TernaryVote: Differentially Private, Communication Efficient, and Byzantine Resilient Distributed Optimization on Heterogeneous Data [50.797729676285876]
  We propose TernaryVote, which combines a ternary compressor and the majority vote mechanism to realize differential privacy, gradient compression, and Byzantine resilience simultaneously. We theoretically quantify the privacy guarantee through the lens of the emerging f-differential privacy (DP) and the Byzantine resilience of the proposed algorithm.
  arXiv  Detail & Related papers  (2024-02-16T16:41:14Z)
• Refined finite-size analysis of binary-modulation continuous-variable quantum key distribution [0.562479170374811]
  We extend the security proof based on complementarity, which is used in the discrete-variable QKD, to the previously developed binary-modulation CV-QKD protocols. Notably, the key rate in the limit scales linearly against the attenuation rate, which is known to be optimal scaling but is not achieved in previous finite-size analyses.
  arXiv  Detail & Related papers  (2023-01-09T05:11:23Z)
• Differentially Private Federated Clustering over Non-IID Data [59.611244450530315]
  clustering clusters (FedC) problem aims to accurately partition unlabeled data samples distributed over massive clients into finite clients under the orchestration of a server. We propose a novel FedC algorithm using differential privacy convergence technique, referred to as DP-Fed, in which partial participation and multiple clients are also considered. Various attributes of the proposed DP-Fed are obtained through theoretical analyses of privacy protection, especially for the case of non-identically and independently distributed (non-i.i.d.) data.
  arXiv  Detail & Related papers  (2023-01-03T05:38:43Z)
• Upper bounds on key rates in device-independent quantum key distribution based on convex-combination attacks [1.118478900782898]
  We present the convex-combination attack as an efficient, easy-to-use technique for upper-bounding DIQKD key rates. It allows verifying the accuracy of lower bounds on key rates for state-of-the-art protocols.
  arXiv  Detail & Related papers  (2022-06-13T15:27:48Z)
• 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)
• 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)
• Applicability of Squeezed-and Coherent-State Continuous-Variable Quantum Key Distribution over Satellite Links [0.0]
  We address the applicability of quantum key distribution with continuous-variable coherent and squeezed states over long-distance satellite-based links. We obtain tight security bounds on the untrusted excess noise on the channel output. We show that feasible amounts of optimized signal squeezing can substantially improve the applicability of the protocols.
  arXiv  Detail & Related papers  (2021-01-22T18:44:54Z)
• 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)
• Privacy-preserving Traffic Flow Prediction: A Federated Learning Approach [61.64006416975458]
  We propose a privacy-preserving machine learning technique named Federated Learning-based Gated Recurrent Unit neural network algorithm (FedGRU) for traffic flow prediction. FedGRU differs from current centralized learning methods and updates universal learning models through a secure parameter aggregation mechanism. It is shown that FedGRU's prediction accuracy is 90.96% higher than the advanced deep learning models.
  arXiv  Detail & Related papers  (2020-03-19T13:07:49Z)

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.