Modified security analysis of device-independent quantum key distribution with random key basis

• URL: http://arxiv.org/abs/2508.12938v1
• Date: Mon, 18 Aug 2025 14:09:30 GMT
• Title: Modified security analysis of device-independent quantum key distribution with random key basis
• Authors: Sawan Bhattacharyya, Turbasu Chatterjee, Pankaj Agrawal, Prasenjit Deb,
• Abstract summary: We focus on the security analysis of device-independent quantum key distribution (DIQKD) with random key basis protocol.<n>We show that the optimization cost of the existing security analysis can be reduced without compromising the key rate.<n>We derive an explicit form of the pessimistic error that arises while optimizing the measurement angles of both the parties.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Security analysis is a critical part in any cryptographic protocol, may it be classical or quantum. Without security analysis, one cannot ensure the secrecy of the distributed keys. To perform a conclusive security analysis, it is very often necessary to frame the problem as an optimization problem. However, solving such optimization problems is quite challenging. In this article, we focus on the security analysis of device-independent quantum key distribution (DIQKD) with random key basis protocol. We show that the optimization cost of the existing security analysis can be reduced without compromising the key rate. In particular, we reframe the entire security analysis of this protocol as a strongly convex optimization problem and demonstrate that unlike the original security proof, optimization of Bob's measurement angles for finding a lower bound on Eve's uncertainty about Alice's key generation basis can be done with lesser cost. We derive an explicit form of the pessimistic error that arises while optimizing the measurement angles of both the parties. We also clarify a few parts of the original security proof, making the analysis more rigorous and complete.

Related papers

• Analytic Rényi Entropy Bounds for Device-Independent Cryptography [0.0]
  Device-independent (DI) cryptography represents the highest level of security.<n>We provide a simple method to obtain tighter finite-size security proofs for protocols based on the CHSH game.
  arXiv  Detail & Related papers  (2025-07-10T01:15:28Z)
• Asymptotically tight security analysis of quantum key distribution based on universal source compression [0.5242869847419834]
  Quantum key distribution (QKD) protocols require a finite-size security proof.<n>PEC approach is one of the general strategies for security analyses.<n>New PEC-type strategy can provably achieve theally optimal key rate.
  arXiv  Detail & Related papers  (2025-04-10T00:52:13Z)
• Convergent Differential Privacy Analysis for General Federated Learning: the $f$-DP Perspective [57.35402286842029]
  Federated learning (FL) is an efficient collaborative training paradigm with a focus on local privacy. differential privacy (DP) is a classical approach to capture and ensure the reliability of private protections.
  arXiv  Detail & Related papers  (2024-08-28T08:22:21Z)
• Information-Theoretic Safe Bayesian Optimization [59.758009422067005]
  We consider a sequential decision making task, where the goal is to optimize an unknown function without evaluating parameters that violate an unknown (safety) constraint. Most current methods rely on a discretization of the domain and cannot be directly extended to the continuous case. We propose an information-theoretic safe exploration criterion that directly exploits the GP posterior to identify the most informative safe parameters to evaluate.
  arXiv  Detail & Related papers  (2024-02-23T14:31:10Z)
• Log Barriers for Safe Black-box Optimization with Application to Safe Reinforcement Learning [72.97229770329214]
  We introduce a general approach for seeking high dimensional non-linear optimization problems in which maintaining safety during learning is crucial. Our approach called LBSGD is based on applying a logarithmic barrier approximation with a carefully chosen step size. We demonstrate the effectiveness of our approach on minimizing violation in policy tasks in safe reinforcement learning.
  arXiv  Detail & Related papers  (2022-07-21T11:14:47Z)
• Is Vertical Logistic Regression Privacy-Preserving? A Comprehensive Privacy Analysis and Beyond [57.10914865054868]
  We consider vertical logistic regression (VLR) trained with mini-batch descent gradient. We provide a comprehensive and rigorous privacy analysis of VLR in a class of open-source Federated Learning frameworks.
  arXiv  Detail & Related papers  (2022-07-19T05:47:30Z)
• Security analysis method for practical quantum key distribution with arbitrary encoding schemes [7.321809883860193]
  We propose a security analysis method without restriction on encoding schemes. We illustrate its ability by analyzing source flaws and a high-dimensional asymmetric protocol. Our work has the potential to become a reference standard for the security analysis of practical QKD.
  arXiv  Detail & Related papers  (2021-09-10T09:53:33Z)
• A general sample complexity analysis of vanilla policy gradient [101.16957584135767]
  Policy gradient (PG) is one of the most popular reinforcement learning (RL) problems. "vanilla" theoretical understanding of PG trajectory is one of the most popular methods for solving RL problems.
  arXiv  Detail & Related papers  (2021-07-23T19:38:17Z)
• Global Optimization of Objective Functions Represented by ReLU Networks [77.55969359556032]
  Neural networks can learn complex, non- adversarial functions, and it is challenging to guarantee their correct behavior in safety-critical contexts. Many approaches exist to find failures in networks (e.g., adversarial examples), but these cannot guarantee the absence of failures. We propose an approach that integrates the optimization process into the verification procedure, achieving better performance than the naive approach.
  arXiv  Detail & Related papers  (2020-10-07T08:19:48Z)
• Security evaluation of quantum key distribution with weak basis-choice flaws [2.179313476241343]
  Quantum key distribution (QKD) can share an unconditional secure key between two remote parties. We evaluate the security of QKD with weak basis-choice flaws, in which the random bits used by Alice and Bob are weakly controlled by Eve.
  arXiv  Detail & Related papers  (2020-08-14T11:04:30Z)
• Optimizing the Decoy-State BB84 QKD Protocol Parameters [3.6954802719347413]
  The performance of a QKD implementation is determined by the tightness of the underlying security analysis. It is known that optimal protocol parameters, such as the number of decoy states and their intensities, can be found by solving a nonlinear optimization problem. We show an improved performance for the Decoy-State BB84 QKD protocol, demonstrating that the assumptions typically made are too restrictive.
  arXiv  Detail & Related papers  (2020-06-29T12:06:16Z)

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.