Towards a completeness result for model checking of security protocols
Journal of Computer Security
Athena: a novel approach to efficient automatic security protocol analysis
Journal of Computer Security
Constraint solving for bounded-process cryptographic protocol analysis
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
A Method for Automatic Cryptographic Protocol Verification
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
On the Reachability Problem in Cryptographic Protocols
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
The AVISS Security Protocol Analysis Tool
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Positive Deduction modulo Regular Theories
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Lazy Infinite-State Analysis of Security Protocols
Proceedings of the International Exhibition and Congress on Secure Networking - CQRE (Secure) '99
Abstracting Cryptographic Protocols with Tree Automata
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Protocol Insecurity with Finite Number of Sessions is NP-Complete
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Compiling and verifying security protocols
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Protocol insecurity with a finite number of sessions and composed keys is NP-complete
Theoretical Computer Science
CDiff: a new reduction technique for constraint-based analysis of security protocols
Proceedings of the 10th ACM conference on Computer and communications security
Strategy for Verifying Security Protocols with Unbounded Message Size
Automated Software Engineering
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
An NP decision procedure for protocol insecurity with XOR
Theoretical Computer Science
An intruder model for verifying liveness in security protocols
Proceedings of the fourth ACM workshop on Formal methods in security
A survey of algebraic properties used in cryptographic protocols
Journal of Computer Security
On the relationships between models in protocol verification
Information and Computation
Metareasoning about Security Protocols using Distributed Temporal Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated Security Protocol Analysis With the AVISPA Tool
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Computer Security - Digital Identity Management (DIM 2007)
Rethinking about guessing attacks
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Distributed temporal logic for the analysis of security protocol models
Theoretical Computer Science
Integrating automated and interactive protocol verification
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
The AVISPA tool for the automated validation of internet security protocols and applications
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Deduction with XOR constraints in security API modelling
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
| Hi-index | 0.00 |
We present a new model for automated verification of security protocols, permitting the use of an unbounded number of protocol runs. We prove its correctness, completeness and also that it terminates. It has been implemented and its efficiency is clearly shown by the number of protocols successfully studied. In particular, we present an attack previously unreported on the Denning-Sacco symmetric key protocol.