Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions

DOI10.1007/978-3-031-22368-6_4zbMATH Open1519.94126MaRDI QIDQ6169552FDOQ6169552

Authors: Saumya Goyal, Varun Narayanan, Manoj Prabhakaran 

Publication date: 14 August 2023

Published in: Theory of Cryptography (Search for Journal in Brave)

Recommendations

• Zero-communication reductions
• Security in Communication Networks
• Efficient oblivious transfer protocols achieving a non-zero rate from any non-trivial noisy correlation
• On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
• Constant-rate oblivious transfer from noisy channels

zbMATH Keywords

lower bounds for OT-complexitylower bound problem for secure zcr

Mathematics Subject Classification ID

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

Cites Work

• On the Cryptographic Complexity of the Worst Functions
• A Zero-One Law for Boolean Privacy
• New Monotones and Lower Bounds in Unconditional Two-Party Computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Secure non-interactive simulation: feasibility and rate
• Secure multi-party computation
• Lower Bounds for Oblivious Transfer Reductions
• On oblivious transfer capacity
• Theory of Cryptography
• Zero-communication reductions
• Cryptography and Coding
• Secure non-interactive reduction and spectral analysis of correlations
• Assisted Common Information With an Application to Secure Two-Party Sampling
• Efficient oblivious transfer protocols achieving a non-zero rate from any non-trivial noisy correlation
• Secure non-interactive reducibility is decidable

Cited In (5)

• Zero-communication reductions
• One-message secure reductions: on the cost of converting correlations
• On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
• Lower Bounds for Oblivious Transfer Reductions
• Secure non-interactive reducibility is decidable

This page was built for publication: Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions

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