Skip to main content
Conference ProceedingsOPEN ACCESS

Robust multiparty computation with linear communication complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4117 LNCS 463-482
DOI: 10.1007/11818175_28
32Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a polytime adversary, and allows n parties to actively securely evaluate any poly-sized circuit with resilience t

Cite

CITATION STYLE

APA

Hirt, M., & Nielsen, J. B. (2006). Robust multiparty computation with linear communication complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4117 LNCS, pp. 463–482). Springer Verlag. https://doi.org/10.1007/11818175_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free