Zero-communication reductions

DOI10.1007/978-3-030-64381-2_10MaRDI QIDQ2119081zbMATH OpenOpenAlexFDO

Authors Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran

Publication date 23 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-64381-2_10

zbMATH Keywords

lower bound problem for secure \textsc{zcr}lower bounds for OT-complexity

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions
• On the Cryptographic Complexity of the Worst Functions
• Lower Bounds for Oblivious Transfer Reductions
• From private simultaneous messages to zero-information Arthur-Merlin protocols and back
• Zero-knowledge proofs from secure multiparty computation

Cited in

(7)

• Secure non-interactive simulation from arbitrary joint distributions
• Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions
• One-message secure reductions: on the cost of converting correlations
• Secure non-interactive reduction and spectral analysis of correlations
• Secure non-interactive simulation: feasibility and rate
• Non-interference Properties for Data-Type Reduction of Communicating Systems
• Secure non-interactive reducibility is decidable

This page was built for publication: Zero-communication reductions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2119081)