Stateful Protocol Composition and Typing

Title:	Stateful Protocol Composition and Typing
Authors:	Andreas V. Hess (avhe /at/ dtu /dot/ dk), Sebastian Mödersheim and Achim D. Brucker (a /dot/ brucker /at/ exeter /dot/ ac /dot/ uk)
Submission date:	2020-04-08
Abstract:	We provide in this AFP entry several relative soundness results for security protocols. In particular, we prove typing and compositionality results for stateful protocols (i.e., protocols with mutable state that may span several sessions), and that focuses on reachability properties. Such results are useful to simplify protocol verification by reducing it to a simpler problem: Typing results give conditions under which it is safe to verify a protocol in a typed model where only "well-typed" attacks can occur whereas compositionality results allow us to verify a composed protocol by only verifying the component protocols in isolation. The conditions on the protocols under which the results hold are furthermore syntactic in nature allowing for full automation. The foundation presented here is used in another entry to provide fully automated and formalized security proofs of stateful protocols.
BibTeX:	@article{Stateful_Protocol_Composition_and_Typing-AFP, author = {Andreas V. Hess and Sebastian Mödersheim and Achim D. Brucker}, title = {Stateful Protocol Composition and Typing}, journal = {Archive of Formal Proofs}, month = apr, year = 2020, note = {\url{http://isa-afp.org/entries/Stateful_Protocol_Composition_and_Typing.html}, Formal proof development}, ISSN = {2150-914x}, }
License:	BSD License
Depends on:	First_Order_Terms
Used by:	Automated_Stateful_Protocol_Verification
Status: [ok]	This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Proof outline
Proof document

Browse theories

Download this entry