Title: Detection of slanders through Euclidean distance similarity assessment for securing e-commerce agents in P2P decentralised electronic communities
Authors: Priyanka Dadhich; Kamlesh Dutta; M.C. Govil
Addresses: Department of Computer Science and Engineering, National Institute of Technology, Hamirpur 177001, India ' Department of Computer Science and Engineering, National Institute of Technology, Hamirpur 177001, India ' Department of Computer Engineering, Malviya National Institute of Technology, Jaipur 302015, India
Abstract: Mobile Agents migrate autonomously through the network. During execution, agents are controlled by the hosts. Hence, the need arises to protect agent against malicious intentions of hosts. Proposed model 'MRep' computes reputation of Destination Host (DH) with which agent wishes to do transaction. Hosts as recommenders may give fair/unfair recommendations for the DH. Our approach calculates Euclidean Distance (ED) between Source Host (pre-trusted) and recommender. If ED lies in similarity range, the recommendation of the recommender is fair else, it is unfair. If ED lies between similarity and dissimilarity range, correlation is calculated to estimate strong, medium or weak similarity. High area under the curve proves a high association in receiver operating characteristic (ROC) curves. Results show that model possess 80% accuracy in the Final Reputation score for the DH before slandering while only 50% accuracy is achieved after slandering. This concludes that the existence of slanders lowers the performance of the model.
Keywords: mobile agents; e-commerce; electronic commerce; source hosts; Euclidean distance; F-score; reputation; correlation; ROC curves; receiver operating characteristic; recommendation systems; recommender systems; slander detection; similarity assessment; P2P; peer-to-peer; decentralised electronic communities; online communities; web based communities; virtual communities; multi-agent systems; MAS; agent-based systems; malicious intent.
International Journal of Security and Networks, 2016 Vol.11 No.1/2, pp.48 - 65
Received: 05 Nov 2014
Accepted: 17 Apr 2015
Published online: 02 Mar 2016 *