Vendor : University of California
E-mail this page
Related Content
Remember this itemFormat: PDF
Date:
2007-08-01
Overview
This paper presents two new schemes that, in the absence of a centralized support, allow a pair of nodes of a mobile ad hoc network to compute a shared key without communicating. Such a service is important to secure routing protocols. The schemes are built using the well-known technique of threshold secret sharing and are secure against a collusion of up to a certain number of nodes. The paper evaluates and compares the performance of both the schemes in terms of the node admission and pairwise key establishment costs.
|
|