Detection of slanders through Euclidean distance similarity assessment for securing e-commerce agents in P2P decentralised electronic communities
by Priyanka Dadhich; Kamlesh Dutta; M.C. Govil
International Journal of Security and Networks (IJSN), Vol. 11, No. 1/2, 2016

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.

Online publication date: Wed, 02-Mar-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com