Forcing Trust: Nonlocal Games and Untrusted-device Cryptography
summary
Presents a proof that untrusted, multi-part quantum devices yield more output randomness than the small trusted seed produces, achieving exponential randomness expansion with full quantum security, cryptographic error decay and tolerance for constant noise (preliminary noise tolerance ≈1.5% for CHSH). Key tool is forcing trust: algebraic decomposition showing an untrusted binary measurement splits into an anti‑commuting “trusted” part plus noise, enabling a collision/ Rényi‑entropy uncertainty principle and protocols with constant quantum memory and composition for randomness amplification.
AI-written summary · about
chapters (9)
- 0:00Introduction to the topic
- 1:28Background and protocols
- 6:24Robustness challenges
- 11:10Analyzing device behavior
- 14:12Key results and features
- 17:10Forcing trust techniques
- 25:04Mathematical proofs
- 35:23Uncertainty principles
- 42:29Amplification and outlook
related talks
15mWhy TRULY Random Keys Are CRITICAL (and How Quantum Dice Fixes It)
40mPost-quantum Key Exchange—A New Hope
17mProofs of Quantumness from Trapdoor Permutations
58mQuantum 2
01h 04mQuantum 1
20mOn the computational hardness needed for quantum cryptography
28mPost-Quantum Manifesto
48mOn the Computational Hardness Needed for Quantum Cryptography