Department of Computer Engineering and Information Technology, Amirkabir University of Technology, Tehran, Iran
چکیده
Reputation systems have been proposed as a means to encourage cooperation among the nodes of ad hoc networks and peer-to-peer systems. Well-reputed nodes are considered trustworthy and receive network services based on their reputation. Reputation systems, however, are vulnerable to a number of attacks such as whitewashing due to the availability of cheap pseudonyms and the initial reputation assigned to a newcomer.In this thesis, we focus on the whitewashing attack and the way one may improve the solutions proposed to frustrate it. To this end, we present a game model of the interactions between two internal nodes of a MANET. It is a Bayesian game involving the possible types of a node, selfish and normal. Then, we find a perfect Bayesian equilibrium of the game. The analysis of the equilibrium shows that by deciding on appropriate identity cost the attack can be prevented while normal nodes remain motivated to enter to the network.
Seradji,Shabnam و Soleiman Fallah,Mehran . (1394). Frustrating Whitewashing in Reputation Systems using Game Theory. (e206824). علوم رایانش و فناوری اطلاعات, 13(1), e206824
MLA
Seradji,Shabnam , و Soleiman Fallah,Mehran . "Frustrating Whitewashing in Reputation Systems using Game Theory" .e206824 , علوم رایانش و فناوری اطلاعات, 13, 1, 1394, e206824.
HARVARD
Seradji Shabnam, Soleiman Fallah Mehran. (1394). 'Frustrating Whitewashing in Reputation Systems using Game Theory', علوم رایانش و فناوری اطلاعات, 13(1), e206824.
CHICAGO
Shabnam Seradji و Mehran Soleiman Fallah, "Frustrating Whitewashing in Reputation Systems using Game Theory," علوم رایانش و فناوری اطلاعات, 13 1 (1394): e206824,
VANCOUVER
Seradji Shabnam, Soleiman Fallah Mehran. Frustrating Whitewashing in Reputation Systems using Game Theory. علوم رایانش و فناوری اطلاعات, 1394; 13(1): e206824.