227 search results - page 29 / 46 » On the Reachability Problem in Cryptographic Protocols |
TARK
2007
Springer
14 years 1 months ago
2007
Springer
We contend that reasoning about knowledge is both natural and pragmatic for verification of electronic voting protocols. We present a model in which desirable properties of elect...
CRYPTO
2008
Springer
13 years 9 months ago
2008
Springer
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
CAV
2007
Springer
14 years 1 months ago
2007
Springer
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...
SACRYPT
2005
Springer
14 years 1 months ago
2005
Springer
The ability to link two different sightings of the same Radio Frequency Identification (RFID) tag enables invasions of privacy. The problem is aggravated when an item, and the ta...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
To protect against replay attacks, many Internet protocols rely on nonces to guarantee freshness. In practice, the server generates these nonces during the initial handshake, but ...