Secure non-interactive reduction and spectral analysis of correlations
From MaRDI portal
Recommendations
- On the power of correlated randomness in secure computation
- Secure computation using leaky correlations (asymptotically optimal constructions)
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- Secure computation from leaky correlated randomness
- Non-interactive multiparty computation without correlated randomness
- scientific article; zbMATH DE number 1256767
- Secret Key Capacity for Optimally Correlated Sources Under Sampling Attack
- scientific article; zbMATH DE number 1670837
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
Cites work
- A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
- Communication for Generating Correlation: A Unifying Survey
- Cryptography with One-Way Communication
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Founding Cryptography on Oblivious Transfer – Efficiently
- scientific article; zbMATH DE number 4051007 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 3497786 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- scientific article; zbMATH DE number 3019401 (Why is no real title available?)
- Non interactive simulation of correlated distributions is decidable
- On fair exchange, fair coins and fair sampling
- On measures of dependence
- On Non-Interactive Simulation of Joint Distributions
- On Sequences of Pairs of Dependent Random Variables
- On the Cryptographic Complexity of the Worst Functions
- Positivity improving operators and hypercontractivity
- 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
(7)- Secure non-interactive simulation: feasibility and rate
- Secure non-interactive reduction and spectral analysis of correlations
- 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
This page was built for publication: Secure non-interactive reduction and spectral analysis of correlations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170114)
