This article presents an information system for location-based routing protocols that does not compromise the privacy of the involved nodes.
This information system provides a representational model of the most frequented locations of a node, this most frequented zone is called its habitat, and a protocol to compare these habitats among nodes given a target location of interest. Then, the protocol can determine which of the neighbors of a node is nearer or farther from this target location and provides this information to the underlying routing protocol.
As it is designed for DTNs, the protocol does not require a trusted third party, instead, it implements a secure multi-party computation based on homomorphic encryption. The protocol is demonstrated to be secure against passive and active adversaries.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados