SOSP '89 Proceedings of the twelfth ACM symposium on Operating systems principles
An attack on the Needham-Schroeder public-key authentication protocol
Information Processing Letters
Secrecy by typing in security protocols
Journal of the ACM (JACM)
Theoretical Computer Science
Verifying security protocols with Brutus
ACM Transactions on Software Engineering and Methodology (TOSEM)
Validating firewalls using flow logics
Theoretical Computer Science
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
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
Reasoning about Security in Mobile Ambients
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Nordic Journal of Computing
Flow logic: a multi-paradigmatic approach to static analysis
The essence of computation
Authenticity by typing for security protocols
Journal of Computer Security - Special issue on CSFW14
A calculus for control flow analysis of security protocols
International Journal of Information Security - Special issue on security in global computing
Static validation of security protocols
Journal of Computer Security
| Hi-index | 0.00 |
Validating security protocols is a well-known hard problem even in a simple setting of a single global network. But a real network often consists of, besides the public-accessed part, several sub-networks and thereby forms a hierarchical structure. In this paper we first present a process calculus capturing the characteristics of hierarchical networks and describe the behavior of protocols on such networks. We then develop a static analysis to automate the validation. Finally we demonstrate how the technique can benefit the protocol development and the design of network systems by presenting a series of experiments we have conducted.