A probabilistic poly-time framework for protocol analysis
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Programming language methods in computer security
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verifying security protocols with Brutus
ACM Transactions on Software Engineering and Methodology (TOSEM)
Inductive methods and contract-signing protocols
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
The faithfulness of abstract protocol analysis: message authentication
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Authentication tests and the structure of bundles
Theoretical Computer Science
Validating firewalls using flow logics
Theoretical Computer Science
Mark, a Reasoning Kit for Mobility
Automated Software Engineering
On the symbolic reduction of processes with cryptographic functions
Theoretical Computer Science
Analysis of security protocols as open systems
Theoretical Computer Science
Flow logic for Dolev-Yao secrecy in cryptographic processes
Future Generation Computer Systems - Parallel computing technologies (PaCT-2001)
A bisimulation method for cryptographic protocols
Nordic Journal of Computing
An attack-finding algorithm for security protocols
Journal of Computer Science and Technology
Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Reachability Analysis of Term Rewriting Systems with Timbuk
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Static Analysis for Secrecy and Non-interference in Networks of Processes
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
The Game of the Name in Cryptographic Tables
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Transforming Processes to Check and Ensure Information Flow Security
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Security Goals: Packet Trajectories and Strand Spaces
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Classification of Security Properties (Part I: Information Flow)
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
An Intelligent Intruder Model for Security Protocol Analysis
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Automatic Verification of Cryptographic Protocols through Compositional Analysis Techniques
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
On the Reachability Problem in Cryptographic Protocols
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A Simple Sequent System for First-Order Logic with Free Constructors
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Multiset Rewriting and Security Protocol Analysis
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Interference Analysis for Dependable Systems Using Refinement and Abstraction
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Probabilistic Polynomial-Time Equivalence and Security Analysis
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Towards an Automatic Analysis of Security Protocols in First-Order Logic
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Abstracting Cryptographic Protocols with Tree Automata
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
PIL/SETHEO: A Tool for the Automatic Analysis of Authentication Protocols
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Decision Procedures for the Analysis of Cryptographic Protocols by Logics of Belief
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
CSFW '99 Proceedings of the 12th 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
Game Analysis of Abuse-free Contract Signing
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Information Flow Security in Dynamic Contexts
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
A Compositional Logic for Protocol Correctness
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A game-based verification of non-repudiation and fair exchange protocols
Journal of Computer Security - IFIP 2000
Availability of protocol goals
Proceedings of the 2003 ACM symposium on Applied computing
A compositional logic for proving security properties of protocols
Journal of Computer Security - Special issue on CSFW14
Multiset rewriting and the complexity of bounded security protocols
Journal of Computer Security
Using interval logics for temporal analysis of security protocols
Proceedings of the 2003 ACM workshop on Formal methods in security engineering
Reachability Analysis over Term Rewriting Systems
Journal of Automated Reasoning
The faithfulness of abstract protocol analysis: message authentication
Journal of Computer Security - Special issue on ACM conference on computer and communications security, 2001
Relating multiset rewriting and process algebras for security protocol analysis
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
A decision procedure for the existence of a rank function
Journal of Computer Security
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Theoretical Computer Science
A derivation system and compositional logic for security protocols
Journal of Computer Security
Deriving the type flaw attacks in the Otway-Rees protocol by rewriting
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Relating State-Based and Process-Based Concurrency through Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Protocol Composition Logic (PCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
Secrecy by interpretation functions
Knowledge-Based Systems
A Meta Linear Logical Framework
Electronic Notes in Theoretical Computer Science (ENTCS)
Advanced method for cryptographic protocol verification
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications, 2004
Relating state-based and process-based concurrency through linear logic (full-version)
Information and Computation
An executable model for security protocol JFKr
Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications
Knowledge based approach for mechanically verifying security protocols
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Formalizing and Analyzing the Needham-Schroeder Symmetric-Key Protocol by Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
Analysing the Vulnerability of Protocols to Produce Known-pair and Chosen-text Attacks
Electronic Notes in Theoretical Computer Science (ENTCS)
A Coordination-based Methodology for Security Protocol Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
A proof system for information flow security
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
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
Data access specification and the most powerful symbolic attacker in MSR
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Secure transaction protocol analysis: models and applications
Secure transaction protocol analysis: models and applications
Finite models for formal security proofs
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
A correlation based detection system for keys reuse in SSH/SSL
AMERICAN-MATH'11/CEA'11 Proceedings of the 2011 American conference on applied mathematics and the 5th WSEAS international conference on Computer engineering and applications
Enforcing S&D pattern design in RCES with modeling and formal approaches
Proceedings of the 14th international conference on Model driven engineering languages and systems
Modeling for security verification of a cryptographic protocol with MAC payload
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
Evaluation technique in the spicalculus for cryptographic protocols
ISIICT'09 Proceedings of the Third international conference on Innovation and Information and Communication Technology
Establishing and preserving protocol security goals
Journal of Computer Security - Foundational Aspects of Security
| Hi-index | 0.01 |
Informal justifications of security protocols involve arguing backwards that various events are impossible. Inductive definitions can make such arguments rigorous. The resulting proofs are complicated, but can be generated reasonably quickly using the proof tool Isabelle/HOL. There is no restriction to finite-state systems and the approach is not based on belief logics. Protocols are inductively defined as sets of traces, which may involve many interleaved protocol runs. Protocol descriptions model accidental key losses as well as attacks. The model spy can send spoof messages made up of components decrypted from previous traffic.Several key distribution protocols have been studied, including Needham-Schroeder, Yahalom and Otway-Rees. The method applies to both symmetric-key and public-key protocols. A new attack has been discovered in a variant of Otway-Rees (already broken by Mao and Boyd). Assertions concerning secrecy and authenticity have been proved.