Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.01025

Device-Independent Conference Keys from Parity-Extended Games

Suvradip Chakraborty, Ronak Ramachandran, Aniruddha Sen

On Aqora:Suvradip Chakraborty Suvradip Chakraborty
quant-phcs.CRSubmitted Oct 1, 2026• Announced Oct 2, 2026• 1 citation
arXivHTMLPDF

Abstract

Device-independent conference key agreement (DI-CKA) lets a group of parties establish a shared secret key from untrusted quantum devices, with security certified by non-locality. Existing DI-CKA protocols are each built around a single Bell inequality, typically a multiparty variant of the CHSH game. DI-QKD protocols, in contrast, have been built from a much richer landscape of non-local games, and it has remained unclear how to carry this landscape over to the conference setting. We introduce $\textit{Parity-$G$ games}$, which extend any two-player game $G$ to $N$ players, for every $N$, provided $G$ has an optimal strategy in which one player measures Pauli observables. The extension preserves the quantum and classical values of $G$, and the security of the resulting $N$-party protocol follows from an analysis of the two-player game alone. Our framework recovers the Parity-CHSH game of Ribeiro, Murta and Wehner (Phys. Rev. A, 2018) as a special case. Applied to the Mermin--Peres Magic Square Game, it yields a new $N$-player pseudo-telepathy game, the $\textit{Parity Magic Square Game}$, which ideal devices win in every round. We use it to construct the $\textit{first}$ DI-CKA protocol based on a pseudo-telepathy game. We prove the protocol secure against coherent attacks. It produces up to two key bits per round, and at low noise its key rate exceeds that of the DI-CKA protocol based on the Parity-CHSH game.

AI Summary

The paper asks how to transfer two-party nonlocal-game constructions to device-independent conference key agreement (DI-CKA), while keeping security analysis tractable as the number of parties grows. It defines $N$-player “Parity-$G$” extensions for games with an optimal strategy using EPR pairs and commuting Pauli measurements on Alice’s side. Conference-key generation additionally requires a computational-basis key input. Auxiliary players’ output parities specify corrections to Alice’s answers; measuring GHZ states supplies an honest strategy. The extension preserves both classical and quantum game values. Its main security reduction shows that any convex lower bound on Alice’s key-output entropy for the two-party game also applies to its parity extension, independently of $N$. The proof conditions on auxiliary outputs, relabels Alice’s measurements, and applies convexity. For the magic-square game, the construction gives an $N$-party pseudo-telepathy game with quantum value $1$ and classical value $8/9$. The associated protocol yields up to two key bits per round. Security against coherent attacks is established using numerical two-party entropy bounds, generalized entropy accumulation, and privacy amplification; one reported affine bound is $H(A|E)\geq33.4\omega-31.47$. Under global depolarizing noise, the reported asymptotic rate exceeds Parity-CHSH below approximately $5\%$ noise. Limitations include non-tight numerical entropy bounds, declining rates with party number under local noise, and an unresolved resource-matched comparison with parallel CHSH protocols. An explicit attack reveals Alice’s entire key while winning with probability $5/9+(4/9)\cos^2(\pi/8)\approx0.935$.

Some signs of AI-generated textAI use disclosedPossible errorMissing comparisonOverclaims
It was also used to aid in proofreading and some parts of writing the paper. It did not contribute to any of the main ideas or conceptual insights of this work.

Central claim may not hold: The abstract's Pauli-strategy applicability condition omits the additional tested, full-rank Z-type key input required by the paper's general conference-key construction. The magic-square key-rate calculation subtracts a one-bit binary entropy instead of the conditional entropy of the entire two-bit raw-key symbol, overstating its rates under the stated noise models. The coherent-attack secrecy theorem lacks a justified acceptance-conditioned entropy-accumulation argument and a protocol-specific tradeoff accounting for key/test rounds and public disclosures.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
32 pages, 4 figures

Related papers

From Claws to Conferences: Device-Independent Key Agreement Beyond Non-Signaling

Suvradip Chakraborty

Device-independent conference key agreement (DI-CKA) allows a group of users to establish a common secret key without trusting the internal operation of their quantum devices. Existing DI-CKA protocols derive their security from multipartite Bell tests and therefore require the device components not to communicate during each round. We present, to the best of our knowledge, the first DI-CKA protocol that removes this non-signaling assumption: all interfaces and their mutual communication are treated as one untrusted device, which only has to be quantum polynomial-time while the protocol runs. Assuming that the Learning With Errors (LWE) problem is hard for quantum algorithms with quantum advice during the execution, we prove finite-size security against coherent attacks, in which the device may keep quantum memory and correlate and adapt its behavior across rounds. For two parties the protocol is a computational DI-QKD protocol with an explicit finite-size proof against coherent attacks. Technically, we lift the claw state underlying the classical-verifier test of Brakerski et al.\ (FOCS 2018) to multipartite entanglement, obtaining a \emph{GHZ-correlated claw state}. %that is prepared with one coherent claw-free function evaluation and $N-1$ CNOT gates. We then introduce the \emph{collective adaptive hardcore bit}, a multiparty generalization of the adaptive hardcore bit of Brakerski et al.\ and show that it follows from the original property by a tight reduction. Combined with Jordan's lemma, an entropic uncertainty relation, and entropy accumulation, this certifies smooth min-entropy of the key against an external quantum adversary. Our protocol achieves \emph{everlasting security}: LWE needs to hold only during the execution, because the final key is statistically secure and its secrecy persists even if LWE is broken after the protocol ends.

arXiv:2611.05509•Nov 3, 2026•0 citations

Device Independent Quantum Secret Sharing Using Multiparty Pseudo-telepathy Game

Santanu Majhi, Goutam Paul

Device-independent quantum secret sharing (DI-QSS) provides security against untrusted quantum devices. While device-independent quantum key distribution (DI-QKD) using Mermin-Peres magic square game [Zhen et al., Phys. Rev. Lett, 2023] has been proposed, we present the first DI-QSS protocol based on a pseudo-telepathy parity game without requiring dedicated rounds and specific basis configuration, unlike CHSH-based DI-QSS schemes [Zhang et al., Phys. Rev. A, 2024]. Our scheme simultaneously certifies device-independence and key generation using a single test, achieving optimal performance for a seven-qubit GHZ state configuration. Security against collective attacks is analyzed, and a positive key rate is obtained under white noise and photon loss. Moreover, we show a bitwise advantage over the previous protocol for producing the same raw key length.

quant-pharXiv:2512.09699•Dec 11, 2025•1 citation

Device-independent conference key agreement from two-body correlators with balanced Dicke states

Makoto Ishihara, Masahiro Takeoka

Device-independent conference key agreement (DI-CKA) enables $N > 2$ distant parties to establish a common secret key without detailed characterization of the source or measurement devices. Many existing protocols rely on full-body Bell correlators, whose measurement can be demanding for a large number of parties. Here, we show that two-body correlators alone suffice for DI-CKA using balanced Dicke states for every even $N \geq 4$. We construct two-body Bell inequalities and derive a tight analytical lower bound on the conditional von Neumann entropy by comparing their Bell operators with those of asymmetric Clauser-Horne-Shimony-Holt inequalities. In the ideal setting, certified key rates can approach $1-h[(N-2)/(4(N-1))]$, where $h$ is the binary entropy function. This rate remains bounded away from zero as $N \rightarrow \infty$, tending to $1-h(1/4) \approx 0.189$ bits per key-generation round. We show that the honest implementation of our protocol is invariant under collective phase noise. Moreover, a complementary full-body Bell construction certifies positive conference-key rates from correlations arbitrarily close to the local set.

quant-pharXiv:2610.41712•Nov 2, 2026•0 citations

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

Makoto Ishihara, Wojciech Roga, Jonatan Bohr Brask +1 more

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.

quant-pharXiv:2609.03551•Sep 4, 2026•2 citations

Long-distance device-independent conference key agreement

Makoto Ishihara, Anders J. E. Bjerrum, Wojciech Roga +3 more

Device-independent quantum key distribution (DI-QKD) enables two remote parties to share an information-theoretically secure key without any assumptions on the inner workings of the devices used. Device-independent conference key agreement (DI-CKA) is multipartite DI-QKD in which more than two parties share a common secure key. The performance of DI-CKA, however, is strictly limited because of its susceptibility to losses due to, e.g., imperfect detection efficiency and channel transmission. Here, we propose a DI-CKA protocol which reduces this limitation by using a heralding scheme to distribute multipartite entanglement. We analyze key rates of our protocol for two different measurement scenarios, and we show that our protocol outperforms a previous DI-CKA protocol even with an experimentally feasible measurement.

arXiv:2506.01296•Physical Review A•Aug 5, 2025•0 citations

Fully device-independent conference key agreement

Jérémy Ribeiro, Gláucia Murta, Stephanie Wehner

We present a security analysis of conference key agreement (CKA) in the most adversarial model of device independence (DI). Our protocol can be implemented by any experimental setup that is capable of performing Bell tests [specifically, the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality], and security can in principle be obtained for any violation of the MABK inequality that detects genuine multipartite entanglement among the $N$ parties involved in the protocol. As our main tool, we derive a direct physical connection between the $N$-partite MABK inequality and the Clauser-Horne-Shimony-Holt (CHSH) inequality, showing that certain violations of the MABK inequality correspond to a violation of the CHSH inequality between one of the parties and the other $N\ensuremath{-}1$. We compare the asymptotic key rate for device-independent conference key agreement (DICKA) to the case where the parties use $N\ensuremath{-}1$ device-independent quantum key distribution protocols in order to generate a common key. We show that for some regime of noise the DICKA protocol leads to better rates.

arXiv:1708.00798•Physical Review A•Feb 6, 2018•106 citations
Device-independent conference key agreement (DI-CKA) lets a group of parties establish a shared secret key from untrusted quantum devices, with security certified by non-locality. Existing DI-CKA protocols are each built around a single Bell inequality, typically a multiparty variant of the CHSH game. DI-QKD protocols, in contrast, have been built from a much richer landscape of non-local games, and it has remained unclear how to carry this landscape over to the conference setting. We introduce \textit{Parity-G games}, which extend any two-player game GGG to NNN players, for every NNN, provided GGG has an optimal strategy in which one player measures Pauli observables. The extension preserves the quantum and classical values of GGG, and the security of the resulting NNN-party protocol follows from an analysis of the two-player game alone. Our framework recovers the Parity-CHSH game of Ribeiro, Murta and Wehner (Phys. Rev. A, 2018) as a special case. Applied to the Mermin--Peres Magic Square Game, it yields a new NNN-player pseudo-telepathy game, the Parity Magic Square Game\textit{Parity Magic Square Game}Parity Magic Square Game, which ideal devices win in every round. We use it to construct the first\textit{first}first DI-CKA protocol based on a pseudo-telepathy game. We prove the protocol secure against coherent attacks. It produces up to two key bits per round, and at low noise its key rate exceeds that of the DI-CKA protocol based on the Parity-CHSH game.
The paper asks how to transfer two-party nonlocal-game constructions to device-independent conference key agreement (DI-CKA), while keeping security analysis tractable as the number of parties grows. It defines NNN-player “Parity-GGG” extensions for games with an optimal strategy using EPR pairs and commuting Pauli measurements on Alice’s side. Conference-key generation additionally requires a computational-basis key input. Auxiliary players’ output parities specify corrections to Alice’s answers; measuring GHZ states supplies an honest strategy.
The extension preserves both classical and quantum game values. Its main security reduction shows that any convex lower bound on Alice’s key-output entropy for the two-party game also applies to its parity extension, independently of NNN. The proof conditions on auxiliary outputs, relabels Alice’s measurements, and applies convexity.
For the magic-square game, the construction gives an NNN-party pseudo-telepathy game with quantum value 111 and classical value 8/98/98/9. The associated protocol yields up to two key bits per round. Security against coherent attacks is established using numerical two-party entropy bounds, generalized entropy accumulation, and privacy amplification; one reported affine bound is H(A∣E)≥33.4ω−31.47H(A|E)\geq33.4\omega-31.47H(A∣E)≥33.4ω−31.47.
Under global depolarizing noise, the reported asymptotic rate exceeds Parity-CHSH below approximately 5%5\%5% noise. Limitations include non-tight numerical entropy bounds, declining rates with party number under local noise, and an unresolved resource-matched comparison with parallel CHSH protocols. An explicit attack reveals Alice’s entire key while winning with probability 5/9+(4/9)cos⁡2(π/8)≈0.9355/9+(4/9)\cos^2(\pi/8)\approx0.9355/9+(4/9)cos2(π/8)≈0.935.
Device-independent conference key agreement (DI-CKA) allows a group of users to establish a common secret key without trusting the internal operation of their quantum devices. Existing DI-CKA protocols derive their security from multipartite Bell tests and therefore require the device components not to communicate during each round. We present, to the best of our knowledge, the first DI-CKA protocol that removes this non-signaling assumption: all interfaces and their mutual communication are treated as one untrusted device, which only has to be quantum polynomial-time while the protocol runs. Assuming that the Learning With Errors (LWE) problem is hard for quantum algorithms with quantum advice during the execution, we prove finite-size security against coherent attacks, in which the device may keep quantum memory and correlate and adapt its behavior across rounds. For two parties the protocol is a computational DI-QKD protocol with an explicit finite-size proof against coherent attacks. Technically, we lift the claw state underlying the classical-verifier test of Brakerski et al.\ (FOCS 2018) to multipartite entanglement, obtaining a \emph{GHZ-correlated claw state}. %that is prepared with one coherent claw-free function evaluation and N−1N-1N−1 CNOT gates. We then introduce the \emph{collective adaptive hardcore bit}, a multiparty generalization of the adaptive hardcore bit of Brakerski et al.\ and show that it follows from the original property by a tight reduction. Combined with Jordan's lemma, an entropic uncertainty relation, and entropy accumulation, this certifies smooth min-entropy of the key against an external quantum adversary. Our protocol achieves \emph{everlasting security}: LWE needs to hold only during the execution, because the final key is statistically secure and its secrecy persists even if LWE is broken after the protocol ends.
Device-independent quantum secret sharing (DI-QSS) provides security against untrusted quantum devices. While device-independent quantum key distribution (DI-QKD) using Mermin-Peres magic square game [Zhen et al., Phys. Rev. Lett, 2023] has been proposed, we present the first DI-QSS protocol based on a pseudo-telepathy parity game without requiring dedicated rounds and specific basis configuration, unlike CHSH-based DI-QSS schemes [Zhang et al., Phys. Rev. A, 2024]. Our scheme simultaneously certifies device-independence and key generation using a single test, achieving optimal performance for a seven-qubit GHZ state configuration. Security against collective attacks is analyzed, and a positive key rate is obtained under white noise and photon loss. Moreover, we show a bitwise advantage over the previous protocol for producing the same raw key length.
Device-independent conference key agreement (DI-CKA) enables N>2N > 2N>2 distant parties to establish a common secret key without detailed characterization of the source or measurement devices. Many existing protocols rely on full-body Bell correlators, whose measurement can be demanding for a large number of parties. Here, we show that two-body correlators alone suffice for DI-CKA using balanced Dicke states for every even N≥4N \geq 4N≥4. We construct two-body Bell inequalities and derive a tight analytical lower bound on the conditional von Neumann entropy by comparing their Bell operators with those of asymmetric Clauser-Horne-Shimony-Holt inequalities. In the ideal setting, certified key rates can approach 1−h[(N−2)/(4(N−1))]1-h[(N-2)/(4(N-1))]1−h[(N−2)/(4(N−1))], where hhh is the binary entropy function. This rate remains bounded away from zero as N→∞N \rightarrow \inftyN→∞, tending to 1−h(1/4)≈0.1891-h(1/4) \approx 0.1891−h(1/4)≈0.189 bits per key-generation round. We show that the honest implementation of our protocol is invariant under collective phase noise. Moreover, a complementary full-body Bell construction certifies positive conference-key rates from correlations arbitrarily close to the local set.
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.
Device-independent quantum key distribution (DI-QKD) enables two remote parties to share an information-theoretically secure key without any assumptions on the inner workings of the devices used. Device-independent conference key agreement (DI-CKA) is multipartite DI-QKD in which more than two parties share a common secure key. The performance of DI-CKA, however, is strictly limited because of its susceptibility to losses due to, e.g., imperfect detection efficiency and channel transmission. Here, we propose a DI-CKA protocol which reduces this limitation by using a heralding scheme to distribute multipartite entanglement. We analyze key rates of our protocol for two different measurement scenarios, and we show that our protocol outperforms a previous DI-CKA protocol even with an experimentally feasible measurement.
We present a security analysis of conference key agreement (CKA) in the most adversarial model of device independence (DI). Our protocol can be implemented by any experimental setup that is capable of performing Bell tests [specifically, the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality], and security can in principle be obtained for any violation of the MABK inequality that detects genuine multipartite entanglement among the NNN parties involved in the protocol. As our main tool, we derive a direct physical connection between the NNN-partite MABK inequality and the Clauser-Horne-Shimony-Holt (CHSH) inequality, showing that certain violations of the MABK inequality correspond to a violation of the CHSH inequality between one of the parties and the other $N\ensuremath{-}1$. We compare the asymptotic key rate for device-independent conference key agreement (DICKA) to the case where the parties use $N\ensuremath{-}1$ device-independent quantum key distribution protocols in order to generate a common key. We show that for some regime of noise the DICKA protocol leads to better rates.