Sciweavers

35 search results - page 3 / 7
» A Formal Analysis for Capturing Replay Attacks in Cryptograp...
Sort
View
CSFW
2002
IEEE
14 years 22 days ago
Capturing Parallel Attacks within the Data Independence Framework
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 ...
Philippa J. Broadfoot, A. W. Roscoe
ISICT
2003
13 years 9 months ago
Analysis of a mobile communication security protocol
: Cryptographic protocols are used to achieve secure communication over insecure networks. Weaknesses in such protocols are hard to identify, as they can be the result of subtle de...
Tom Coffey, Reiner Dojen
NDSS
2000
IEEE
14 years 4 days ago
Analysis of a Fair Exchange Protocol
We analyze an optimistic contract signing protocol of Asokan, Shoup, and Waidner as a case study in the applicability of formal methods to verification of fair exchange protocols...
Vitaly Shmatikov, John C. Mitchell
CCS
2008
ACM
13 years 9 months ago
Using rhythmic nonces for puzzle-based DoS resistance
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 ...
Ellick Chan, Carl A. Gunter, Sonia Jahid, Evgeni P...
TYPES
2004
Springer
14 years 1 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento