Problem
Research questions and friction points this paper is trying to address.
Device-independent conference key agreement
Bell inequality
non-local games
pseudo-telepathy
Device-Independent Conference Keys from Parity-Extended Games
🤖 AI Summary
This study addresses the limitation of existing device-independent conference key agreement (DI-CKA) protocols, which are constrained by single Bell inequalities and thus fail to exploit rich nonlocal game resources. We propose a parity-extended game framework that generalizes bipartite games to N-party scenarios and construct the first DI-CKA protocol based on the pseudo-telepathy game. This approach unifies the transition from bipartite to multipartite settings, requiring security analysis solely for the two-party case. Theoretical proofs demonstrate guaranteed per-round success under ideal devices. Furthermore, under low-noise conditions, the proposed protocol achieves significantly higher key rates than the Parity-CHSH protocol while maintaining robustness against coherent attacks, thereby enabling secure multipartite key sharing.
📝 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.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Device-independent conference key agreement
Parity-extended games
Pseudo-telepathy
Non-local games
Quantum cryptography
🔎 Similar Papers
No similar papers found.
