Must the Communication Graph of MPC Protocols be an Expander?

ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT III, pp. 243-272, 2018.

Cited by: 5|Bibtex|Views41|DOI:https://doi.org/10.1007/978-3-319-96878-0_9
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com

Abstract:

Secure multiparty computation (MPC) on incomplete communication networks has been studied within two primary models: (1) Where a partial network is fixed a priori, and thus corruptions can occur dependent on its structure, and (2) Where edges in the communication graph are determined dynamically as part of the protocol. Whereas a rich lit...More

Code:

Data:

Your rating :
0

 

Tags
Comments