147 search results - page 23 / 30 » An intruder model for verifying liveness in security protoco... |
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
116
click to vote
ASIACRYPT
2008
Springer
15 years 3 months ago
2008
Springer
Optimistic fair exchange (OFE) is a protocol for solving the problem of exchanging items or services in a fair manner between two parties, a signer and a verifier, with the help o...
139
Voted
CSFW
2006
IEEE
15 years 7 months ago
2006
IEEE
We describe a faithful embedding of the Dolev-Yao model of Backes, Pfitzmann, and Waidner (CCS 2003) in the theorem prover Isabelle/HOL. This model is cryptographically sound in ...
122
click to vote
PERCOM
2004
ACM
16 years 1 months ago
2004
ACM
: Service Discovery as an essential element in pervasive computing environments is widely accepted. Much active research on service discovery has been conducted, but privacy has be...
151
click to vote
CSFW
2002
IEEE
15 years 6 months ago
2002
IEEE
We carry forward the work described in our previous papers [3, 14, 12] on the application of data independence to the model checking of cryptographic protocols using CSP [13] and ...