Skip to main content
Conference ProceedingsOPEN ACCESS

Efficient multi-party computation with dispute control

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3876 LNCS 305-328
DOI: 10.1007/11681878_16
57Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an (active or passive) adversary. In the information-theoretic model MPC is possible if and only if t

Cite

CITATION STYLE

APA

Beerliova-Trubiniova, Z., & Hirt, M. (2006). Efficient multi-party computation with dispute control. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3876 LNCS, pp. 305–328). https://doi.org/10.1007/11681878_16

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