Computational Wiretap Coding from Indistinguishability Obfuscation

on YouTube ↗32m

" summary

Construction shows: under standard sub-exponential assumptions that imply indistinguishability obfuscation plus injective PRGs, every non-degraded binary-input channel pair admits a computational wiretap code. The implementation builds a Hamming-ball obfuscated encoder using a new PRG with self-correction (code-offset + list-decodable code) and argues security by iO hybrids; it handles the BSC 0.1 vs BEC 0.3 teaser (e ＞ 2p) and reduces arbitrary binary pairs to BAC/BAEC via a new polytope characterization of degradation.

AI-written summary · about

" chapters (8)

1. 0:00Computational wiretap coding intro
2. 2:28Coding theory special instance
3. 7:21Wiretap coding feasibility
4. 10:29Symmetric case construction
5. 18:29Self-correcting PRG details
6. 23:12Asymmetric channel reduction
7. 26:28Degradation polytope characterization
8. 30:14Open problems and future

" related talks

• 01h 09mNoisy Connections: A Survey of Interactive Coding and Its Borders with Other TopicsAllison Bishop · The Mathematics of Modern Cryptography
• 01h 04mTutorial on obfuscationRachel Lin · Minimal Complexity Assumptions for Cryptography 2023
• 50mApplications of Obfuscation IICraig Gentry · Cryptography Boot Camp 2015
• 01h 26mObfuscation 1Amit Sahai · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 01h 12mApplications of Obfuscation ICraig Gentry · Cryptography Boot Camp 2015
• 31mObfuscation of Probabilistic Circuits and ApplicationsHuijia Lin · Securing Computation (Simons Institute, June 2015)
• 38mRecent Advances on Foundations of Program ObfuscationRachel Lin · Lattices: New Cryptographic Capabilities 2020
• 52mIndistinguishability Obfuscation via Mathematical Proofs of EquivalenceZhengzhong Jin · Proof Complexity and Meta-Mathematics 2023