Zero-communication reductions

DOI10.1007/978-3-030-64381-2_10zbMath1485.94112OpenAlexW3114150965MaRDI QIDQ2119081

Manoj Prabhakaran, Varun Narayanan, 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

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

Related Items (6)

Secure non-interactive simulation: feasibility and rate ⋮ Secure non-interactive reduction and spectral analysis of correlations ⋮ Secure non-interactive simulation from arbitrary joint distributions ⋮ Secure non-interactive reducibility is decidable ⋮ Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions ⋮ One-message secure reductions: on the cost of converting correlations

This page was built for publication: Zero-communication reductions