Sciweavers

401 search results - page 31 / 81
» Formal Analysis of Meeting Protocols
Sort
View
CSFW
1997
IEEE
14 years 3 months ago
Verifying authentication protocols with CSP
This paper presents a general approach for analysis and veri cation of authentication properties in the language of Communicating Sequential Processes (CSP). It is illustrated by ...
Steve Schneider
SASN
2003
ACM
14 years 4 months ago
Modeling vulnerabilities of ad hoc routing protocols
The purpose of this work is to automate the analysis of ad hoc routing protocols in the presence of attackers. To this end, a formal model of protocol behavior is developed in whi...
Shahan Yang, John S. Baras
INFOCOM
2003
IEEE
14 years 4 months ago
Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks
Abstract— Traditionally, reliable multicast protocols are deterministic in nature. It is precisely this determinism that tends to become their limiting factor when aiming at reli...
Jun Luo, Patrick Th. Eugster, Jean-Pierre Hubaux
ASIACRYPT
2009
Springer
14 years 5 months ago
Security Notions and Generic Constructions for Client Puzzles
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan...
DAGSTUHL
2003
14 years 5 days ago
Operational Semantics of Security Protocols
Based on a concise domain analysis we develop a formal semantics of security protocols. Its main virtue is that it is a generic model, in the sense that it is parameterized over e...
Cas J. F. Cremers, Sjouke Mauw