Secure non-interactive reduction and spectral analysis of correlations
From MaRDI portal
Publication:2170114
DOI10.1007/978-3-031-07082-2_28zbMath1496.94023OpenAlexW4285109940MaRDI QIDQ2170114
Pratyush Agarwal, Varun Narayanan, Mohammad Ali Rehan, Manoj Prabhakaran, Shreya Pathak, Vinod M. Prabhakaran
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-07082-2_28
Related Items
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 Fair Exchange, Fair Coins and Fair Sampling
- On Non-Interactive Simulation of Joint Distributions
- On Sequences of Pairs of Dependent Random Variables
- On measures of dependence
- Cryptography with One-Way Communication
- Founding Cryptography on Oblivious Transfer – Efficiently
- The common information of two dependent random variables
- Non interactive simulation of correlated distributions is decidable
- 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
