Polynomial based scheme (PBS) for establishing Authentic Associations in Wireless Mesh Networks

Authors:
Amit Gaur;Abhinav Prakash;Saugat Joshi;Dharma P. Agrawal
Affiliations:
Center for Distributed and Mobile Computing (CDMC), University of Cincinnati, Cincinnati, OH 45221-0030, United States;Center for Distributed and Mobile Computing (CDMC), University of Cincinnati, Cincinnati, OH 45221-0030, United States;Center for Distributed and Mobile Computing (CDMC), University of Cincinnati, Cincinnati, OH 45221-0030, United States;Center for Distributed and Mobile Computing (CDMC), University of Cincinnati, Cincinnati, OH 45221-0030, United States
Venue:
Journal of Parallel and Distributed Computing
Year:
2010

Citing 5
Cited 0

A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
Perfectly-Secure Key Distribution for Dynamic Conferences

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Random Key Predistribution Schemes for Sensor Networks

SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Security of IEEE 802.16 in mesh mode

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Wireless Mesh Networks: Current Challenges and Future Directions of Web-In-The-Sky

IEEE Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The varying degree of mobility of Mesh Clients has provided much more flexibility in Wireless Mesh Networks, and establishing an Authentic Association among entities is a non-trivial problem. In this paper, we introduce a Polynomial Based scheme which provides pair-wise connectivity, low communication, marginal storage overhead and high scalability while making on the fly Authentic Association feasible. The proposed scheme is also observed to be resilient against both traffic analysis and node capture attacks.