Secure group communications using key graphs
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
IEEE Transactions on Software Engineering
Propagation of trust and distrust
Proceedings of the 13th international conference on World Wide Web
ARES '06 Proceedings of the First International Conference on Availability, Reliability and Security
Misbehaviors detection to ensure availability in OLSR
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
| Hi-index | 0.00 |
In the literature, reputation systems are used to evaluate other entities behavior and have many applications such as, for instance, the detection of malicious entities. The associated models are based on mathematic formulae, in order to formaly define elements such as the reputation evaluation and evolution and the reputation propagation between peers. Current proposals describe the behaviors of their models by examples, with few (if not no) formal analyses. In this article, we state the basic security properties such systems require and we show that current systems may not satisfy them on specific scenarios, which can be used by malicious entities to take advantage of the system. We also present a new reputation scheme, designed to satisfy these properties, and we compare it to existing research works.