Sciweavers

Share
3 search results - page 1 / 1
» An Almost-Surely Terminating Polynomial Protocol for Asynchr...
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
8 years 4 months ago
An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience
Consider an asynchronous system with private channels and n processes, up to t of which may be faulty. We settle a longstanding open question by providing a Byzantine agreement pr...
Ittai Abraham, Danny Dolev, Joseph Y. Halpern
PODC
2009
ACM
9 years 4 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
IACR
2016
43views Biometrics» more  IACR 2016»
3 years 18 days ago
Constant-Round Asynchronous Multi-Party Computation
Secure multi-party computation (MPC) allows several mutually distrustful parties to securely compute a joint function of their inputs and exists in two main variants: In synchrono...
Sandro Coretti, Juan A. Garay, Martin Hirt, Vassil...
books