554 search results - page 6 / 111 » Verifying Security Protocols Modelled by Networks of Automat... |
CSFW
1995
IEEE
13 years 11 months ago
1995
IEEE
We discuss the issues involved in modelling and verifying key-exchange protocols within the framework of CSP and its model-checking tool FDR. Expressing such protocols within a pr...
21
Voted
CSFW
2002
IEEE
14 years 18 days 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...
COMPSAC
2003
IEEE
14 years 28 days ago
2003
IEEE
Securely accessing unfamiliar services in public environments using ad hoc wireless networks is challenging. We present a proxy-based approach that uses other existing network cha...
SAINT
2003
IEEE
14 years 28 days ago
2003
IEEE
A public key infrastructure is generally (and effectively) used for cryptographically secure authentication in the networks. Ad-hoc networks are formed in haphazard manner. Securi...
IEEEARES
2007
IEEE
14 years 1 months ago
2007
IEEE
We propose a practical verifiable e-voting protocol which guarantees e-voting requirements: privacy, eligibility, uniqueness, uncoercibility, fairness, accuracy, robustness, indiv...