Towards a Formal Model of Privacy-Sensitive Dynamic Coalitions
The concept of dynamic coalitions (also virtual organizations) describes the temporary interconnection of autonomous agents, who share information or resources in order to achieve a common goal. Through modern technologies these coalitions may form across company, organization and system borders. Th...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2012-04-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1204.6090v1 |
id |
doaj-9ab84049ab8547978b9110ed82713bc3 |
---|---|
record_format |
Article |
spelling |
doaj-9ab84049ab8547978b9110ed82713bc32020-11-24T22:44:27ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802012-04-0183Proc. FAVO 2011102110.4204/EPTCS.83.2Towards a Formal Model of Privacy-Sensitive Dynamic CoalitionsSebastian BabNadim SarrouhThe concept of dynamic coalitions (also virtual organizations) describes the temporary interconnection of autonomous agents, who share information or resources in order to achieve a common goal. Through modern technologies these coalitions may form across company, organization and system borders. Therefor questions of access control and security are of vital significance for the architectures supporting these coalitions. In this paper, we present our first steps to reach a formal framework for modeling and verifying the design of privacy-sensitive dynamic coalition infrastructures and their processes. In order to do so we extend existing dynamic coalition modeling approaches with an access-control-concept, which manages access to information through policies. Furthermore we regard the processes underlying these coalitions and present first works in formalizing these processes. As a result of the present paper we illustrate the usefulness of the Abstract State Machine (ASM) method for this task. We demonstrate a formal treatment of privacy-sensitive dynamic coalitions by two example ASMs which model certain access control situations. A logical consideration of these ASMs can lead to a better understanding and a verification of the ASMs according to the aspired specification.http://arxiv.org/pdf/1204.6090v1 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Sebastian Bab Nadim Sarrouh |
spellingShingle |
Sebastian Bab Nadim Sarrouh Towards a Formal Model of Privacy-Sensitive Dynamic Coalitions Electronic Proceedings in Theoretical Computer Science |
author_facet |
Sebastian Bab Nadim Sarrouh |
author_sort |
Sebastian Bab |
title |
Towards a Formal Model of Privacy-Sensitive Dynamic Coalitions |
title_short |
Towards a Formal Model of Privacy-Sensitive Dynamic Coalitions |
title_full |
Towards a Formal Model of Privacy-Sensitive Dynamic Coalitions |
title_fullStr |
Towards a Formal Model of Privacy-Sensitive Dynamic Coalitions |
title_full_unstemmed |
Towards a Formal Model of Privacy-Sensitive Dynamic Coalitions |
title_sort |
towards a formal model of privacy-sensitive dynamic coalitions |
publisher |
Open Publishing Association |
series |
Electronic Proceedings in Theoretical Computer Science |
issn |
2075-2180 |
publishDate |
2012-04-01 |
description |
The concept of dynamic coalitions (also virtual organizations) describes the temporary interconnection of autonomous agents, who share information or resources in order to achieve a common goal. Through modern technologies these coalitions may form across company, organization and system borders. Therefor questions of access control and security are of vital significance for the architectures supporting these coalitions. In this paper, we present our first steps to reach a formal framework for modeling and verifying the design of privacy-sensitive dynamic coalition infrastructures and their processes. In order to do so we extend existing dynamic coalition modeling approaches with an access-control-concept, which manages access to information through policies. Furthermore we regard the processes underlying these coalitions and present first works in formalizing these processes. As a result of the present paper we illustrate the usefulness of the Abstract State Machine (ASM) method for this task. We demonstrate a formal treatment of privacy-sensitive dynamic coalitions by two example ASMs which model certain access control situations. A logical consideration of these ASMs can lead to a better understanding and a verification of the ASMs according to the aspired specification. |
url |
http://arxiv.org/pdf/1204.6090v1 |
work_keys_str_mv |
AT sebastianbab towardsaformalmodelofprivacysensitivedynamiccoalitions AT nadimsarrouh towardsaformalmodelofprivacysensitivedynamiccoalitions |
_version_ |
1725691770092650496 |