Using one-way functions for authentication
ACM SIGCOMM Computer Communication Review
A Model for Secure Protocols and Their Compositions
IEEE Transactions on Software Engineering
The inductive approach to verifying cryptographic protocols
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
Honest Ideals on Strand Spaces
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Athena: a New Efficient Automatic Checker for Security Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Relating Strands and Multiset Rewriting for Security Protocol Analysis
CSFW '00 Proceedings of the 13th 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
Computing Symbolic Models for Verifying Cryptographic Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Symbolic Semantics and Analysis for Crypto-CCS with (Almost) Generic Inference Systems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
A Framework for the Analysis of Security Protocols
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
An Improved Constraint-Based System for the Verification of Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Decidability and Closure Properties of Equational Tree Languages
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Multiset Rewriting and Security Protocol Analysis
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Automated Unbounded Verification of Security Protocols
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Protocol insecurity with a finite number of sessions and composed keys is NP-complete
Theoretical Computer Science
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
Strategy for Verifying Security Protocols with Unbounded Message Size
Automated Software Engineering
Security properties: two agents are sufficient
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Soft constraint programming to analysing security protocols
Theory and Practice of Logic Programming
A decision procedure for the verification of security protocols with explicit destructors
Proceedings of the 11th ACM conference on Computer and communications security
Tree automata with one memory set constraints and cryptographic protocols
Theoretical Computer Science - Automata, languages and programming
Decidability of context-explicit security protocols
Journal of Computer Security - Special issue on WITS'03
A comparison between strand spaces and multiset rewriting for security protocol analysis
Journal of Computer Security
An NP decision procedure for protocol insecurity with XOR
Theoretical Computer Science
A method for symbolic analysis of security protocols
Theoretical Computer Science
Constraint solving for contract-signing protocols
CONCUR 2005 - Concurrency Theory
A modular correctness proof of IEEE 802.11i and TLS
Proceedings of the 12th ACM conference on Computer and communications security
Deciding security of protocols against off-line guessing attacks
Proceedings of the 12th ACM conference on Computer and communications security
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
Static validation of security protocols
Journal of Computer Security
Symbolic protocol analysis with an Abelian group operator or Diffie-Hellman exponentiation
Journal of Computer Security
Verification of cryptographic protocols: tagging enforces termination
Theoretical Computer Science - Foundations of software science and computation structures
Improving the security of industrial networks by means of formal verification
Computer Standards & Interfaces
A rewriting-based inference system for the NRL Protocol analyzer and its meta-logical properties
Theoretical Computer Science - Automated reasoning for security protocol analysis
A (restricted) quantifier elimination for security protocols
Theoretical Computer Science - Automated reasoning for security protocol analysis
Intruder deduction for the equational theory of Abelian groups with distributive encryption
Information and Computation
Higher-Order and Symbolic Computation
Higher-Order and Symbolic Computation
A survey of algebraic properties used in cryptographic protocols
Journal of Computer Security
A calculus of challenges and responses
Proceedings of the 2007 ACM workshop on Formal methods in security engineering
Transducer-based analysis of cryptographic protocols
Information and Computation
Chosen-name Attacks: An Overlooked Class of Type-flaw Attacks
Electronic Notes in Theoretical Computer Science (ENTCS)
Hierarchical combination of intruder theories
Information and Computation
Symbolic protocol analysis for monoidal equational theories
Information and Computation
On the relationships between models in protocol verification
Information and Computation
Timed analysis of security protocols
Journal of Computer Security - Formal Methods in Security Engineering Workshop (FMSE 04)
ACM Transactions on Computational Logic (TOCL)
Combining Algorithms for Deciding Knowledge in Security Protocols
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A Formal Analysis of Complex Type Flaw Attacks on Security Protocols
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
From One Session to Many: Dynamic Tags for Security Protocols
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Complexity of Checking Freshness of Cryptographic Protocols
ICISS '08 Proceedings of the 4th International Conference on Information Systems Security
Safely composing security protocols
Formal Methods in System Design
Verification of Security Protocols
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Rewriting Techniques in the Constraint Solver
Electronic Notes in Theoretical Computer Science (ENTCS)
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
YAPA: A Generic Tool for Computing Intruder Knowledge
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Verifying privacy-type properties of electronic voting protocols
Journal of Computer Security
Computing Knowledge in Security Protocols under Convergent Equational Theories
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Deciding security properties for cryptographic protocols. application to key cycles
ACM Transactions on Computational Logic (TOCL)
Correcting and Improving the NP Proof for Cryptographic Protocol Insecurity
ICISS '09 Proceedings of the 5th International Conference on Information Systems Security
A Complete Symbolic Bisimulation for Full Applied Pi Calculus
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
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)
Satisfiability of Dolev-Yao Constraints
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)
Electronic Notes in Theoretical Computer Science (ENTCS)
A Coordination-based Methodology for Security Protocol Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
A Trace Logic for Local Security Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures
Theoretical Computer Science
Deciding strategy properties of contract-signing protocols
ACM Transactions on Computational Logic (TOCL)
Verification of cryptographic Protocols: tagging enforces termination
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Cap unification: application to protocol security modulo homomorphic encryption
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Searching for shapes in cryptographic protocols
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Verification of authentication protocols based on the binding relation
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Security properties: two agents are sufficient
ESOP'03 Proceedings of the 12th European conference on Programming
A new knowledge representation strategy for cryptographic protocol analysis
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Pattern-based abstraction for verifying secrecy in protocols
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Verifying cryptographic protocols with subterms constraints
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Deciding knowledge in security protocols for monoidal equational theories
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Symbolic bisimulation for the applied Pi calculus
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Safely composing security protocols
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Bounding messages for free in security protocols
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Symbolic bisimulation for the applied pi 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
Complexity of fairness constraints for the Dolev-Yao attacker model
Proceedings of the 2011 ACM Symposium on Applied Computing
Distributed temporal logic for the analysis of security protocol models
Theoretical Computer Science
Towards understanding pure publish/subscribe cryptographic protocols
Security'08 Proceedings of the 16th International conference on Security protocols
Deciding security for protocols with recursive tests
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Trace equivalence decision: negative tests and non-determinism
Proceedings of the 18th ACM conference on Computer and communications security
${\mathcal PS}$-LTL for constraint-based security protocol analysis
ICLP'05 Proceedings of the 21st international conference on Logic Programming
From security protocols to systems security
Proceedings of the 11th international conference on Security Protocols
Deciding key cycles for security protocols
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Computationally sound symbolic secrecy in the presence of hash functions
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Symbolic protocol analysis in presence of a homomorphism operator and exclusive or
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Unification Modulo Homomorphic Encryption
Journal of Automated Reasoning
Computing Knowledge in Security Protocols Under Convergent Equational Theories
Journal of Automated Reasoning
ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
A dolev-yao model for zero knowledge
ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
Deciding properties of contract-signing protocols
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Checking secrecy by means of partial order reduction
SAM'04 Proceedings of the 4th international SDL and MSC conference on System Analysis and Modeling
A formal security analysis of an OSA/Parlay authentication interface
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Generic verification of security protocols
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Hierarchical combination of intruder theories
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Security protocols verification in abductive logic programming: a case study
ESAW'05 Proceedings of the 6th international conference on Engineering Societies in the Agents World
Automating security analysis: symbolic equivalence of constraint systems
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Soundness of removing cancellation identities in protocol analysis under Exclusive-OR
TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Decidability and Combination Results for Two Notions of Knowledge in Security Protocols
Journal of Automated Reasoning
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Security protocol verification: symbolic and computational models
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Towards unconditional soundness: computationally complete symbolic attacker
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Security protocols, constraint systems, and group theories
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Diffie-Hellman without difficulty
FAST'11 Proceedings of the 8th international conference on Formal Aspects of Security and Trust
From model-checking to automated testing of security protocols: bridging the gap
TAP'12 Proceedings of the 6th international conference on Tests and Proofs
A complete symbolic bisimulation for full applied pi calculus
Theoretical Computer Science
Towards the orchestration of secured services under non-disclosure policies
MMM-ACNS'12 Proceedings of the 6th international conference on Mathematical Methods, Models and Architectures for Computer Network Security: computer network security
YAPA: A Generic Tool for Computing Intruder Knowledge
ACM Transactions on Computational Logic (TOCL)
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Sessions and separability in security protocols
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Establishing and preserving protocol security goals
Journal of Computer Security - Foundational Aspects of Security
| Hi-index | 0.01 |
The reachability problem for cryptographic protocols with non-atomic keys can be solved via a simple constraint satisfaction procedure.