Sciweavers

142 search results - page 5 / 29
» Protocol Algebra
Sort
View
NCA
2008
IEEE
15 years 4 months ago
On the Application of Formal Methods for Specifying and Verifying Distributed Protocols
In this paper we consider the frameworks of Process Algebra and I/O Automata and we apply both towards the verification of a distributed leader-election protocol. Based on the tw...
Marina Gelastou, Chryssis Georgiou, Anna Philippou
CCS
2006
ACM
15 years 1 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
74
Voted
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 5 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
ECCC
2007
144views more  ECCC 2007»
14 years 10 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
SIGCOMM
2003
ACM
15 years 3 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