The following pages link to OFMC (Q21449):
Displaying 25 items.
- State space reduction in the Maude-NRL protocol analyzer (Q462493) (← links)
- Automated type-based analysis of injective agreement in the presence of compromised principals (Q492914) (← links)
- Distributed temporal logic for the analysis of security protocol models (Q549724) (← links)
- \textsf{CaPiTo}: Protocol stacks for services (Q640297) (← links)
- On the semantics of Alice \& Bob specifications of security protocols (Q860900) (← links)
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties (Q860906) (← links)
- Intruder deduction for the equational theory of abelian groups with distributive encryption (Q876047) (← links)
- Verifying a signature architecture: a comparative case study (Q877156) (← links)
- Efficient representation of the attacker's knowledge in cryptographic protocols analysis (Q931442) (← links)
- Security protocols analysis including various time parameters (Q1981034) (← links)
- Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete (Q2453106) (← links)
- Formal Verification of a Key Establishment Protocol for EPC Gen2 RFID Systems: Work in Progress (Q2889843) (← links)
- Computationally Sound Abstraction and Verification of Secure Multi-Party Computations (Q2908865) (← links)
- Model Checking Security Protocols (Q3176380) (← links)
- On the Automated Correction of Protocols with Improper Message Encoding (Q3184716) (← links)
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties (Q3184784) (← links)
- The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols (Q3184787) (← links)
- On-the-Fly Model Checking of Fair Non-repudiation Protocols (Q3510820) (← links)
- Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol (Q3540086) (← links)
- On Establishing and Fixing a Parallel Session Attack in a Security Protocol (Q3613472) (← links)
- Computing knowledge in equational extensions of subterm convergent theories (Q5139279) (← links)
- Computational Soundness of Symbolic Zero-Knowledge Proofs: Weaker Assumptions and Mechanized Verification (Q5326761) (← links)
- From Security Protocols to Pushdown Automata (Q5327429) (← links)
- A Formal Language for Cryptographic Pseudocode (Q5505567) (← links)
- Computer Aided Verification (Q5716566) (← links)
