Impossibility of adversarial self-testing and secure sampling

Abstract

Self-testing is the task where spatially separated Alice and Bob cooperate to deduce the inner workings of untrusted quantum devices by interacting with them in a classical manner. We examine the task above where Alice and Bob do not trust each other which we call adversarial self-testing. We show that adversarial self-testing implies secure sampling -- a simpler task that we introduce where distrustful Alice and Bob wish to sample from a joint probability distribution with the guarantee that an honest party's marginal is not biased. By extending impossibility results in two-party quantum cryptography, we give a simple proof that both of these tasks are impossible in all but trivial settings.

Substantial revision. 6 pages, 2 Figures

References in corpus (15)

• Device-independent security of quantum cryptography against collective attacks
• Device-independent quantum key distribution secure against collective attacks
• Finite-key analysis for measurement-device-independent quantum key distribution
• All Pure Bipartite Entangled States can be Self-Tested
• Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible
• Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
• Device-independent entanglement certification of all entangled states
• Fully Distrustful Quantum Cryptography
• Minimum Dimension of a Hilbert Space Needed to Generate a Quantum Correlation
• Quantum dice rolling: A multi-outcome generalization of quantum coin flipping
• A generalization of the CHSH inequality self-testing maximally entangled states of any local dimension
• Self-testing of a single quantum device under computational assumptions
• A device-independent protocol for XOR oblivious transfer
• Parallel Self-Testing of the GHZ State with a Proof by Diagrams
• Randomness in nonlocal games between mistrustful players