An intruder model for verifying liveness in security protocols

Authors:
Jan Cederquist;Mohammad Torabi Dashti
Affiliations:
University of Twente, Enschede, The Netherlands;Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands
Venue:
Proceedings of the fourth ACM workshop on Formal methods in security
Year:
2006

Citing 24
Cited 4

Fairness

Fairness
Temporal reasoning under generalized fairness constraints

3rd annual symposium on theoretical aspects of computer science on STACS 86
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Three logics for branching bisimulation

Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Prudent Engineering Practice for Cryptographic Protocols

IEEE Transactions on Software Engineering
Fairness in electronic commerce

Fairness in electronic commerce
The inductive approach to verifying cryptographic protocols

Journal of Computer Security
Communicating sequential processes

Communications of the ACM
Finite-state analysis of two contract signing protocols

Theoretical Computer Science
Efficient on-the-fly model-checking for regular alternation-free mu-calculus

Science of Computer Programming - Special issure on formal methods for industrial critical systems (FMICS 2000)
Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes

WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Using Smart Cards for Fair Exchange

WELCOM '01 Proceedings of the Second International Workshop on Electronic Commerce
Automated Unbounded Verification of Security Protocols

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
How to prevent type flaw attacks on security protocols

Journal of Computer Security - CSFW13
Defining Liveness

Defining Liveness
The Dolev-Yaho Intruder is the Most Powerful Attacker

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Constraint solving for contract-signing protocols

CONCUR 2005 - Concurrency Theory
Computer-assisted verification of a protocol for certified email

SAS'03 Proceedings of the 10th international conference on Static analysis
On the quest for impartiality: design and analysis of a fair non-repudiation protocol

ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
An intensive survey of fair non-repudiation protocols

Computer Communications
Key agreement in ad hoc networks

Computer Communications
Optimistic fair exchange of digital signatures

IEEE Journal on Selected Areas in Communications
Formal methods for cryptographic protocol analysis: emerging issues and trends

IEEE Journal on Selected Areas in Communications

Nuovo DRM Paradiso: Designing a Secure, Verified, Fair Exchange DRM Scheme

Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Nuovo DRM paradiso: towards a verified fair DRM scheme

FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Nuovo DRM Paradiso: Designing a Secure, Verified, Fair Exchange DRM Scheme

Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Model checking under fairness in proB and its application to fair exchange protocols

ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a process algebraic intruder model for verifying a class of liveness properties of security protocols. For this class, the proposed intruder model is proved to be equivalent to a Dolev-Yao intruder that does not delay indefinitely the delivery of messages. In order to prove the equivalence, we formalize the resilient communication channels assumption. As an application of the proposed intruder model, formal verification of fair exchange protocols is discussed.