Privacy-preserving scheme for mobile ad hoc networks

In this paper we propose a decentralized privacy-preserving scheme 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 common friends of two nodes. Through our experimental results we verify the correctness of our scheme given the limitations of MANETs.

[1]  Joan Feigenbaum,et al.  Decentralized trust management , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.

[2]  Chris McDonald,et al.  Trust Establishment In Pure Ad-hoc Networks , 2006, Wirel. Pers. Commun..

[3]  Maxim Raya,et al.  The security of vehicular ad hoc networks , 2005, SASN '05.

[4]  Pin-Han Ho,et al.  Security in vehicular ad hoc networks , 2008, IEEE Commun. Mag..

[5]  Félix Gómez Mármol,et al.  Providing trust in wireless sensor networks using a bio-inspired technique , 2011, Telecommun. Syst..

[6]  Benny Pinkas,et al.  Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.

[7]  Chris McDonald,et al.  Establishing Trust In Pure Ad-hoc Networks , 2004, ACSC.

[8]  Pawan Kumar,et al.  Notice of Violation of IEEE Publication Principles Security in Vehicular Ad-hoc Networks , 2009 .

[9]  Kai Hwang,et al.  GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks , 2008, IEEE Transactions on Knowledge and Data Engineering.

[10]  Audun Jøsang,et al.  A survey of trust and reputation systems for online service provision , 2007, Decis. Support Syst..

[11]  Indranil Sengupta,et al.  A Distributed Trust Establishment Scheme for Mobile Ad Hoc Networks , 2007, 2007 International Conference on Computing: Theory and Applications (ICCTA'07).

[12]  C. Karlof,et al.  Secure routing in wireless sensor networks: attacks and countermeasures , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[13]  Félix Gómez Mármol,et al.  Security threats scenarios in trust and reputation models for distributed systems , 2009, Comput. Secur..

[14]  Jacques Stern,et al.  A new public key cryptosystem based on higher residues , 1998, CCS '98.

[15]  Akbar Ghaffarpour Rahbar,et al.  PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing , 2007, IEEE Transactions on Parallel and Distributed Systems.

[16]  Kai Hwang,et al.  PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing , 2007, IEEE Transactions on Parallel and Distributed Systems.

[17]  Tasos Dagiuklas,et al.  Dynamic trust establishment in emergency ad hoc networks , 2009, IWCMC.

[18]  Panagiotis Papadimitratos,et al.  On Data-Centric Trust Establishment in Ephemeral Ad Hoc Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[19]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[20]  Jennifer Golbeck,et al.  Computing with Trust: Definition, Properties, and Algorithms , 2006, 2006 Securecomm and Workshops.

[21]  Ananthram Swami,et al.  Towards Trust-based Cognitive Networks: A Survey of Trust Management for Mobile Ad Hoc Networks , 2009 .