On 2012-07-19 8:59 AM, Nikos Fotiou wrote:
Dear all,
We have developed an algorithm for fighting spaming in
publish/subscribe systems that has direct applicability to p2p file
sharing systems. The rational behind this algorithm is:
-You rank the content and not the users(therefore there is no need for
persistent user identity)
-You have positive votes only (therefore the fact that a user shares a
file can be considered as a vote for this file, moreover there is no
way to affect negatively the reputation of a file)
-The more "similar" files a user share the less weight his vote has
(It has been found that in p2p file sharing networks malicious users
pollute them by advertising the same fake file with multiple fake but
similar tags)
With simulations we found that in order for a single attack to take
place (i.e., a malicious file to be distributed) there should be so
many malicious users in the system as the number of the legitimate
users that share the most popular version of a file
You can find the related papers here
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5722360 and here
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5534464 (direct
access to the pdf files from here
http://pages.cs.aueb.gr/~fotiou/papers/inforanking.pdf and here
http://pages.cs.aueb.gr/~fotiou/papers/ngi.pdf respectively)
This only works if it is costly to produce malicious sybils (sock
puppets) - that for a user to count as non malicious, that user has to
engage in transactions that benefit existing non malicious users.
_______________________________________________
p2p-hackers mailing list
[email protected]
http://lists.zooko.com/mailman/listinfo/p2p-hackers
