Policies for Distributed Systems and Networks, IEEE International Workshop on (2006)
London, Ontario, Canada
June 5, 2006 to June 7, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/POLICY.2006.4
Miguel Alves , Universidade Nova de Lisboa, Portugal
Carlos Viegas Damasio , Universidade Nova de Lisboa, Portugal
Wolfgang Nejdl , L3S Research Center and Hannover University, Germany
Daniel Olmedilla , L3S Research Center and Hannover University, Germany
Distributed Peer-to-Peer and Grid infrastructure require distributed access control mechanisms. These mechanisms can be implemented in distributed trust management infrastructures and usually require reasoning on more than one peer, as soon as authority is delegated or requests involve several authorities. Building on previous work of the authors which formalized such a distributed trust management infrastructure based on distributed logic programs, we describe in this paper how reasoning can be implemented as distributed logic evaluation and how loops during this evaluation can be handled with. Our solution is based on a loop tolerant distributed tabling algorithm which includes in the process protection of sensitive policies and generation of proofs without increasing the complexity of the system.
D. Olmedilla, C. V. Damasio, W. Nejdl and M. Alves, "A Distributed Tabling Algorithm for Rule Based Policy Systems," Policies for Distributed Systems and Networks, IEEE International Workshop on(POLICY), London, Ontario, Canada, 2006, pp. 123-132.