Proving More Observational Equivalences with ProVerif
From MaRDI portal
Publication:5326762
DOI10.1007/978-3-642-36830-1_12zbMath1391.94737OpenAlexW171472358MaRDI QIDQ5326762
Bruno Blanchet, Vincent Cheval
Publication date: 6 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36830-1_12
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity ⋮ From Security Protocols to Pushdown Automata ⋮ Deciding equivalence-based properties using constraint solving ⋮ Unnamed Item ⋮ Formal Analysis of a TTP-Free Blacklistable Anonymous Credentials System ⋮ Automated type-based analysis of injective agreement in the presence of compromised principals ⋮ A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols ⋮ A procedure for deciding symbolic equivalence between sets of constraint systems ⋮ Automated Verification of Equivalence Properties of Cryptographic Protocols ⋮ Formal analysis of fairness for optimistic multiparty contract signing protocol ⋮ Formalizing provable anonymity in Isabelle/HOL
Uses Software
This page was built for publication: Proving More Observational Equivalences with ProVerif
