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. In: ISCC. 2011 IEEE Symposium on Computers and Communications (ISCC), 28 June - 1 July 2011, Kerkyra, Greece. doi: 10.1109/ISCC.2011.5983930
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.
Publication 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. |
Publisher Keywords: | Trust, homomorphic encryption, reputation system, mobile ad-hoc networks |
Subjects: | Q Science > QA Mathematics > QA76 Computer software |
Departments: | School of Science & Technology > Computer Science > Software Reliability |
Download (260kB) | Preview
Export
Downloads
Downloads per month over past year