Must the communication graph of MPC protocols be an expander?
From MaRDI portal
Publication:775967
DOI10.1007/978-3-319-96878-0_9zbMath1457.94005OpenAlexW2794646065MaRDI QIDQ775967
Elette Boyle, Ran Cohen, Pavel Hubáček, Deepesh Data
Publication date: 30 June 2020
Full work available at URL: https://doi.org/10.1007/978-3-319-96878-0_9
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12) Communication theory (94A05) Expander graphs (05C48)
Related Items (7)
Is information-theoretic topology-hiding computation possible? ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Towards practical topology-hiding computation ⋮ Completeness theorems for adaptively secure broadcast ⋮ Must the communication graph of MPC protocols be an expander? ⋮ From fairness to full security in multiparty computation ⋮ Adaptively secure MPC with sublinear communication complexity
This page was built for publication: Must the communication graph of MPC protocols be an expander?
