One-Message Secure Reductions: On the Cost of Converting Correlations

ePrint Report: One-Message Secure Reductions: On the Cost of Converting Correlations

Yuval Ishai, Mahimna Kelkar, Varun Narayanan, Liav Zafar

Correlated secret randomness is a useful resource for secure computation protocols, often enabling dramatic speedups compared to protocols in the plain model. This has motivated a line of work on identifying and securely generating useful correlations.


Different kinds of correlations can vary greatly in terms of usefulness and ease of generation. While there has been major progress on efficiently generating oblivious …

computation cost eprint report message protocols randomness report secret secure computation work