Sciweavers

403 search results - page 28 / 81
» An algebra for commitment protocols
Sort
View
CCS
2006
ACM
15 years 3 months ago
An intruder model for verifying liveness in security protocols
We present a process algebraic intruder model for verifying a class of liveness properties of security protocols. For this class, the proposed intruder model is proved to be equiv...
Jan Cederquist, Muhammad Torabi Dashti
SOSP
2007
ACM
15 years 8 months ago
Zyzzyva: speculative byzantine fault tolerance
We present Zyzzyva, a protocol that uses speculation to reduce the cost and simplify the design of Byzantine fault tolerant state machine replication. In Zyzzyva, replicas respond...
Ramakrishna Kotla, Lorenzo Alvisi, Michael Dahlin,...
TKDE
1998
102views more  TKDE 1998»
14 years 11 months ago
Database Migration: A New Architecture for Transaction Processing in Broadband Networks
—Due to recent developments in network technologies, broader channel bandwidth is becoming prevalent in worldwide networks. As one of the new technologies making good use of such...
Takahiro Hara, Kaname Harumoto, Masahiko Tsukamoto...
83
Voted
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 6 months ago
On the algebraic numbers computable by some generalized Ehrenfest urns
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
Marie Albenque, Lucas Gerin
SIGCOMM
2003
ACM
15 years 5 months ago
Network routing with path vector protocols: theory and applications
Path vector protocols are currently in the limelight, mainly because the inter-domain routing protocol of the Internet, BGP (Border Gateway Protocol), belongs to this class. In th...
João L. Sobrinho