Must the communication graph of MPC protocols be an expander?

DOI10.1007/978-3-319-96878-0_9zbMath1457.94005MaRDI QIDQ775967

Pavel Hubáček, Elette Boyle, Ran Cohen, Deepesh Data

Publication date: 30 June 2020

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

zbMATH Keywords

Secure multiparty computation on incomplete communication networks

Mathematics Subject Classification ID

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

68M12: Network protocols

94A05: Communication theory

05C48: Expander graphs