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_5zbMATH Open1486.94074OpenAlexW3189172804MaRDI QIDQ2128558FDOQ2128558
Authors: Shweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran, Alon Rosen 
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_5
Recommendations
Cites Work
- scientific article; zbMATH DE number 1559565 (Why is no real title available?)
- scientific article; zbMATH DE number 815575 (Why is no real title available?)
- scientific article; zbMATH DE number 3198427 (Why is no real title available?)
- scientific article; zbMATH DE number 7650430 (Why is no real title available?)
- A minimal model for secure computation (extended abstract)
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- Candidate iO from homomorphic encryption schemes
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate obfuscation via oblivious LWE sampling
- Computationally Sound Proofs
- Constant-rate oblivious transfer from noisy channels
- Cryptography and Coding
- Cryptography from one-way communication: on completeness of finite channels
- Cryptography with One-Way Communication
- Families of Non-disjoint subsets
- Founding Cryptography on Tamper-Proof Hardware Tokens
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Generalized privacy amplification
- Indistinguishability obfuscation from circular security
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Interactive PCP
- Interactive locking, zero-knowledge PCPs, and unconditional cryptography
- Languages with efficient zero-knowledge PCPs are in SZK
- Oblivious Transfer from Weak Noisy Channels
- On Best-Possible Obfuscation
- On Efficient Zero-Knowledge PCPs
- On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
- On the (im)possibility of obfuscating programs
- On the efficiency of bit commitment reductions
- One-Time Programs
- Physical-layer security. From information theory to security engineering
- Privacy Amplification by Public Discussion
- Return of GGH15: provable security against zeroizing attacks
- Secret-sharing for NP
- Secure Obfuscation in a Weak Multilinear Map Model
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- Security in Communication Networks
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- The Wire-Tap Channel
- The random oracle methodology, revisited.
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Zero knowledge protocols from succinct constraint detection
Cited In (10)
- Computational wiretap coding from indistinguishability obfuscation
- The pseudorandom oracle model and ideal obfuscation
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- Secure computation from elastic noisy channels
- Communication complexity of secure distributed computation in the presence of noise
- One-message secure reductions: on the cost of converting correlations
- Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
- Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation
- Secure non-interactive reduction and spectral analysis of correlations
- Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation
This page was built for publication: Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128558)
