The price of low communication in secure multi-party computation
From MaRDI portal
Publication:1675733
DOI10.1007/978-3-319-63688-7_14zbMath1407.94107OpenAlexW2734148541MaRDI QIDQ1675733
Rafail Ostrovsky, Vassilis Zikas, Yuval Ishai, Juan A. Garay
Publication date: 3 November 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-63688-7_14
Related Items (7)
YOSO: You only speak once. Secure MPC with stateless ephemeral roles ⋮ Unconditional communication-efficient MPC via Hall's marriage theorem ⋮ Proof-of-reputation blockchain with Nakamoto fallback ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Completeness theorems for adaptively secure broadcast ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ The more the merrier: reducing the cost of large scale MPC
This page was built for publication: The price of low communication in secure multi-party computation
