Computer Science – Cryptography and Security
Scientific paper
2010-10-22
Computer Science
Cryptography and Security
13 pages, short version in Proceedings of ICAART 2011
Scientific paper
Similar to what happens between humans in the real world, in open multi-agent systems distributed over the Internet, such as online social networks or wiki technologies, agents often form coalitions by agreeing to act as a whole in order to achieve certain common goals. However, agent coalitions are not always a desirable feature of a system, as malicious or corrupt agents may collaborate in order to subvert or attack the system. In this paper, we consider the problem of hidden coalitions, whose existence and the purposes they aim to achieve are not known to the system, and which carry out so-called underhand attacks. We give a first approach to hidden coalitions by introducing a deterministic method that blocks the actions of potentially dangerous agents, i.e. possibly belonging to such coalitions. We also give a non-deterministic version of this method that blocks the smallest set of potentially dangerous agents. We calculate the computational cost of our two blocking methods, and prove their soundness and completeness.
Cristani Matteo
Karafili Erisa
Viganò Luca
No associations
LandOfFree
Blocking Underhand Attacks by Hidden Coalitions (Extended Version) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Blocking Underhand Attacks by Hidden Coalitions (Extended Version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Blocking Underhand Attacks by Hidden Coalitions (Extended Version) will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-661414