22 search results - page 2 / 5 » On Byzantine Containment Properties of the $min 1$ Protocol |
PODC
2009
ACM
14 years 6 months ago
2009
ACM
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...
WDAG
2007
Springer
13 years 12 months ago
2007
Springer
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...
IPPS
2005
IEEE
13 years 11 months ago
2005
IEEE
1 Electronic fair-exchange protocols have received significant attention from the research community in the recent past. In loose terms, the fair exchange problem is defined as at...
LICS
2009
IEEE
14 years 12 days ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
CSFW
1999
IEEE
13 years 10 months ago
1999
IEEE
Strand space analysis [13, 12] is a method for stating and proving correctness properties for cryptographic protocols. In this paper we apply the same method to the related proble...