Type theory and functional programming
Type theory and functional programming
A note on the use of timestamps as nonces
ACM SIGOPS Operating Systems Review
A calculus for cryptographic protocols
Information and Computation
Secrecy by typing in security protocols
Journal of the ACM (JACM)
Model checking
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Secrecy types for asymmetric communication
Theoretical Computer Science - Foundations of software science and computation structures
Automatic verification of cryptographic protocols: a logic programming approach
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Feasibility of Multi-Protocol Attacks
ARES '06 Proceedings of the First International Conference on Availability, Reliability and Security
| Hi-index | 0.00 |
Security protocol attacks are known to have various sources, from flawed implementations, to running parallel sessions of the same protocol. Because of this attack diversity, it is quite difficult (or impossible) to create an abstract model that is suitable for analyzing a protocol against all possible attacks. However, if we categorize the attacks based on their characteristics we should be able to create multiple abstract models that simplify the analysis. Therefore, in this paper we identify attacks based on message similarities, that we call "structural attacks", and create an abstract model, based on message component types (session keys, nonces, participants), that is powerful enough to capture the structure of security protocol messages.