Sciweavers

1173 search results - page 89 / 235
» On the Compositionality of Round Abstraction
Sort
View
111
Voted
DC
2007
15 years 23 days ago
The overhead of consensus failure recovery
Abstract Many reliable distributed systems are consensusbased and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery m...
Partha Dutta, Rachid Guerraoui, Idit Keidar
102
Voted
JCP
2006
120views more  JCP 2006»
15 years 23 days ago
Password-authenticated Key Exchange using Efficient MACs
Abstract-- This paper is concerned with passwordauthenticated key agreement protocols. Designing such protocols represents an interesting challenge since there is no standard way o...
Maurizio Adriano Strangio
123
Voted
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
14 years 11 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
95
Voted
WDAG
2010
Springer
164views Algorithms» more  WDAG 2010»
14 years 10 months ago
It's on Me! The Benefit of Altruism in BAR Environments
Abstract. Cooperation, a necessity for any peer-to-peer (P2P) cooperative service, is often achieved by rewarding good behavior now with the promise of future benefits. However, in...
Edmund L. Wong, Joshua B. Leners, Lorenzo Alvisi
119
Voted
CISC
2007
Springer
156views Cryptology» more  CISC 2007»
15 years 7 months ago
Deniable Authentication on the Internet
Deniable authentication is a technique that allows one party to send messages to another while the latter can not prove to a third party the fact of communication. In this paper, w...
Shaoquan Jiang