The following pages link to ProVerif (Q18650):
Displaying 43 items.
- Automated type-based analysis of injective agreement in the presence of compromised principals (Q492914) (← links)
- Formal methods for web security (Q511944) (← links)
- Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach (Q540685) (← links)
- \textsf{CaPiTo}: Protocol stacks for services (Q640297) (← links)
- Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types (Q880987) (← links)
- SeVe: automatic tool for verification of security protocols (Q1762179) (← links)
- Security protocols analysis including various time parameters (Q1981034) (← links)
- Abstractions of non-interference security: probabilistic versus possibilistic (Q2018754) (← links)
- Processes against tests: on defining contextual equivalences (Q2079681) (← links)
- Gaining trust by tracing security protocols (Q2095430) (← links)
- Privacy-preserving authenticated key exchange for constrained devices (Q2096615) (← links)
- Terminating non-disjoint combined unification (Q2119106) (← links)
- Implementing and measuring \textsf{KEMTLS} (Q2146079) (← links)
- Formal verification of fair exchange based on Bitcoin smart contracts (Q2152024) (← links)
- DABSTERS: a privacy preserving e-voting protocol for permissioned blockchain (Q2279133) (← links)
- Combining proverif and automated theorem provers for security protocol verification (Q2305427) (← links)
- Formalizing provable anonymity in Isabelle/HOL (Q2355379) (← links)
- Formal analysis and offline monitoring of electronic exams (Q2402552) (← links)
- Universally composable symbolic security analysis (Q2429708) (← links)
- Automated verification of selected equivalences for security protocols (Q2474047) (← links)
- Security Protocol Verification: Symbolic and Computational Models (Q2894308) (← links)
- Analysing Routing Protocols: Four Nodes Topologies Are Sufficient (Q2894310) (← links)
- Verification of Security Protocols with Lists: From Length One to Unbounded Length (Q2894316) (← links)
- Reduction of Equational Theories for Verification of Trace Equivalence: Re-encryption, Associativity and Commutativity (Q2894321) (← links)
- Alice and Bob Meet Equational Theories (Q2945705) (← links)
- YAPA (Q2946688) (← links)
- Model Checking Security Protocols (Q3176380) (← links)
- The Applied Pi Calculus (Q3177888) (← links)
- Formal Analysis of a TTP-Free Blacklistable Anonymous Credentials System (Q3297470) (← links)
- Automated Verification of Dynamic Root of Trust Protocols (Q3304809) (← links)
- A Program Logic for Verifying Secure Routing Protocols (Q3460424) (← links)
- Alice and Bob: Reconciling Formal Models and Implementation (Q3460863) (← links)
- YAPA: A Generic Tool for Computing Intruder Knowledge (Q3636824) (← links)
- The 10th IJCAR automated theorem proving system competition – CASC-J10 (Q5019796) (← links)
- Computing knowledge in equational extensions of subterm convergent theories (Q5139279) (← links)
- Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif (Q5253587) (← links)
- Programming Languages and Systems (Q5316564) (← links)
- PIC2LNT: Model Transformation for Model Checking an Applied Pi-Calculus (Q5326325) (← links)
- Proving More Observational Equivalences with ProVerif (Q5326762) (← links)
- Formal Verification of e-Auction Protocols (Q5326763) (← links)
- (Q5447364) (← links)
- Relating Process Languages for Security and Communication Correctness (Extended Abstract) (Q5881535) (← links)
- Theory of Cryptography (Q5898365) (← links)
