Latifa Boursas

Learn More
Large-scale distributed systems that are provided in an inter-organizational manner require scalable, dynamic access control paradigms for dealing with known, but also with new users. This paper presents an innovative, trust management based approach for such scenarios. It aggregates and evaluates trust levels from several trust dimensions and has been(More)
The need for collaborative service provisioning across different providerspsila domains is being addressed by circles of trust (CoT), whose members adhere to the same policies and expose the same interfaces for collaboration. Todaypsilas CoT specifications require a high initial effort on behalf of enrolling members, thus obviating quick or even ad hoc(More)
We present intermediate results of IntegraTUM, a project realized by the Technische Universität München (Munich University of Technology, TUM) and the Leibniz Supercomputing Center (LRZ) under partial funding by the German Research Foundation (DFG), which is intended as a prototype for the higher education institutions in Germany. At its core, a modern and(More)
This paper presents a trust-management application for trust based relationships in federated identity management (FIM). It empowers discovery, technical interpretation of the meaning of trust, dynamic calculation of trust levels and afterwards static composition of trustworthy relationships between Identity and Service providers, which can be accomplished(More)
— In Federated Identity Management (FIM), user administration is decentralized: Service Providers (SPs) can request information about the users from their respective Identity Providers (IDPs). The subsequent processing of this data with respect to service provisioning and various privacy aspects are open research issues. We first specify how SPs can use(More)
We report on our experiences with the implementation of a parallel algorithm to compute the cycle structure of a permutation given as an oracle. As a sub-problem, the cycle structure of a modified permutation given as a table that is partitioned over N hard disks has to be computed. While a minor point during algorithm design and analysis, we spent most(More)