ACM Transactions on Computer Systems (TOCS)
Inductive analysis of the Internet protocol TLS
ACM Transactions on Information and System Security (TISSEC)
Strand spaces: proving security protocols correct
Journal of Computer Security
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Athena: a novel approach to efficient automatic security protocol analysis
Journal of Computer Security
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
An Improved Constraint-Based System for the Verification of Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Casper: A Compiler for the Analysis of Security Protocols
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Authenticity by tagging and typing
Proceedings of the 2004 ACM workshop on Formal methods in security engineering
Feasibility of Multi-Protocol Attacks
ARES '06 Proceedings of the First International Conference on Availability, Reliability and Security
Static validation of security protocols
Journal of Computer Security
Information and Computation
Skeletons, Homomorphisms, and Shapes: Characterizing Protocol Executions
Electronic Notes in Theoretical Computer Science (ENTCS)
Causality-based Abstraction of Multiplicity in Security Protocols
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
SAT-based model-checking for security protocols analysis
International Journal of Information Security
Operational semantics of security protocols
SMTT'03 Proceedings of the 2003 international conference on Scenarios: models, Transformations and Tools
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Validating Integrity for the Ephemerizer's Protocol with CL-Atse
Formal to Practical Security
Comparing State Spaces in Automatic Security Protocol Analysis
Formal to Practical Security
Implementation and performance evaluation of the RSEP protocol on ARM and intel platforms
Proceedings of the 3rd international conference on Security of information and networks
Degrees of security: protocol guarantees in the face of compromising adversaries
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Modeling and analyzing security in the presence of compromising adversaries
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
International Journal of Applied Cryptography
Rethinking about guessing attacks
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Type-based automated verification of authenticity in asymmetric cryptographic protocols
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Managing trust and secrecy in identity management clouds
Proceedings of the 2012 ACM Workshop on Cloud computing security workshop
Using automated model analysis for reasoning about security of web protocols
Proceedings of the 28th Annual Computer Security Applications Conference
Smart keys for cyber-cars: secure smartphone-based NFC-enabled car immobilizer
Proceedings of the third ACM conference on Data and application security and privacy
From security protocols to pushdown automata
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Establishing and preserving protocol security goals
Journal of Computer Security - Foundational Aspects of Security
Efficient construction of machine-checked symbolic protocol security proofs
Journal of Computer Security
| Hi-index | 0.00 |
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a number of novel features, including: (1) Guaranteed termination, after which the result is either unbounded correctness, falsification, or bounded correctness. (2) Efficient generation of a finite representation of an infinite set of traces in terms of patterns, also known as a complete characterization. (3) State-of-the-art performance, which has made new types of protocol analysis feasible, such as multi-protocol analysis.