Boosting device-independent cryptography with tripartite nonlocality

• URL: http://arxiv.org/abs/2209.12828v2
• Date: Wed, 12 Apr 2023 11:30:16 GMT
• Title: Boosting device-independent cryptography with tripartite nonlocality
• Authors: Federico Grasselli, Gl\'aucia Murta, Hermann Kampermann, Dagmar Bru{\ss}
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Device-independent (DI) protocols, such as DI conference key agreement (DICKA) and DI randomness expansion (DIRE), certify private randomness by observing nonlocal correlations when two or more parties test a Bell inequality. While most DI protocols are restricted to bipartite Bell tests, harnessing multipartite nonlocal correlations may lead to better performance. Here, we consider tripartite DICKA and DIRE protocols based on testing multipartite Bell inequalities, specifically: the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality, and the Holz and the Parity-CHSH inequalities introduced in the context of DICKA protocols. We evaluate the asymptotic performance of the DICKA (DIRE) protocols in terms of their conference key rate (net randomness generation rate), by deriving lower bounds on the conditional von Neumann entropy of one party's outcome and two parties' outcomes. For the Holz inequality, we prove a tight analytical lower bound on the one-outcome entropy and conjecture a tight lower bound on the two-outcome entropy. We additionally re-derive the analytical one-outcome entropy bound for the MABK inequality with a much simpler method and obtain a numerical lower bound on the two-outcome entropy for the Parity-CHSH inequality. Our simulations show that DICKA and DIRE protocols employing tripartite Bell inequalities can significantly outperform their bipartite counterparts. Moreover, we establish that genuine multipartite entanglement is not a precondition for multipartite DIRE while its necessity for DICKA remains an open question.

Related papers

• Fixed-Budget Differentially Private Best Arm Identification [62.36929749450298]
  We study best arm identification (BAI) in linear bandits in the fixed-budget regime under differential privacy constraints. We derive a minimax lower bound on the error probability, and demonstrate that the lower and the upper bounds decay exponentially in $T$.
  arXiv  Detail & Related papers  (2024-01-17T09:23:25Z)
• Expanding bipartite Bell inequalities for maximum multi-partite randomness [0.9208007322096533]
  We study the maximum amount of randomness that can be certified by correlations exhibiting a violation of the Mermin-Ardehali-Belinskii-Klyshko inequality. We derive new families of Bell inequalities certifying maximum randomness from a technique for randomness certification, which we call "expanding Bell inequalities" Our technique allows one to take a bipartite Bell expression, known as the seed, and transform it into a multipartite Bell inequality tailored for randomness certification.
  arXiv  Detail & Related papers  (2023-08-14T09:41:04Z)
• PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium [58.26573117273626]
  We consider the non-AL equilibrium nonconptotic objective function in two-player zero-sum continuous games. Our novel insights into the particle-based algorithms for continuous distribution strategies are presented.
  arXiv  Detail & Related papers  (2023-03-02T05:08:15Z)
• Targeted Separation and Convergence with Kernel Discrepancies [61.973643031360254]
  kernel-based discrepancy measures are required to (i) separate a target P from other probability measures or (ii) control weak convergence to P. In this article we derive new sufficient and necessary conditions to ensure (i) and (ii) For MMDs on separable metric spaces, we characterize those kernels that separate Bochner embeddable measures and introduce simple conditions for separating all measures with unbounded kernels.
  arXiv  Detail & Related papers  (2022-09-26T16:41:16Z)
• Role of Steering Inequality In Quantum Key Distribution Protocol [0.0]
  Violation of Bell's inequality has been the mainspring for secure key generation in an entanglement assisted Quantum Key Distribution protocol. We show that the violations of the CJWR can act as key ingredients in an entanglement assisted QKD protocol.
  arXiv  Detail & Related papers  (2021-06-24T04:06:05Z)
• Device-independent quantum key distribution based on Bell inequalities with more than two inputs and two outputs [0.0]
  Device-independent quantum key distribution (DI-QKD) offers the strongest form of security against eavesdroppers bounded by the laws of quantum mechanics. We present two DI-QKD protocols whose security relies on Bell inequalities with more than two inputs and two outputs.
  arXiv  Detail & Related papers  (2021-04-01T11:53:56Z)
• 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)
• Upper bounds on device-independent quantum key distribution rates and a revised Peres conjecture [11.523471275501855]
  Device-independent quantum key distribution (DIQKD) is one of the most challenging tasks in quantum cryptography. We study the entanglement needed for DIQKD protocols in two different ways.
  arXiv  Detail & Related papers  (2020-05-25T18:21:09Z)
• Lower bounds in multiple testing: A framework based on derandomized proxies [107.69746750639584]
  This paper introduces an analysis strategy based on derandomization, illustrated by applications to various concrete models. We provide numerical simulations of some of these lower bounds, and show a close relation to the actual performance of the Benjamini-Hochberg (BH) algorithm.
  arXiv  Detail & Related papers  (2020-05-07T19:59:51Z)
• Entropy bounds for multiparty device-independent cryptography [0.0]
  We show that genuine multipartite entanglement is necessary to certify the privacy of a party's outcome. We obtain the entropy bounds thanks to two general results of independent interest.
  arXiv  Detail & Related papers  (2020-04-29T15:22:57Z)
• From Matching with Diversity Constraints to Matching with Regional Quotas [51.33676030875284]
  We present a formal connection between two important axioms on matching with distributional constraints. We show that it is NP-complete to check whether a feasible and stable outcome for (1) exists. We conclude that further developments on aspects of hospital-doctor matching with regional quotas will result in corresponding school choice with diversity.
  arXiv  Detail & Related papers  (2020-02-17T02:51:46Z)

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.