Computational wiretap coding from indistinguishability obfuscation
From MaRDI portal
Publication:6149608
DOI10.1007/978-3-031-38551-3_9MaRDI QIDQ6149608
Paul Lou, Aayush Jain, Amit Sahai, Yuval Ishai, Mark Zhandry
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05) Coding theorems (Shannon theory) (94A24)
Cites Work
- On the security of Goldreich's one-way function
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Pseudorandom generators without the XOR Lemma (extended abstract)
- List decoding algorithms for certain concatenated codes
- The Wire-Tap Channel
- Broadcast channels with confidential messages
- How to Use Indistinguishability Obfuscation: Deniable Encryption, and More
- Capacity Regions of Two New Classes of Two-Receiver Broadcast Channels
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results
- Obfuscation for Evasive Functions
- Indistinguishability obfuscation from well-founded assumptions
- Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computational wiretap coding from indistinguishability obfuscation
