NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach
summary
Shows NP‑hardness gaps for concrete meta‑complexity problems: under subexponentially‑secure indistinguishability obfuscation/witness encryption the conditional time‑bounded Kolmogorov complexity Kt(x|y) is NP‑hard to approximate up to essentially optimal (nearly maximal vs polynomially small) gaps in the superlinear time regime; using SNARGs and multilinear‑map style constructions the reductions are syntactic and black‑box; unconditionally proves MOCSP is NP‑hard to approximate with Yes instances of size s and No instances ≥ s^c.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 0:30Joint work
- 0:55Eric Allender
- 1:35First email from Eric
- 3:09Working with Eric
- 7:43NPHardness and Cryptography
- 14:31Cryptographic Objects
- 16:55Conditional MetaComplexity
- 27:57Witness Encryption
- 33:17Proof
- 34:37Encryption
- 37:07Unconditional
- 39:37Secret Sharing
related talks
46mNP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach
01h 06mCrypto + Meta-complexity 1
48mTales of Obfuscation in Bounded Arithmetic, Metacomplexity, and Differential Privacy
01h 05mCryptography and Kolmogorov Complexity: A Quick Tutorial
59mBeyond P versus NP: Using Complexity Theory in Obfuscation and Vice-Versa
47mCapturing One-Way Functions via NP-Hardness of Meta-Complexity
01h 17mCrypto + Meta-complexity 2
49mLower Bounds on the Overhead of Indistinguishability Obfuscation
