AVISPA

swMATH3172MaRDI QIDQ15706FDOQ15706

Author name not available (Why is that?)

Described by source

• Computer Aided Verification

Cited In (81)

• Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets
• Deciding security for protocols with recursive tests
• Alice and Bob meet equational theories
• 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
• Formalization in PVS of balancing properties necessary for proving security of the Dolev-Yao cascade protocol model
• Dynamic tags for security protocols
• Functional Correctness Proofs of Encryption Algorithms
• Deciding equivalence-based properties using constraint solving
• 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
• Tree automata for detecting attacks on protocols with algebraic cryptographic primitives
• 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
• Cryptographically sound security proofs for basic and public-key Kerberos
• Formal analysis of security protocols for wireless sensor networks
• A semantics for behavior trees using CSP with specification commands
• Automatic verification of security protocols in the symbolic model: the verifier ProVerif
• A Protocol for Secure Public Instant Messaging
• Distributed temporal logic for the analysis of security protocol models
• Emerging issues and trends in formal methods in cryptographic protocol analysis: twelve years later
• 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
• 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
• An introduction to security API analysis
• Simulation based security in the applied pi calculus
• Completeness of tree automata completion
• 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
• Towards an Automatic Analysis of Web Service Security
• The CL-Atse Protocol Analyser
• Automatic verification of temporal-epistemic properties of cryptographic protocols
• Certifying a Tree Automata Completion Checker
• ESAP: efficient and secure authentication protocol for roaming user in mobile communication networks
• A reduced semantics for deciding trace equivalence
• Automated verification of equivalence properties of cryptographic protocols
• 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
• Modelling and checking timed authentication 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
• 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
• 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
• 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
• Verification of the TESLA protocol in MCMAS-X
• 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
• YAPA: a generic tool for computing intruder knowledge
• 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