A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Complexity of Network Design for Private Communication and the P-vs-NP Question
2014
International Journal of Advanced Computer Science and Applications
We investigate infeasibility issues arising along network design for information-theoretically secure cryptography. In particular, we consider the problem of communication in perfect privacy and formally relate it to graph augmentation problems and the P-vs-NP-question. Based on a game-theoretic privacy measure, we consider two optimization problems related to secure infrastructure design with constraints on computational efforts and limited budget to build a transmission network. It turns out
doi:10.14569/ijacsa.2014.050222
fatcat:n6hb5aitrvcv5ejebjnkayfl7a