AVISPA
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Multicast receiver access control by IGMP-AC
- Safely composing security protocols
- HERMES
- TulaFale
- LDYIS
- VerICS
- TAPS
- SPINS
- YAPA
- MCMAS-X
- HOL/SPIN
- NAXOS
- CASPA_
- SeVe: automatic tool for verification of security protocols
- ESAP: efficient and secure authentication protocol for roaming user in mobile communication networks
- FAST
- Timbuk
- CMQV+
- SeVe
- ProVerif
- Casper
- XMPP
- Sender access and data distribution control for inter-domain multicast groups
- Security protocols analysis including various time parameters
- A procedure for deciding symbolic equivalence between sets of constraint systems
- A decidable class of security protocols for both reachability and equivalence properties
- OFMC
- scyther
- SATMC
- EasyCrypt
- Composition of password-based protocols
- Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures
- Combining proverif and automated theorem provers for security protocol verification
- Ephemeral-secret-leakage secure ID-based three-party authenticated key agreement protocol for mobile distributed computing environments
- Formal analysis and offline monitoring of electronic exams
- NRL
- Maude-NPA
- Cryptyc
- On the relationships between models in protocol verification
- Breaking and fixing public-key Kerberos
- A framework for compositional verification of security protocols
- ConfiChair
- RiTHM
- Protocol composition logic (PCL)
- 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
- Alice and Bob meet equational theories
- Emerging issues and trends in formal methods in cryptographic protocol analysis: twelve years later
- YAPA: a generic tool for computing intruder knowledge
- Formal analysis of security protocols for wireless sensor networks
- An introduction to security API analysis
- Deciding knowledge in security protocols under some e-voting theories
- 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
- Apte
- Akiss
- SPEC
- Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols
- On Communication Models When Verifying Equivalence Properties
- Plutus
- Designing and Verifying Core Protocols for Location Privacy
- Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets
- scyther-proof
- TAMARIN
- 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
- Certifying a Tree Automata Completion Checker
- A Complete Quantified Epistemic Logic for Reasoning about Message Passing Systems
- Cryptographic Protocol Composition via the Authentication Tests
- Comparing State Spaces in Automatic Security Protocol Analysis
- YAPA: A Generic Tool for Computing Intruder Knowledge
- CoSP
- iperf
- Deciding equivalence-based properties using constraint solving
- AODV
- Computing knowledge in security protocols under convergent equational theories
- CPSA
- Modeling and verifying ad hoc routing protocols
- Automated type-based analysis of injective agreement in the presence of compromised principals
- Dynamic tags for security protocols
- Completeness of tree automata completion
- Computing knowledge in equational extensions of subterm convergent theories
- Tree automata for detecting attacks on protocols with algebraic cryptographic primitives
- LTL model checking for security protocols
- Automatic verification of temporal-epistemic properties of cryptographic protocols
- Computing Knowledge in Security Protocols under Convergent Equational Theories
- Formalization in PVS of balancing properties necessary for proving security of the Dolev-Yao cascade protocol model
- Helios
- Deciding security for protocols with recursive tests
- Automatic verification of security protocols in the symbolic model: the verifier ProVerif
- A reduced semantics for deciding trace equivalence
- Automated verification of equivalence properties of cryptographic protocols
This page was built for software: AVISPA
