Unification in Extension of Shallow Equational Theories
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Finite-State Analysis of Security Protocols
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Automatic Verification of Cryptographic Protocols with SETHEO
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
System Description: Spass Version 1.0.0
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Proving Properties of Security Protocols by Induction
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Analyzing Cryptographic Protocols in a Reactive Framework
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
On Name Generation and Set-Based Analysis in the Dolev-Yao Model
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
From Secrecy to Authenticity in Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Learning Search Control Knowledge for Equational Theorem Proving
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
System Description: Spass Version 1.0.0
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Computing Symbolic Models for Verifying Cryptographic Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Automatic verification of cryptographic protocols in first-order logic
ICAI'07 Proceedings of the 8th Conference on 8th WSEAS International Conference on Automation and Information - Volume 8
Towards an Automatic Analysis of Web Service Security
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Challenges in the Automated Verification of Security Protocols
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Superposition for Fixed Domains
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Formal to Practical Security
Superposition for fixed domains
ACM Transactions on Computational Logic (TOCL)
Abstraction by set-membership: verifying security protocols and web services with databases
Proceedings of the 17th ACM conference on Computer and communications security
Finite models for formal security proofs
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Superposition-based analysis of first-order probabilistic timed automata
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Normalization of linear horn clauses
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Extending H1-clauses with disequalities
Information Processing Letters
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Verifying a chipcard-based biometric identification protocol in VSE
SAFECOMP'06 Proceedings of the 25th international conference on Computer Safety, Reliability, and Security
ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
Cryptographic protocol analysis on real c code
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Regular protocols and attacks with regular knowledge
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Automating security analysis: symbolic equivalence of constraint systems
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Automated verification of equivalence properties of cryptographic protocols
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Extending H1-clauses with path disequalities
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Security protocol verification: symbolic and computational models
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Crossing the syntactic barrier: hom-disequalities for H1-clauses
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Relational abstract interpretation for the verification of 2-hypersafety properties
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Journal of Automated Reasoning
| Hi-index | 0.00 |
The Neuman-Stubblebine key exchange protocol is formalized in first-order logic and analyzed by the automated theorem prover Spass. In addition to the analysis, we develop the necessary theoretical background providing new (un)decidability results for monadic firstorder fragments involved in the analysis. The approach is applicable to a variety of security protocols and we identify possible extensions leading to future directions of research.