Affiliation:
1. Mohammed V University, Rabat, Morocco
2. Cisco Systems, Ontario, Canada
Abstract
Information privacy and protection is fundamental in the context of path computation. When a path computation client (PCC) requests the shortest path between two nodes from a path computation element (PCE), it desires to do so while protecting the sensitive information carried by the query as well as the overall topology of the network. The authors provide a novel framework to compute the shortest path, between a source and a destination, subject to a constraint, represented in the case by a required minimum bandwidth, while preserving the privacy of both client and server. By employing a secure homomorphic encryption scheme, the PCE can blindly compute the path while being oblivious to the content of the encrypted queries. The output of the PCE computation is an encrypted path that is only decipherable by its original secret key. The implementation using the homomorphic scheme over the integers from Van Dijk, Gentry, Halevi, and Vaikuntanathan (DGHV) shows promising results that the authors analyze in detail throughout this paper.
Reference46 articles.
1. Applebaum, B., Ishai, Y., & Kushilevitz, E. (2014). How to garble arithmetic circuits. SIAM Journal on Computing, 43(2), 905–929.
2. Atallah, M., & Du, W. (2001). Secure multi-party computational geometry. In Algorithms and Data Structures (pp. 165–179). Academic Press.
3. Azevedo, J. A., Madeira, J., Costa, M., Martins, E. Q. V., & Pires, F. (1994). A computational improvement for a shortest paths ranking algorithm. European Journal of Operational Research, 73, 188–191.
4. Azevedo, J., Costa, M. E. O. S., Madeira, J. J. E. S., & Martins, E. Q. V. (1993). An algorithm for the ranking of shortest paths. European Journal of Operational Research, 69(1), 97–106.
5. Benaloh, J. (1994). Dense probabilistic encryption. In Proceedings of the workshop on selected areas of cryptography (pp. 120-128). Academic Press.