DocumentCode
3127576
Title
Reasoning about Events to Specify Authorization Policies forWeb Services Composition
Author
Rouached, Mohsen ; Godart, Claude
Author_Institution
LORIA, Nancy
fYear
2007
fDate
9-13 July 2007
Firstpage
481
Lastpage
488
Abstract
Availability of a wide variety of Web services over the Internet offers opportunities of providing new value added services built by composing them out of existing ones. By integrating individual existing Web services the technology enables the provision of advanced and sophisticated services, such as allowing users to use different types of resources and services simultaneously in a simple procedure. However the management and maintenance of a large number of Web services is not easy and, in particular, needs appropriate authorization policies to be defined so as to realize reliable and secure Web Services. The required authorization policies can be quite complex, resulting in unintended conflicts, which could result in information leaks or prevent access to information needed. This paper proposes a logic based approach using for specifying authorization policies and detecting conflicts resulting from the combination of various kinds of authorization and constraint policies used in Web services environments. The method not only enables static detection of policy conflicts but also yields information that is helpful for correcting the policies. An automated induction-based theorem prover SPIKE is used as verification back-end.
Keywords
Web services; authorisation; Internet; Web service composition; authorization policy; policy conflict static detection; reasoning technique; Access control; Authorization; Availability; Data security; Logic; Maintenance; Protection; Reliability theory; Web and internet services; Web services;
fLanguage
English
Publisher
ieee
Conference_Titel
Web Services, 2007. ICWS 2007. IEEE International Conference on
Conference_Location
Salt Lake City, UT
Print_ISBN
0-7695-2924-0
Type
conf
DOI
10.1109/ICWS.2007.150
Filename
4279634
Link To Document