On finding the strongly connected components in a directed graph
Information Processing Letters
Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication
IEEE Transactions on Parallel and Distributed Systems
Regulating service access and information release on the Web
Proceedings of the 7th ACM conference on Computer and communications security
Extracting reputation in multi agent systems by means of social network topology
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
PGP: Pretty Good Privacy
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
Introduction to Algorithms
A reputation-based approach for choosing reliable resources in peer-to-peer networks
Proceedings of the 9th ACM conference on Computer and communications security
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
A reputation system for peer-to-peer networks
NOSSDAV '03 Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Security in Fixed and Wireless Networks: An Introduction to securing data communications
Security in Fixed and Wireless Networks: An Introduction to securing data communications
Cassandra: Distributed Access Control Policies with Tunable Expressiveness
POLICY '04 Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks
Driving and Monitoring Provisional Trust Negotiation with Metapolicies
POLICY '05 Proceedings of the Sixth IEEE International Workshop on Policies for Distributed Systems and Networks
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
A survey of trust in internet applications
IEEE Communications Surveys & Tutorials
| Hi-index | 0.00 |
The paper describes a new model for treating trust in reconfigurable groups of users with special accent on maintaining trust in the next generations of applications. The proposed model uses properties of weighted hypergraphs for description of possibly complicated trust relationships between and within groups of users. The model flexibility enables description of the relations such that these relations are preserved under frequent changes in their structure or trust. The presented ideas can be for their generality straightforwardly generalised to other concepts describable by weighted hypergraphs. The consistency of the proposal was verified in a couple of experiments with our pilot implementation SecGRID.