In this paper, we propose a new player elimination technique and use it to design an efficient protocol for unconditionally secure multiparty computation tolerating generalized adversaries. Our protocol requires broadcast of O(nL2log(|F|) bits (broadcast is simulated using Byzantine agreement) while the non-cryptographic linear secret sharing based protocols, without player elimination, invoke Byzantine agreement sub-protocol for O(mL3log(|F|) bits, where m is the number of multiplication gates in the arithmetic circuit, over the finite field F, that describes the functionality of the protocol and L is the size of the underlying linear secret sharing scheme tolerating the given adversary structure. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Prabhu, B., Srinathan, K., & Pandu Rangan, C. (2003). Trading players for efficiency in unconditional multiparty computation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2576, 342–353. https://doi.org/10.1007/3-540-36413-7_25
Mendeley helps you to discover research relevant for your work.