Black-Hole Radiation Decoding as a Cryptographic Assumption
summary
Claims an existential equivalence between the hardness of decoding Hawking radiation and the existence of basic quantum cryptography, showing hardness of the black‑hole radiation decoding problem implies and is implied by EFI/non-interactive statistically binding commitments and related primitives like oblivious transfer using quantum communication. Proof techniques use complexity separations (SZK vs BQP style assumptions), a reduction via quantum one-time pad and superdense‑coding/teleportation arguments, and constructions showing commitments make R and B computationally productlike while hard decoding yields indistinguishable but statistically far state ensembles.
AI-written summary · about
chapters (7)
- 0:00Physical basis for crypto
- 4:47Black holes and information
- 7:46Entanglement and paradoxes
- 13:55The firewall thought experiment
- 20:51Decoding radiation
- 27:45Cryptographic equivalences
- 38:08Final thoughts and outlook
related talks
20mOn the computational hardness needed for quantum cryptography
43mCode-based Cryptography
49mQuantum Cryptanalysis
21mQuantum Proofs of Deletion for Learning with Errors
01h 12mQuantum Rewinding Tutorial, Part 1: Motivation and Early Rewinding Techniques
32mQuantum Obfuscation of Classical Circuits
16mQuantum Information Meets Cryptography
12mOne-Way Functions Imply Secure Computation in a Quantum World