Privacy-preserving scheme for mobile ad hoc networks.

Michalas, A., Oleshchuk, V. A., Komninos, N. & Prasad, N. R. (2011). Privacy-preserving scheme for mobile ad hoc networks.. Paper presented at the 2011 IEEE Symposium on Computers and Communications (ISCC), 28 June - 1 July 2011, Kerkyra, Greece.

[img]
Preview
PDF
Download (260kB) | Preview

Abstract

This paper proposes a decentralized trust establishment protocol for mobile ad hoc networks (MANETs), where nodes establish security associations. In order to achieve privacy and security, we use homomorphic encryption and polynomial intersection so as to find the intersection of two sets. The first set represents a list of recommenders of the initiator and the second set is a list of trusted recommenders of the responder. The intersection of the sets represents a list of nodes that recommend the first node and their recommendations are trusted by the second node. In our experimental results we show that our scheme is effective even if there are 30 trusted nodes.

Item Type: Conference or Workshop Item (Paper)
Additional Information: DOI:10.1109/ISCC.2011.5983930 © 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
Uncontrolled Keywords: Trust, homomorphic encryption, reputation system, mobile ad-hoc networks
Subjects: Q Science > QA Mathematics > QA76 Computer software
Divisions: School of Informatics > Centre for Software Reliability
URI: http://openaccess.city.ac.uk/id/eprint/2485

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics