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

Mistrustful quantum cryptography in a device-independent setting

Jonathan Silman, André Chailloux, N. Aharon, Iordanis Kerenidis, Serge Massar

Published Jan 1, 2011• 0 citations
OpenAlex

Related papers

Device-Independent Quantum Cryptography

Federico Grasselli

Quantum science and technology•Jan 1, 2021•3 citations

Showcase: Device-Independent Quantum Cryptography

Rotem Arnon-Friedman

Springer theses•Jan 1, 2020•0 citations

High-rate measurement-device-independent quantum cryptography

Stefano Pirandola, Carlo Ottaviani, Gaetana Spedalieri +6 more

arXiv:1312.4104•Nature Photonics•May 25, 2015•476 citations

Randomness in nonlocal games between mistrustful players

Carl A. Miller, Yaoyun Shi

If two quantum players at a nonlocal game G achieve a superclassical score, then their measurement outcomes must be at least partially random from the perspective of any third player. This is the basis for device-independent quantum cryptography. In this paper we address a related question: does a superclassical score at G guarantee that one player has created randomness from the perspective of the other player? We show that for complete-support games, the answer is yes: even if the second player is given the first player’s input at the conclusion of the game, he cannot perfectly recover her output. Thus some amount of local randomness (i.e., randomness possessed by only one player) is always obtained when randomness is certified from nonlocal games with quantum strategies. This is in contrast to non-signaling game strategies, which may produce global randomness without any local randomness. We discuss potential implications for cryptographic protocols between mistrustful parties.

arXiv:1706.04984•Quantum Information and Computation•May 1, 2017•8 citations

Quantum non-locality, causality and mistrustful cryptography

Muhammad Nadeem

Here we propose a general relativistic quantum framework for cryptography that exploits the fascinating connection of quantum non-locality and special theory of relativity with cryptography. The underlying principle of unconditional security is causality and two-fold quantum non-local correlations: first entanglement swapping and then teleportation over causally independent entangled systems. We show that the proposed framework has following remarkable and novel features in mistrustful cryptography: (i) It helps in defining a new notion of oblivious transfer where both the data transferred and the transfer position remains oblivious. (ii) The authenticity and integrity of the data transferred is guaranteed by the fundamental principles of quantum theory instead of computational complexity. (iii) It directly leads to unconditionally secure and deterministic two-sided two-party computation which is currently considered to be impossible. (iv) the proposed framework turns out to be asynchronous ideal coin tossing with zero bias which has not been achieved previously. (v) The same framework also implies unconditionally secure bit commitment. Finally, the combination of quantum non-locality and theory of relativity as discussed here can easily be generalized to multiparty setting that could be used to solve other mistrustful cryptographic tasks such as secret sharing and key agreement securely.

arXiv:1407.7025•Jul 25, 2014•11 citations

Chain rules for conditional entropies in quantum cryptography: limitations and improvements

Lewis Wooltorton, Peter Brown, Omar Fawzi

Security proofs in quantum cryptography rely on conditional entropies. In a many-round protocol, their estimation is a challenging task; one must account for the most general attacks by an eavesdropper, including those that are not independently and identically distributed (i.i.d.) across all rounds. Chain rules address this problem by relating the conditional entropy of a structured, but non-i.i.d. process to a sum of entropy contributions from each round. They are a key ingredient in entropy accumulation theorems (EATs), which provide a versatile security proof framework for many protocols in quantum cryptography. Recently, chain rules in the setting of trusted devices have lead to tight i.i.d. reductions at a finite number of rounds, and whether analogous results can be recovered in the device-independent (DI) setting has not been addressed. Surprisingly, we show that a natural tightening of the chain rule of Dupuis et al. [Commun. Math. Phys. 379, 867-913, (2020)] that would answer this question affirmatively cannot hold, highlighting a limitation of the current DI security proof approach. Nonetheless, we show that an intermediate improvement is possible by proving a new chain rule in this setting. Following the framework of Arqand et al. [Phys. Rev. X 15, 041013 (2025)], we use our chain rule to provide a slightly tighter version of the Rényi EAT in certain contexts. In addition, we provide a self-contained framework that unifies existing chain rules and compares their applications, framing our results in a broader context.

quant-pharXiv:2605.29787•May 29, 2026•0 citations
If two quantum players at a nonlocal game G achieve a superclassical score, then their measurement outcomes must be at least partially random from the perspective of any third player. This is the basis for device-independent quantum cryptography. In this paper we address a related question: does a superclassical score at G guarantee that one player has created randomness from the perspective of the other player? We show that for complete-support games, the answer is yes: even if the second player is given the first player’s input at the conclusion of the game, he cannot perfectly recover her output. Thus some amount of local randomness (i.e., randomness possessed by only one player) is always obtained when randomness is certified from nonlocal games with quantum strategies. This is in contrast to non-signaling game strategies, which may produce global randomness without any local randomness. We discuss potential implications for cryptographic protocols between mistrustful parties.
Here we propose a general relativistic quantum framework for cryptography that exploits the fascinating connection of quantum non-locality and special theory of relativity with cryptography. The underlying principle of unconditional security is causality and two-fold quantum non-local correlations: first entanglement swapping and then teleportation over causally independent entangled systems. We show that the proposed framework has following remarkable and novel features in mistrustful cryptography: (i) It helps in defining a new notion of oblivious transfer where both the data transferred and the transfer position remains oblivious. (ii) The authenticity and integrity of the data transferred is guaranteed by the fundamental principles of quantum theory instead of computational complexity. (iii) It directly leads to unconditionally secure and deterministic two-sided two-party computation which is currently considered to be impossible. (iv) the proposed framework turns out to be asynchronous ideal coin tossing with zero bias which has not been achieved previously. (v) The same framework also implies unconditionally secure bit commitment. Finally, the combination of quantum non-locality and theory of relativity as discussed here can easily be generalized to multiparty setting that could be used to solve other mistrustful cryptographic tasks such as secret sharing and key agreement securely.
Security proofs in quantum cryptography rely on conditional entropies. In a many-round protocol, their estimation is a challenging task; one must account for the most general attacks by an eavesdropper, including those that are not independently and identically distributed (i.i.d.) across all rounds. Chain rules address this problem by relating the conditional entropy of a structured, but non-i.i.d. process to a sum of entropy contributions from each round. They are a key ingredient in entropy accumulation theorems (EATs), which provide a versatile security proof framework for many protocols in quantum cryptography. Recently, chain rules in the setting of trusted devices have lead to tight i.i.d. reductions at a finite number of rounds, and whether analogous results can be recovered in the device-independent (DI) setting has not been addressed. Surprisingly, we show that a natural tightening of the chain rule of Dupuis et al. [Commun. Math. Phys. 379, 867-913, (2020)] that would answer this question affirmatively cannot hold, highlighting a limitation of the current DI security proof approach. Nonetheless, we show that an intermediate improvement is possible by proving a new chain rule in this setting. Following the framework of Arqand et al. [Phys. Rev. X 15, 041013 (2025)], we use our chain rule to provide a slightly tighter version of the Rényi EAT in certain contexts. In addition, we provide a self-contained framework that unifies existing chain rules and compares their applications, framing our results in a broader context.