Best of both worlds in secure computation, with low communication overhead

DOI10.1007/978-3-319-93387-0_18zbMath1440.94051OpenAlexW2805624306MaRDI QIDQ1656049

Daniel Genkin, S. Dov Gordon, Samuel Ranellucci

Publication date: 10 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-93387-0_18

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Related Items (1)

On the exact round complexity of best-of-both-worlds multi-party computation

This page was built for publication: Best of both worlds in secure computation, with low communication overhead