Secure non-interactive reducibility is decidable
From MaRDI portal
Publication:6169412
DOI10.1007/978-3-031-22365-5_15zbMath1519.94056MaRDI QIDQ6169412
Varun Narayanan, Kaartik Bhushan, Manoj Prabhakaran, Ankit Kumar Misra
Publication date: 14 August 2023
Published in: Theory of Cryptography (Search for Journal in Brave)
Related Items (3)
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Zero-communication reductions
- Secure non-interactive simulation: feasibility and rate
- Secure non-interactive reduction and spectral analysis of correlations
- A minimal model for secure computation (extended abstract)
- On Non-Interactive Simulation of Joint Distributions
- On Sequences of Pairs of Dependent Random Variables
- Founding Cryptography on Oblivious Transfer – Efficiently
- The common information of two dependent random variables
- The zero-error side information problem and chromatic numbers (Corresp.)
- Non interactive simulation of correlated distributions is decidable
- Foundations of Cryptography
- Analysis of Boolean Functions
- Communication for Generating Correlation: A Unifying Survey
- A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
- On the Cryptographic Complexity of the Worst Functions
- Theory of Cryptography
- Secure non-interactive reducibility is decidable
- Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions
This page was built for publication: Secure non-interactive reducibility is decidable
