Conference ProceedingsOPEN ACCESS

Robustness for free in unconditional multi-party computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2139 LNCS 101-118
DOI: 10.1007/3-540-44647-8_6
55Citations
Citations of this article
51Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t

Cite

CITATION STYLE

APA

Hirt, M., & Maurer, U. (2001). Robustness for free in unconditional multi-party computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2139 LNCS, pp. 101–118). Springer Verlag. https://doi.org/10.1007/3-540-44647-8_6

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