Secure non-interactive simulation: feasibility and rate
From MaRDI portal
Recommendations
- Secure non-interactive simulation from arbitrary joint distributions
- On the power of correlated randomness in secure computation
- Secure non-interactive reduction and spectral analysis of correlations
- Secure non-interactive reducibility is decidable
- Concurrently composable non-interactive secure computation
Cites work
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 3497786 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
- A new approach to practical active-secure two-party computation
- Analysis of Boolean Functions
- Coin flipping from a cosmic source: On error correction of truly random bits
- Cryptography from one-way communication: on completeness of finite channels
- Cryptography with One-Way Communication
- Dimension Reduction for Polynomials over Gaussian Space and Applications
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- LATIN 2004: Theoretical Informatics
- Limits of random oracles in secure computation (extended abstract)
- More general completeness theorems for secure two-party computation
- Multiparty Computation from Somewhat Homomorphic Encryption
- Non interactive simulation of correlated distributions is decidable
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
- On Extracting Common Random Bits From Correlated Sources
- On Extracting Common Random Bits From Correlated Sources on Large Alphabets
- On Non-Interactive Simulation of Joint Distributions
- On Sequences of Pairs of Dependent Random Variables
- On reverse hypercontractivity
- On the Cryptographic Complexity of the Worst Functions
- On the power of public-key encryption in secure computation
- Positivity improving operators and hypercontractivity
- Secure multi-party computation
- Secure non-interactive reduction and spectral analysis of correlations
- Spreading of sets in product spaces and hypercontraction of the Markov operator
- The common information of two dependent random variables
- Theory of Cryptography
- Zero-communication reductions
Cited in
(8)- Secure non-interactive simulation from arbitrary joint distributions
- Oblivious transfer with constant computational overhead
- On the relationships between notions of simulation-based security
- Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions
- Simulation based security in the applied pi calculus
- One-message secure reductions: on the cost of converting correlations
- Non-black-box simulation from one-way functions and applications to resettable security
- Secure non-interactive reducibility is decidable
This page was built for publication: Secure non-interactive simulation: feasibility and rate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170112)
