117 search results - page 2 / 24 » Anti-Sniffing in Unbounded Networks |
75
Voted
STOC
2002
ACM
15 years 10 months ago
2002
ACM
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
CSFW
2000
IEEE
15 years 1 months ago
2000
IEEE
Schneider's work on rank functions [14] provides a formal approach to verification of certain properties of a security protocol. However, he illustrates the approach only wit...
CCS
2008
ACM
14 years 11 months ago
2008
ACM
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
73
Voted
CSFW
2002
IEEE
15 years 2 months ago
2002
IEEE
The strand spaces model and the rank functions model have both been used successfully to analyse and verify security protocols running on unbounded networks. At first sight, thes...
ACTA
2010
14 years 9 months ago
2010
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...