Black-Hole Radiation Decoding as a Cryptographic Assumption

Published on ● Video Link: https://www.youtube.com/watch?v=4xNk3B-4TKs



Duration: 47:20
299 views
9


Zvika Brakerski (Weizmann Institute of Science)
https://simons.berkeley.edu/talks/zvika-brakersky-weizmann-institute-science-2023-05-05
Minimal Complexity Assumptions for Cryptography

(Based on https://arxiv.org/abs/2211.05491)

We propose to study equivalence relations between phenomena in high-energy physics and the existence of standard cryptographic primitives, and show the first example where such an equivalence holds. A small number of prior works showed that high-energy phenomena \emph{can be explained} by cryptographic hardness. Examples include using the existence of one-way functions to explain the hardness of decoding black-hole Hawking radiation (Harlow and Hayden 2013, Aaronson 2016), and using pseudorandom quantum states to explain the hardness of computing AdS/CFT dictionary (Bouland, Fefferman and Vazirani, 2020).

In this work we show, for the former example of black-hole radiation decoding, that it also \emph{implies} the existence of secure quantum cryptography. In fact, we show an existential equivalence between the hardness of black-hole radiation decoding and a variety of cryptographic primitives, including bit-commitment schemes and oblivious transfer protocols (using quantum communication). This can be viewed (with proper disclaimers, as we discuss) as providing a physical justification for the existence of secure cryptography. We conjecture that such connections may be found in other high-energy physics phenomena.




Other Videos By Simons Institute for the Theory of Computing


2023-05-23Secure Distributed Matrix Multiplication
2023-05-23On the Robustness to Misspecification of α-Posteriors and Their Variational Approximations
2023-05-23Majorizing Measures, Codes, and Information
2023-05-22KEYNOTE: A (Con)Sequential View of Information for Statistical Learning and Optimization
2023-05-06Black-Box Separations in Quantum Cryptography *Presented Virtually
2023-05-06Quantum pseudorandomness in Algorithmica, and its implications to cryptography and complexity
2023-05-06On the Computational Hardness Needed for Quantum Cryptography
2023-05-06Commitments to Quantum States
2023-05-06Quantum Minimalism
2023-05-05Cryptography with Certified Deletion *Presented Virtually
2023-05-05Black-Hole Radiation Decoding as a Cryptographic Assumption
2023-05-05Geometry of Secure Computation
2023-05-05Collision-Resistance from Multi-Collision-Resistance
2023-05-05New Ways to Garble Arithmetic Circuits
2023-05-05Unclonable Polymers and Their Cryptographic Applications
2023-05-05Batch Proofs are Statistically Hiding
2023-05-05Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography
2023-05-04Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE
2023-05-04Assumptions in cryptography and complexity theory
2023-05-04Mutual Empowerment Between Circuit Obfuscation and Circuit Minimization
2023-05-04Tales of Obfuscation in Bounded Arithmetic, Metacomplexity, and Differential Privacy



Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Minimal Complexity Assumptions for Cryptography
Zvika Brakersky