AVISPA

swMATH3172MaRDI QIDQ15706

No author found.

Described by source

• Computer Aided Verification

Related Items (81)

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

This page was built for software: AVISPA