AVISPA
From MaRDI portal
Software:15706
swMATH3172MaRDI QIDQ15706FDOQ15706
Author name not available (Why is that?)
Cited In (81)
- Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets
- Formalization in PVS of Balancing Properties Necessary for Proving Security of the Dolev-Yao Cascade Protocol Model
- Dynamic Tags for Security Protocols
- Designing and Verifying Core Protocols for Location Privacy
- SAT-Based Verification of Security Protocols Via Translation to Networks of Automata
- A Complete Quantified Epistemic Logic for Reasoning about Message Passing Systems
- On Communication Models When Verifying Equivalence Properties
- Alice and Bob Meet Equational Theories
- Deciding Security for Protocols with Recursive Tests
- Functional Correctness Proofs of Encryption Algorithms
- Deciding equivalence-based properties using constraint solving
- Title not available (Why is that?)
- Intruder deduction problem for locally stable theories with normal forms and inverses
- Foundations of Software Science and Computation Structures
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
- Feasible Trace Reconstruction for Rewriting Approximations
- Ephemeral-secret-leakage secure ID-based three-party authenticated key agreement protocol for mobile distributed computing environments
- LTL model checking for security protocols
- Multi-attacker protocol validation
- Formal analysis of security protocols for wireless sensor networks
- A semantics for behavior trees using CSP with specification commands
- A Protocol for Secure Public Instant Messaging
- Distributed temporal logic for the analysis of security protocol models
- Title not available (Why is that?)
- Computing Knowledge in Security Protocols under Convergent Equational Theories
- On the semantics of Alice \& Bob specifications of security protocols
- YAPA: A Generic Tool for Computing Intruder Knowledge
- Computing knowledge in security protocols under convergent equational theories
- Safely composing security protocols
- Injective synchronisation: An extension of the authentication hierarchy
- Title not available (Why is that?)
- Handling Algebraic Properties in Automatic Analysis of Security Protocols
- Intruder deduction for the equational theory of abelian groups with distributive encryption
- The Applied Pi Calculus
- Simulation based security in the applied pi calculus
- On the relationships between models in protocol verification
- Modeling and verifying ad hoc routing protocols
- From One Session to Many: Dynamic Tags for Security Protocols
- Multicast receiver access control by IGMP-AC
- A procedure for deciding symbolic equivalence between sets of constraint systems
- Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later
- Towards an Automatic Analysis of Web Service Security
- The CL-Atse Protocol Analyser
- Automatic verification of temporal-epistemic properties of cryptographic protocols
- Title not available (Why is that?)
- YAPA
- Certifying a Tree Automata Completion Checker
- ESAP: efficient and secure authentication protocol for roaming user in mobile communication networks
- Deciding Key Cycles for Security Protocols
- Safely Composing Security Protocols
- Composition of password-based protocols
- A decidable class of security protocols for both reachability and equivalence properties
- A framework for compositional verification of security protocols
- Computational soundness of symbolic analysis for protocols using hash functions
- Explicit randomness is not necessary when modeling probabilistic encryption
- Protocol composition logic (PCL)
- Model Checking Security Protocols
- An Introduction to Security API Analysis
- Validating Security Protocols under the General Attacker
- Computing knowledge in equational extensions of subterm convergent theories
- Automated type-based analysis of injective agreement in the presence of compromised principals
- Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives
- Formal analysis and offline monitoring of electronic exams
- The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
- Termination criteria for tree automata completion
- Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif
- Sender access and data distribution control for inter-domain multicast groups
- A Formal Analysis of Complex Type Flaw Attacks on Security Protocols
- Combining proverif and automated theorem provers for security protocol verification
- Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols
- Automated Verification of Equivalence Properties of Cryptographic Protocols
- Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos
- SeVe: automatic tool for verification of security protocols
- Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures
- Deciding knowledge in security protocols under some e-voting theories
- Breaking and fixing public-key Kerberos
- Propositional Tree Automata
- Security protocols analysis including various time parameters
- Cryptographic Protocol Composition via the Authentication Tests
- Comparing State Spaces in Automatic Security Protocol Analysis
This page was built for software: AVISPA