Security protocols: from linear to classical logic by abstract interpretation

DOI10.1016/J.IPL.2005.05.011zbMATH Open1185.68310OpenAlexW2006805613MaRDI QIDQ1041815FDOQ1041815

Authors: Bruno Blanchet 

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.05.011

Recommendations

• Encryption as an abstract data-type (extended abstract)
• scientific article; zbMATH DE number 1962760
• Analyzing security protocols with secrecy types and logic programs
• Analyzing security protocols with secrecy types and logic programs
• Abstract interpretation for proving secrecy properties in security protocols

zbMATH Keywords

abstract interpretationformal methodslinear logicclassical logiccryptographic protocols

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs

Cited In (8)

• Linearity, persistence and testing semantics in the asynchronous pi-calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Abstract State Machines 2004. Advances in Theory and Practice
• On the relationships between models in protocol verification
• Automated verification of selected equivalences for security protocols
• Encryption as an abstract data-type (extended abstract)
• Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif

This page was built for publication: Security protocols: from linear to classical logic by abstract interpretation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1041815)