Sciweavers

554 search results - page 6 / 111
» Verifying Security Protocols Modelled by Networks of Automat...
Sort
View
CSFW
1995
IEEE
15 years 1 months ago
Modelling and verifying key-exchange protocols using CSP and FDR
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...
A. W. Roscoe
CSFW
2002
IEEE
15 years 2 months ago
Strand Spaces and Rank Functions: More than Distant Cousins
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...
James Heather
COMPSAC
2003
IEEE
15 years 2 months ago
Facilitating Secure Ad hoc Service Discovery in Public Environments
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...
Feng Zhu, Matt W. Mutka, Lionel M. Ni
SAINT
2003
IEEE
15 years 2 months ago
Distributed Authentication for Peer-to-Peer Networks
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...
Shardul Gokhale, Partha Dasgupta
IEEEARES
2007
IEEE
15 years 3 months ago
A Practical Verifiable e-Voting Protocol for Large Scale Elections over a Network
We propose a practical verifiable e-voting protocol which guarantees e-voting requirements: privacy, eligibility, uniqueness, uncoercibility, fairness, accuracy, robustness, indiv...
Orhan Cetinkaya, Ali Doganaksoy