scientific article
From MaRDI portal
Publication:3579423
zbMath1192.68083MaRDI QIDQ3579423
Saia Jared, David Kempe, Valerie King, Bruce M. Kapron, Vishal Sanwalani
Publication date: 6 August 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
History, political science (91F10) Distributed systems (68M14) Network protocols (68M12) Social choice (91B14) Authentication, digital signatures and secret sharing (94A62)
Related Items (7)
On the round complexity of randomized Byzantine agreement ⋮ Improved deterministic leader election in diameter-two networks ⋮ Fault-tolerant graph realizations in the congested clique ⋮ On the complexity of asynchronous agreement against powerful adversaries ⋮ Must the communication graph of MPC protocols be an expander? ⋮ From fairness to full security in multiparty computation ⋮ The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement
This page was built for publication:
