Published in

Elsevier, Electronic Notes in Theoretical Computer Science, (179), p. 75-86, 2007

DOI: 10.1016/j.entcs.2006.08.032

Links

Tools

Export citation

Search in Google Scholar

Partial and Fuzzy Constraint Satisfaction to Support Coalition Formation

Journal article published in 2007 by Petros Belsis, Stefanos Gritzalis, Sokratis K. Katsikas
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Red circle
Postprint: archiving forbidden
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

The creation of dynamic coalitions is a challenging task, seen from a security perspective. Due to the presence of conflicting requirements and specifications, the policy negotiation and policy merging processes call for the use of efficient techniques to resolve ambiguities. Constraints and constraint programming on the other hand, are useful means for representing a wide range of access control states and access control problems. In this paper we utilize constraints to represent access control policies in a multi-domain environment. In contrast to monolithic (crisp) constraint satisfaction techniques, we extend the applicability of constraints for access control, by examining soft constraints and partial constraint satisfaction. We also introduce a security framework based on fuzzy constraints that allows the determination of preferences for the participating domains.