An Intelligent Intruder Model for Security Protocol Analysis

Authors:
Dongxi Liu;Xiaoyong Li;Yingcai Bai
Affiliations:
-;-;-
Venue:
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Year:
2001

Citing 10
Cited 0

An attack on the Needham-Schroeder public-key authentication protocol

Information Processing Letters
Prudent Engineering Practice for Cryptographic Protocols

IEEE Transactions on Software Engineering
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Using state space exploration and a natural deduction style message derivation engine to verify security protocols

PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Proving Properties of Security Protocols by Induction

CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
A Meta-Notation for Protocol Analysis

CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Athena: a New Efficient Automatic Checker for Security Protocol Analysis

CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Automated analysis of cryptographic protocols using Mur/spl phi/

SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Fast, automatic checking of security protocols

WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
Finite-state analysis of SSL 3.0

SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7

Quantified Score

Hi-index	0.00

Visualization

Abstract

An intelligent intruder model is proposed in this paper. Except for the algebraic abilities to process messages like the Dolev-Yao intruder, it can decide when to generate what terms and whether or not to launch a new session, which principal to choose, and what roles the principal will play based on some strand-added rules. By this heuristic method, we can get a finite state space without the explicit configuration needed by most model checking tools.