Enhancing noise robustness in device-independent conference key agreement with asymmetric parity-CHSH inequalities

• URL: http://arxiv.org/abs/2609.03551v1
• Date: Thu, 03 Sep 2026 08:52:52 GMT
• Title: Enhancing noise robustness in device-independent conference key agreement with asymmetric parity-CHSH inequalities
• Abstract summary: In device-independent conference key agreement, security can be guaranteed with minimal assumptions.<n>We introduce a new family of multipartite Bell inequalities called the asymmetric parity-Clauser-Horne-Shimony-Holt inequalities.<n>We show that the combination of the asymmetric parity-CHSH inequality and noisy preprocessing can significantly improve the robustness to imperfections.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Conference key agreement allows multiple remote parties to establish a shared secret key with information-theoretical security. In device-independent conference key agreement, security can be guaranteed with minimal assumptions on the devices used, provided that a violation of a Bell inequality is observed. However, implementations are extremely challenging because high detection efficiency is required to observe loophole-free Bell violations. Here, we enhance the robustness of device-independent conference key agreement by introducing a new family of multipartite Bell inequalities called the asymmetric parity-Clauser-Horne-Shimony-Holt (CHSH) inequalities. We derive a tight analytical lower bound on the conditional von Neumann entropy of the outcomes of one of the parties in a protocol based on this inequality, including noisy preprocessing. Using this bound, we analyze robustness to detection inefficiencies as well as local and global depolarizing noise. We show that the combination of the asymmetric parity-CHSH inequality and noisy preprocessing can significantly improve the robustness to imperfections.

Related papers

• Security of decoy-state quantum key distribution with correlated bit-and-basis encoders [36.94429692322632]
  correlations break the round-by-round independence structure on which many widely used security proof techniques rely.<n>We develop a finite-key security proof for decoy-state BB84 against general coherent attacks.
  arXiv  Detail & Related papers  (2026-05-12T08:37:36Z)
• Towards Trustworthy Depression Estimation via Disentangled Evidential Learning [50.22167852149165]
  We propose EviDep, an evidential learning framework that jointly quantifies depression severity.<n>EviDep enforces strict information integrity to guarantee robust evidence synthesis.<n>It achieves state-of-the-art predictive accuracy and superior uncertainty calibration, delivering a robust fail-safe mechanism for trustworthy clinical screening.
  arXiv  Detail & Related papers  (2026-04-17T13:27:11Z)
• High-Probability Bounds for SGD under the Polyak-Lojasiewicz Condition with Markovian Noise [27.3629260943211]
  We present the first uniform-in-time high-probability bound for SGD under the PL condition, where the gradient noise contains both Markovian and martingale difference components.<n>This significantly broadens the scope of finite-time guarantees, as the PL condition arises in many machine learning and deep learning models.
  arXiv  Detail & Related papers  (2026-03-15T17:50:03Z)
• Certifying optimal device-independent quantum randomness in quantum networks [29.495895069435235]
  We present a family of multipartite Bell inequalities that allows to certify optimal quantum randomness and self-test GHZ states.<n>Compared with the Mermin-type inequalities, this family of Bell inequality is more efficient in certifying quantum randomness when non-maximal Bell values achieved.
  arXiv  Detail & Related papers  (2026-01-26T14:40:01Z)
• Coding-Enforced Resilient and Secure Aggregation for Hierarchical Federated Learning [30.254515308020512]
  Hierarchical federated learning (HFL) has emerged as an effective paradigm to enhance link quality between clients and the server.<n>We propose a robust hierarchical secure aggregation scheme, termed H-SecCoGC, which integrates coding strategies to enforce structured aggregation.
  arXiv  Detail & Related papers  (2026-01-25T21:07:22Z)
• Secure One-Sided Device-Independent Quantum Key Distribution Under Collective Attacks with Enhanced Robustness [0.0]
  We study the security of a quantum key distribution protocol under the one-sided device-independent (1sDI) setting.<n>We show that the protocol tolerates higher quantum bit error rates (QBER) than present DI-QKD protocols.
  arXiv  Detail & Related papers  (2025-07-24T18:47:04Z)
• A Fully Device-Independent Ternary Quantum Key Distribution Protocol Based on the Impossible Colouring Game [0.59374762912328]
  We propose a quantum key distribution protocol based on the two-party Impossible Colouring pseudo-telepathy game.<n>The protocol harnesses Bell inequality violations that arise from contextuality in the Kochen-Specker theorem.<n>It operates within an adequate security framework and demonstrates an improved key generation rate compared to standard quantum key distribution schemes.
  arXiv  Detail & Related papers  (2025-05-21T14:52:31Z)
• 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)
• Correcting for finite statistics effects in a quantum steering experiment [33.013102271622614]
  We introduce a one-sided device-independent protocol that corrects for apparent signaling effects in experimental probability distributions.<n>Our results show a significantly higher probability of violation than existing state-of-the-art inequalities.<n>This work demonstrates the power of semidefinite programming for entanglement verification and brings quantum networks closer to practical applications.
  arXiv  Detail & Related papers  (2023-05-23T14:39:08Z)
• Quantum Chernoff divergence in advantage distillation for quantum key distribution and device-independent quantum key distribution [0.0]
  Device-independent quantum key distribution (DIQKD) aims to mitigate adversarial exploitation of imperfections in quantum devices.<n>We present an alternative proof structure that replaces the fidelity with the quantum Chernoff divergence.<n>Our results provide insight into a fundamental question in quantum information theory regarding the circumstances under which DIQKD is possible.
  arXiv  Detail & Related papers  (2022-12-14T01:44:23Z)
• Boosting device-independent cryptography with tripartite nonlocality [0.0]
  Device-independent (DI) protocols certify private randomness by observing nonlocal correlations when two or more parties test a Bell inequality. Here, we consider tripartite DICKA and DIRE protocols based on testing multipartite Bell inequalities. We show that DICKA and DIRE protocols employing tripartite Bell inequalities can significantly outperform their bipartite counterparts.
  arXiv  Detail & Related papers  (2022-09-26T16:35:03Z)
• Fidelity Bounds for Device-Independent Advantage Distillation [0.0]
  We develop an algorithm that returns arbitrarily tight lower bounds on the fidelity of a device-independent repetition-code protocol. Our results give new insight on how strong the fidelity-related security conditions are, and could also be used to compute some lower bounds on one-way protocol keyrates.
  arXiv  Detail & Related papers  (2021-05-07T12:37:01Z)

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.