Sciweavers

111 search results - page 4 / 23
» Communication Optimal Multi-valued Asynchronous Broadcast Pr...
Sort
View
139
Voted
ASIACRYPT
2005
Springer
15 years 11 months ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen
DSN
2002
IEEE
15 years 10 months ago
Secure Intrusion-tolerant Replication on the Internet
This paper describes a Secure INtrusion-Tolerant Replication Architecture1 (SINTRA) for coordination in asynchronous networks subject to Byzantine faults. SINTRA supplies a number...
Christian Cachin, Jonathan A. Poritz
SP
2010
IEEE
156views Security Privacy» more  SP 2010»
15 years 3 months ago
Round-Efficient Broadcast Authentication Protocols for Fixed Topology Classes
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
Haowen Chan, Adrian Perrig
DSN
2006
IEEE
15 years 12 months ago
One-step Consensus with Zero-Degradation
In the asynchronous distributed system model, consensus is obtained in one communication step if all processes propose the same value. Assuming f < n/3, this is regardless of t...
Dan Dobre, Neeraj Suri
ICDCS
2009
IEEE
16 years 2 months ago
Implementing a Register in a Dynamic Distributed System
Providing distributed processes with concurrent objects is a fundamental service that has to be offered by any distributed system. The classical shared read/write register is one ...
Roberto Baldoni, Silvia Bonomi, Anne-Marie Kermarr...