Cryptography from one-way communication: on completeness of finite channels

DOI10.1007/978-3-030-64840-4_22OpenAlexW3110833485MaRDI QIDQ2691601

Shweta Agrawal, Yuval Ishai, Vinod M. Prabhakaran, Manoj Prabhakaran, Alon Rosen, Eyal Kushilevitz, Varun Narayanan

Publication date: 29 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-64840-4_22

zbMATH Keywords

completeness of finite channelsfinite channels enabling zero-knowledge proofs

Mathematics Subject Classification ID

Cryptography (94A60) Communication theory (94A05)

Related Items (5)

Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ Secure non-interactive simulation: feasibility and rate ⋮ Secure non-interactive simulation from arbitrary joint distributions ⋮ 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
• A minimal model for secure computation (extended abstract)
• Oblivious RAMs without cryptogrpahic assumptions
• Semantic Security for the Wiretap Channel
• Efficient Non-interactive Secure Computation
• On the Efficiency of Bit Commitment Reductions
• Cryptography with One-Way Communication
• 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
• Generalized privacy amplification
• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
• Cryptography and Coding
• Extractors and pseudorandom generators
• Security in Communication Networks
• Extracting all the randomness and reducing the error in Trevisan's extractors

This page was built for publication: Cryptography from one-way communication: on completeness of finite channels