Blind forwarding for secure and private communications in untrusted networks
Yacine Ichibane, Zouhair Guennoun, Youssef Gahi, Mouhcine Guennoun · 2016
The longest prefix match is an algorithm used in routers to determine the next hop to which an entering packet must be forwarded based on its destination IP address. In this paper we present a blind forwarding scheme by implementing the longest prefix match algorithm using a homomorphic encryption scheme to deal with encrypted destination IP addresses. The goal of this protocol is to prevent any intermediate router from knowing which end server a given client is trying to reach, thus enabling the protection of the privacy of both the client and the server.