Secure non-interactive simulation: feasibility and rate

DOI10.1007/978-3-031-07082-2_27zbMath1497.68214OpenAlexW4285199878MaRDI QIDQ2170112

Hemanta K. Maji, Hamidreza Amini Khorasgani, Hai H. Nguyen

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-07082-2_27

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Related Items

Secure non-interactive simulation from arbitrary joint distributions ⋮ Oblivious transfer with constant computational overhead ⋮ 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

Uses Software

• FairplayMP

Cites Work

• Positivity improving operators and hypercontractivity
• Spreading of sets in product spaces and hypercontraction of the Markov operator
• Efficient pseudorandom correlation generators from ring-LPN
• Zero-communication reductions
• Secure non-interactive reduction and spectral analysis of correlations
• Efficient pseudorandom correlation generators: silent OT extension and more
• On reverse hypercontractivity
• Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
• Cryptography from one-way communication: on completeness of finite channels
• Multiparty Computation from Somewhat Homomorphic Encryption
• A New Approach to Practical Active-Secure Two-Party Computation
• On Non-Interactive Simulation of Joint Distributions
• On Extracting Common Random Bits From Correlated Sources on Large Alphabets
• Limits of random oracles in secure computation
• More general completeness theorems for secure two-party computation
• On Sequences of Pairs of Dependent Random Variables
• Cryptography with One-Way Communication
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• The common information of two dependent random variables
• Non interactive simulation of correlated distributions is decidable
• Dimension Reduction for Polynomials over Gaussian Space and Applications
• Analysis of Boolean Functions
• On Extracting Common Random Bits From Correlated Sources
• Coin flipping from a cosmic source: On error correction of truly random bits
• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
• On the Power of Public-Key Encryption in Secure Computation
• On the Cryptographic Complexity of the Worst Functions
• LATIN 2004: Theoretical Informatics
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item