Choreographies with Secure Boxes and Compromised Principals
We equip choreography-level session descriptions with a simple abstraction of a security infrastructure. Message components may be enclosed within (possibly nested) ''boxes'' annotated with the intended source and destination of those components. The boxes are to be implemented w...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2009-12-01
|
| Series: | Electronic Proceedings in Theoretical Computer Science |
| Online Access: | http://arxiv.org/pdf/0911.5444v1 |
| _version_ | 1818678185915580416 |
|---|---|
| author | Joshua Guttman Marco Carbone |
| author_facet | Joshua Guttman Marco Carbone |
| author_sort | Joshua Guttman |
| collection | DOAJ |
| description | We equip choreography-level session descriptions with a simple abstraction of a security infrastructure. Message components may be enclosed within (possibly nested) ''boxes'' annotated with the intended source and destination of those components. The boxes are to be implemented with cryptography. Strand spaces provide a semantics for these choreographies, in which some roles may be played by compromised principals. A skeleton is a partially ordered structure containing local behaviors (strands) executed by regular (non-compromised) principals. A skeleton is realized if it contains enough regular strands so that it could actually occur, in combination with any possible activity of compromised principals. It is delivery guaranteed (DG) realized if, in addition, every message transmitted to a regular participant is also delivered. We define a novel transition system on skeletons, in which the steps add regular strands. These steps solve tests, i.e. parts of the skeleton that could not occur without additional regular behavior. We prove three main results about the transition system. First, each minimal DG realized skeleton is reachable, using the transition system, from any skeleton it embeds. Second, if no step is possible from a skeleton A, then A is DG realized. Finally, if a DG realized B is accessible from A, then B is minimal. Thus, the transition system provides a systematic way to construct the possible behaviors of the choreography, in the presence of compromised principals. |
| first_indexed | 2024-12-17T09:11:15Z |
| format | Article |
| id | doaj.art-e670283903b24262b98cdd7c7e842dee |
| institution | Directory Open Access Journal |
| issn | 2075-2180 |
| language | English |
| last_indexed | 2024-12-17T09:11:15Z |
| publishDate | 2009-12-01 |
| publisher | Open Publishing Association |
| record_format | Article |
| series | Electronic Proceedings in Theoretical Computer Science |
| spelling | doaj.art-e670283903b24262b98cdd7c7e842dee2022-12-21T21:55:12ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802009-12-0112Proc. ICE 200911510.4204/EPTCS.12.1Choreographies with Secure Boxes and Compromised PrincipalsJoshua GuttmanMarco CarboneWe equip choreography-level session descriptions with a simple abstraction of a security infrastructure. Message components may be enclosed within (possibly nested) ''boxes'' annotated with the intended source and destination of those components. The boxes are to be implemented with cryptography. Strand spaces provide a semantics for these choreographies, in which some roles may be played by compromised principals. A skeleton is a partially ordered structure containing local behaviors (strands) executed by regular (non-compromised) principals. A skeleton is realized if it contains enough regular strands so that it could actually occur, in combination with any possible activity of compromised principals. It is delivery guaranteed (DG) realized if, in addition, every message transmitted to a regular participant is also delivered. We define a novel transition system on skeletons, in which the steps add regular strands. These steps solve tests, i.e. parts of the skeleton that could not occur without additional regular behavior. We prove three main results about the transition system. First, each minimal DG realized skeleton is reachable, using the transition system, from any skeleton it embeds. Second, if no step is possible from a skeleton A, then A is DG realized. Finally, if a DG realized B is accessible from A, then B is minimal. Thus, the transition system provides a systematic way to construct the possible behaviors of the choreography, in the presence of compromised principals.http://arxiv.org/pdf/0911.5444v1 |
| spellingShingle | Joshua Guttman Marco Carbone Choreographies with Secure Boxes and Compromised Principals Electronic Proceedings in Theoretical Computer Science |
| title | Choreographies with Secure Boxes and Compromised Principals |
| title_full | Choreographies with Secure Boxes and Compromised Principals |
| title_fullStr | Choreographies with Secure Boxes and Compromised Principals |
| title_full_unstemmed | Choreographies with Secure Boxes and Compromised Principals |
| title_short | Choreographies with Secure Boxes and Compromised Principals |
| title_sort | choreographies with secure boxes and compromised principals |
| url | http://arxiv.org/pdf/0911.5444v1 |
| work_keys_str_mv | AT joshuaguttman choreographieswithsecureboxesandcompromisedprincipals AT marcocarbone choreographieswithsecureboxesandcompromisedprincipals |