One-message secure reductions: on the cost of converting correlations

DOI10.1007/978-3-031-38557-5_17OpenAlexW4385654439MaRDI QIDQ6186603

Liav Zafar, Varun Narayanan, Mahimna Kelkar, Yuval Ishai

Publication date: 2 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38557-5_17

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Function secret sharing for mixed-mode and fixed-point secure computation
• Efficient pseudorandom correlation generators from ring-LPN
• Zero-communication reductions
• Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
• Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
• MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
• Secure non-interactive simulation: feasibility and rate
• Secure non-interactive reduction and spectral analysis of correlations
• Secure computation with preprocessing via function secret sharing
• Efficient pseudorandom correlation generators: silent OT extension and more
• Cryptography from one-way communication: on completeness of finite channels
• Multiparty Computation from Somewhat Homomorphic Encryption
• On Non-Interactive Simulation of Joint Distributions
• Communication with Imperfectly Shared Randomness
• Semi-homomorphic Encryption and Multiparty Computation
• On Sequences of Pairs of Dependent Random Variables
• Cryptography with One-Way Communication
• Founding Cryptography on Oblivious Transfer – Efficiently
• The Wire-Tap Channel
• Common randomness in information theory and cryptography. II. CR capacity
• Resource-Efficient Common Randomness and Secret-Key Schemes
• Non interactive simulation of correlated distributions is decidable
• Communication for Generating Correlation: A Unifying Survey
• On Extracting Common Random Bits From Correlated Sources
• Tight bounds for communication-assisted agreement distillation
• Elements of Information Theory
• Secure non-interactive simulation from arbitrary joint distributions
• Correlated pseudorandomness from expand-accumulate codes
• Secure non-interactive reducibility is decidable
• Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions

This page was built for publication: One-message secure reductions: on the cost of converting correlations