The following pages link to AVISPA (Q15706):
Displaying 48 items.
- Deciding equivalence-based properties using constraint solving (Q391121) (← links)
- Computing knowledge in security protocols under convergent equational theories (Q437033) (← links)
- Modeling and verifying ad hoc routing protocols (Q462483) (← links)
- Automated type-based analysis of injective agreement in the presence of compromised principals (Q492914) (← links)
- Multi-attacker protocol validation (Q540676) (← links)
- A semantics for behavior trees using CSP with specification commands (Q549693) (← links)
- Distributed temporal logic for the analysis of security protocol models (Q549724) (← links)
- Intruder deduction problem for locally stable theories with normal forms and inverses (Q683746) (← links)
- Termination criteria for tree automata completion (Q730470) (← links)
- On the semantics of Alice \& Bob specifications of security protocols (Q860900) (← links)
- Injective synchronisation: An extension of the authentication hierarchy (Q860905) (← links)
- Intruder deduction for the equational theory of abelian groups with distributive encryption (Q876047) (← links)
- Multicast receiver access control by IGMP-AC (Q1017485) (← links)
- Safely composing security protocols (Q1028731) (← links)
- SeVe: automatic tool for verification of security protocols (Q1762179) (← links)
- ESAP: efficient and secure authentication protocol for roaming user in mobile communication networks (Q1789161) (← links)
- Sender access and data distribution control for inter-domain multicast groups (Q1957828) (← links)
- Security protocols analysis including various time parameters (Q1981034) (← links)
- A procedure for deciding symbolic equivalence between sets of constraint systems (Q2013557) (← links)
- A decidable class of security protocols for both reachability and equivalence properties (Q2031426) (← links)
- Composition of password-based protocols (Q2248082) (← links)
- Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures (Q2268100) (← links)
- Combining proverif and automated theorem provers for security protocol verification (Q2305427) (← links)
- Ephemeral-secret-leakage secure ID-based three-party authenticated key agreement protocol for mobile distributed computing environments (Q2331797) (← links)
- Formal analysis and offline monitoring of electronic exams (Q2402552) (← links)
- On the relationships between models in protocol verification (Q2482448) (← links)
- Breaking and fixing public-key Kerberos (Q2482453) (← links)
- A framework for compositional verification of security protocols (Q2482454) (← links)
- Protocol Composition Logic (PCL) (Q2864155) (← links)
- Explicit Randomness is not Necessary when Modeling Probabilistic Encryption (Q2866728) (← links)
- Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions (Q2866733) (← links)
- Simulation based security in the applied pi calculus (Q2920124) (← links)
- Alice and Bob Meet Equational Theories (Q2945705) (← links)
- Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later (Q2945721) (← links)
- YAPA (Q2946688) (← links)
- Formal analysis of security protocols for wireless sensor networks (Q3075867) (← links)
- An Introduction to Security API Analysis (Q3092171) (← links)
- Deciding knowledge in security protocols under some e-voting theories (Q3095038) (← links)
- Model Checking Security Protocols (Q3176380) (← links)
- The Applied Pi Calculus (Q3177888) (← links)
- Validating Security Protocols under the General Attacker (Q3184711) (← 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)
- Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols (Q3304811) (← links)
- On Communication Models When Verifying Equivalence Properties (Q3304813) (← links)
- (Q4993342) (← links)
- Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives (Q5179050) (← links)
- Formalization in PVS of Balancing Properties Necessary for Proving Security of the Dolev-Yao Cascade Protocol Model (Q5195250) (← links)
