Verification of Security Protocols with Lists: From Length One to Unbounded Length

DOI10.1007/978-3-642-28641-4_5zbMath1353.68021OpenAlexW120328900MaRDI QIDQ2894316

Bruno Blanchet, Miriam Paiola

Publication date: 29 June 2012

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-28641-4_5

Mathematics Subject Classification ID

Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12)

Related Items (2)

Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later ⋮ Automated Verification of Dynamic Root of Trust Protocols

Uses Software

• ProVerif

This page was built for publication: Verification of Security Protocols with Lists: From Length One to Unbounded Length