Consider a set of n players who wish to compute the value of a commonly agreed multi-variate function on their local inputs, whilst keeping their local inputs as private as possible even when a non-trivial subset of players collude and behave maliciously. This is the problem of secure multiparty computation. In this work, we present an efficient protocol for asynchronous secure computation tolerating a computationally unbounded Byzantine adversary that corrupts up to t
CITATION STYLE
Prabhu, B., Srinathan, K., & Pandu Rangan, C. (2002). Asynchronous unconditionally secure computation: An efficiency improvement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2551, pp. 93–107). Springer Verlag. https://doi.org/10.1007/3-540-36231-2_9
Mendeley helps you to discover research relevant for your work.