A Privacy-Preserving and Secure Framework for Opportunistic Routing in DTNs

摘要

Opportunistic routing has been extensively studied and utilized in delay/disruption-tolerant networks. The extensive use of nodes' local information, e.g., the distance to the destination or the contact frequency with the destination, in such routing schemes can cause severe security and privacy problems. Existing solutions of anonymous routing can introduce undesired overhead and fail to provide the confidentiality of the routing metric. In this paper, we propose an advanced framework for opportunistic routing schemes, providing the following properties: confidentiality of the nodes' routing metric, anonymous authentication, and efficient key agreement for pairwise communication. A comprehensive evaluation, including security analysis, efficiency analysis, and simulation evaluation, is presented to show the security and feasibility of the proposed framework.