Execution Models for Choreographies and Cryptoprotocols
- ,
- Joshua Guttman
- MITRE Corporation
Research Output:
Journal Article or Conference Article in Journal
Journal article
Peer-reviewOpen access
Publication Information
Output type
Research Output:
Journal Article or Conference Article in Journal
Journal article
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 1-11 (11 pages)Journal (Volume, Issue Number)
Electronic Proceedings in Theoretical Computer Science (Issue 17)Publication milestones
- Published - 2009
Publication status
Published - 2009
ISSN
2075-2180Abstract
A choreography describes a transaction in which several principals interact. Since choreographies frequently describe business processes affecting substantial assets, we need a security infrastructure in order to implement them safely. As part of a line of work devoted to generating cryptoprotocols from choreographies, we focus here on the execution models suited to the two levels. We give a strand-style semantics for choreographies, and propose a special execution model in which choreography-level messages are faithfully delivered exactly once. We adapt this model to handle multiparty protocols in which some participants may be compromised. At level of cryptoprotocols, we use the standard Dolev-Yao execution model, with one alteration. Since many implementations use a ”nonce cache” to discard multiply delivered messages, we provide a semantics for at-most-once delivery
Access to documents
Final published version, 164.96 KB
