Sciweavers

23 search results - page 2 / 5
» Leakage Tolerant Interactive Protocols
Sort
View
ICDCS
1998
IEEE
13 years 9 months ago
Low-Overhead Protocols for Fault-Tolerant File Sharing
In this paper, we quantify the adverse effect of file sharing on the performance of reliable distributed applications. We demonstrate that file sharing incurs significant overhead...
Lorenzo Alvisi, Sriram Rao, Harrick M. Vin
ECCC
2010
93views more  ECCC 2010»
13 years 4 months ago
Towards Coding for Maximum Errors in Interactive Communication
We show that it is possible to encode any communication protocol between two parties so that the protocol succeeds even if a (1/4 − ǫ) fraction of all symbols transmitted by th...
Mark Braverman, Anup Rao
WDAG
2007
Springer
79views Algorithms» more  WDAG 2007»
13 years 11 months ago
A Simple Population Protocol for Fast Robust Approximate Majority
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
Dana Angluin, James Aspnes, David Eisenstat
ASIACRYPT
2000
Springer
13 years 9 months ago
Round-Efficient Conference Key Agreement Protocols with Provable Security
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
Wen-Guey Tzeng, Zhi-Jia Tzeng
WDAG
2007
Springer
103views Algorithms» more  WDAG 2007»
13 years 11 months ago
Probabilistic Opaque Quorum Systems
Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocol...
Michael G. Merideth, Michael K. Reiter