Communicating sequential processes
Communicating sequential processes
Using CSP to Detect Errors in the TMN Protocol
IEEE Transactions on Software Engineering
A new family of authentication protocols
ACM SIGOPS Operating Systems Review
Proving security protocols with model checkers by data independence techniques
Journal of Computer Security
Fault-perserving simplifying transformations for security protocols
Journal of Computer Security
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
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
Proving Security Protocols with Model Checkers by Data Independence Techniques
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
The modelling and analysis of security protocols: the csp approach
The modelling and analysis of security protocols: the csp approach
Authenticity in a reliable protocol for mobile computing
Proceedings of the 2003 ACM symposium on Applied computing
A simple framework for real-time cryptographic protocol analysis with compositional proof rules
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
A complete and decidable security-specialised logic and its application to the TESLA protocol
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Embedding agents within the intruder to detect parallel attacks
Journal of Computer Security - Special issue on CSFW15
Verification of the TESLA protocol in MCMAS-X
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Formal Models and Analysis of Secure Multicast in Wired and Wireless Networks
Journal of Automated Reasoning
Modal tableaux for verifying stream authentication protocols
Autonomous Agents and Multi-Agent Systems
A simple language for real-time cryptographic protocol analysis
ESOP'03 Proceedings of the 12th European conference on Programming
A fibred belief logic for multi-agent systems
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Verification of the TESLA protocol in MCMAS-X
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Formal analysis of TESLA protocol in the timed OTS/CafeOBJ method
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: applications and case studies - Volume Part II
| Hi-index | 0.00 |
In this paper, we consider how one can analyse a stream authentication protocol using model checking techniques. In particular, we focus on the Timed Efficient Stream Loss-tolerant Authentication Protocol, TESLA. This protocol differs from the standard class of authentication protocols previously analysed using model checking techniques in the following interesting way: an unbounded stream of messages is broadcast by a sender, making use of an unbounded stream of keys; the authentication of the n-th message in the stream is achieved on receipt of the n + 1-th message. We show that, despite the infinite nature of the protocol, it is possible to build a finite model that correctly captures its behaviour.