Skip to main content
Conference ProceedingsOPEN ACCESS

Scalable and unconditionally secure multiparty computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4622 LNCS 572-590
DOI: 10.1007/978-3-540-74143-5_32
141Citations
Citations of this article
63Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a multiparty computation protocol that is unconditionally secure against adaptive and active adversaries, with communication complexity O(Cn)k + O(Dn2)k + poly(n/t), where C is the number of gates in the circuit, n is the number of parties, k is the bitlength of the elements of the field over which the computation is carried out, D is the multiplicative depth of the circuit, and k is the security parameter. The corruption threshold is t

Cite

CITATION STYLE

APA

Damgård, I., & Nielsen, J. B. (2007). Scalable and unconditionally secure multiparty computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4622 LNCS, pp. 572–590). Springer Verlag. https://doi.org/10.1007/978-3-540-74143-5_32

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