A Verification Mechanism for Secured Message Processing in Business Collaboration
Sun, Haiyang, Yang, Jian, Wang, Xin and Zhang, Yanchun (2009) A Verification Mechanism for Secured Message Processing in Business Collaboration. In: Advances in Data and Web Management. Li, Qing, Feng, Ling, Pei, Jian, Wang, Sean X, Zhou, Xiaofang and Zhu, Qiao-Ming, eds. Lecture Notes In Computer Science (5446). Springer, Berlin, Germany, pp. 480-491.
Abstract
Message processing can become unsecured resulting in unreliable business collaboration in terms of authorization policy conflicts, for example, when (1) incorrect role assignment or modification occurs in a partner’s services or (2) messages transferred from one organization are processed by unqualified roles in other collaborating business participants. Therefore, verification mechanism based on access policies is critical for managing secured message processing in business collaboration. In this paper, we exploit a role authorization model, Role-Net, which is developed based on Hierarchical Colored Petri Nets (HCPNs) to specify and manage role authorization in business collaboration. A property named Role Authorization Based Dead Marking Freeness is defined based on Role-Net to verify business collaboration reliability according to partners’ authorization policies. An algebraic verification method for secured message processing is introduced as well.
Dimensions Badge
Altmetric Badge
Item type | Book Section |
URI | https://vuir.vu.edu.au/id/eprint/6676 |
DOI | 10.1007/978-3-642-00672-2_42 |
Official URL | http://link.springer.com/chapter/10.1007%2F978-3-6... |
ISBN | 9783642006715 |
Subjects | Historical > Faculty/School/Research Centre/Department > School of Engineering and Science Historical > FOR Classification > 0806 Information Systems Historical > SEO Classification > 8999 Other Information and Communication Services |
Keywords | ResPubID18077, role authorization, reliability verification, secured message processing, Hierarchical Colored Petri Net |
Citations in Scopus | 2 - View on Scopus |
Download/View statistics | View download statistics for this item |