Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
From MaRDI portal
Publication:2128558
DOI10.1007/978-3-030-84245-1_5zbMath1486.94074OpenAlexW3189172804MaRDI QIDQ2128558
Varun Narayanan, Alon Rosen, Eyal Kushilevitz, Yuval Ishai, Manoj Prabhakaran, Vinod M. Prabhakaran, Shweta Agrawal
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_5
Related Items
Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration, Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation, The pseudorandom oracle model and ideal obfuscation, Computational wiretap coding from indistinguishability obfuscation, Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation, One-message secure reductions: on the cost of converting correlations, Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Return of GGH15: provable security against zeroizing attacks
- Zero knowledge protocols from succinct constraint detection
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Candidate iO from homomorphic encryption schemes
- Candidate obfuscation via oblivious LWE sampling
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Secret-sharing for NP
- Cryptography from one-way communication: on completeness of finite channels
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- A minimal model for secure computation (extended abstract)
- On Efficient Zero-Knowledge PCPs
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- The random oracle methodology, revisited
- On the Efficiency of Bit Commitment Reductions
- Secure Obfuscation in a Weak Multilinear Map Model
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Cryptography with One-Way Communication
- Interactive PCP
- Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
- On Best-Possible Obfuscation
- One-Time Programs
- Oblivious Transfer from Weak Noisy Channels
- Privacy Amplification by Public Discussion
- The Wire-Tap Channel
- On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
- Computationally Sound Proofs
- Generalized privacy amplification
- Languages with Efficient Zero-Knowledge PCPs are in SZK
- Constant-Rate Oblivious Transfer from Noisy Channels
- On the (im)possibility of obfuscating programs
- Cryptography and Coding
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Security in Communication Networks
- Families of Non-disjoint subsets
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation from circular security
