Verifying security protocols with Brutus
ACM Transactions on Software Engineering and Methodology (TOSEM)
An Improved Constraint-Based System for the Verification of Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Automated Unbounded Verification of Security Protocols
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Types and Effects for Asymmetric Cryptographic Protocols
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Capturing Parallel Attacks within the Data Independence Framework
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Information Processing Letters
CDiff: a new reduction technique for constraint-based analysis of security protocols
Proceedings of the 10th ACM conference on Computer and communications security
Some attacks upon authenticated group key agreement protocols
Journal of Computer Security - Special issue on CSFW14
On the automated implementation of modal logics used to verify security protocols
ISICT '03 Proceedings of the 1st international symposium on Information and communication technologies
Strategy for Verifying Security Protocols with Unbounded Message Size
Automated Software Engineering
Modeling vulnerabilities of ad hoc routing protocols
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
An NP decision procedure for protocol insecurity with XOR
Theoretical Computer Science
Visual security protocol modeling
NSPW '05 Proceedings of the 2005 workshop on New security paradigms
Understanding the intruder through attacks on cryptographic protocols
Proceedings of the 44th annual Southeast regional conference
On the semantics of Alice&Bob specifications of security protocols
Theoretical Computer Science - Automated reasoning for security protocol analysis
A Quantifier-free First-order Knowledge Logic of Authentication
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Types and effects for asymmetric cryptographic protocols
Journal of Computer Security - Special issue on CSFW15
Embedding agents within the intruder to detect parallel attacks
Journal of Computer Security - Special issue on CSFW15
A formalism for visual security protocol modeling
Journal of Visual Languages and Computing
Automated Evaluation of Secure Route Discovery in MANET Protocols
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
A secure compiler for session abstractions
Journal of Computer Security - 20th IEEE Computer Security Foundations Symposium (CSF)
Proceedings of the 15th ACM conference on Computer and communications security
Complexity of Checking Freshness of Cryptographic Protocols
ICISS '08 Proceedings of the 4th International Conference on Information Systems Security
Evolutionary design of secrecy amplification protocols for wireless sensor networks
Proceedings of the second ACM conference on Wireless network security
Rewriting Techniques in the Constraint Solver
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of authentication protocols for epistemic goals via SAT compilation
Journal of Computer Science and Technology
Comparing State Spaces in Automatic Security Protocol Analysis
Formal to Practical Security
Automatic verification of correspondences for security protocols
Journal of Computer Security
A framework for abstract interpretation of timed concurrent constraint programs
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Analysis of authentication protocols in agent-based systems using labeled tableaux
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
Analysing the BKE-security Protocol with μCRL
Electronic Notes in Theoretical Computer Science (ENTCS)
Metareasoning about Security Protocols using Distributed Temporal Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Relative Soundness of the Free Algebra Model for Public Key Encryption
Electronic Notes in Theoretical Computer Science (ENTCS)
A Coordination-based Methodology for Security Protocol Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
CafeOBJ as a tool for behavioral system verification
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Calibrating the power of schedulers for probabilistic polynomial-time calculus
Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
A logic-based verification framework for authentication protocols
International Journal of Internet Technology and Secured Transactions
Journal of Computer Security - Digital Identity Management (DIM 2007)
Using deductive knowledge to improve cryptographic protocol verification
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Deciding recognizability under Dolev-Yao intruder model
ISC'10 Proceedings of the 13th international conference on Information security
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
Verifying a chipcard-based biometric identification protocol in VSE
SAFECOMP'06 Proceedings of the 25th international conference on Computer Safety, Reliability, and Security
Symbolic and cryptographic analysis of the secure WS-ReliableMessaging scenario
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Comparison of cryptographic verification tools dealing with algebraic properties
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Formal security analysis of Ariadne secure routing protocol using model checking
International Journal of Ad Hoc and Ubiquitous Computing
Verifying security protocols: an application of CSP
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Synthesizing protocols for digital contract signing
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Security protocol verification: symbolic and computational models
POST'12 Proceedings of the First international conference on Principles of Security and Trust
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
A belief logic for analyzing security of web protocols
TRUST'12 Proceedings of the 5th international conference on Trust and Trustworthy Computing
A Quantifier-free First-order Knowledge Logic of Authentication
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
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
Journal of Systems and Software
A new hierarchical and scalable group key exchange protocol with XOR operation
International Journal of Wireless and Mobile Computing
Efficient construction of machine-checked symbolic protocol security proofs
Journal of Computer Security
| Hi-index | 0.00 |
We propose a new efficient automatic verification technique,Athena, for security protocol analysis. It uses a new efficientrepresentation - our extension to the Strand Space Model, andutilizes techniques from both model checking and theorem provingapproaches. Athena is fully automatic and is able to prove thecorrectness of many security protocols with arbitrary number ofconcurrent runs. The run time for a typical protocol from theliterature, like the Needham-Schroeder protocol, is often afraction of a second. Athena exploits several different techniques that enable it toanalyze infinite sets of protocol runs and achieve such efficiency.Our extended Strand Space Model is a natural and efficientrepresentation for the problem domain. The security properties arespecified in a simple logic which permits both efficient proofsearch algorithms and has enough expressive power to specifyinteresting properties. The automatic proof search procedureborrows some efficient techniques from both model checking andtheorem proving. We believe that it is the right combination of thenew compact representation and all the techniques that actuallymakes Athena successful in fast and automatic verification ofsecurity protocols.