Constraint-Based Privacy Preserving-Path Computation Element

Autor:	Hamid Hajaje, Zine El Abidine Guennoun, Mouhcine Guennoun
Rok vydání:	2019
Předmět:	Constraint (information theory) Privacy preserving Mathematical optimization 010201 computation theory & mathematics Computer science Path computation element 05 social sciences 050301 education 0102 computer and information sciences 0503 education 01 natural sciences
Zdroj:	International Journal of Smart Security Technologies. 6:1-32
ISSN:	2640-4087 2640-4079
DOI:	10.4018/ijsst.2019070101
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::64f8121ce153c230b4225e9256fe4283 https://doi.org/10.4018/ijsst.2019070101 Zobrazit plný text záznamu