2014
DOI: 10.14569/ijacsa.2014.050222
|View full text |Cite
|
Sign up to set email alerts
|

Complexity of Network Design for Private Communication and the P-vs-NP Question

Abstract: Abstract-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 that in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
5
2
1

Relationship

3
5

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 29 publications
(55 reference statements)
0
8
0
Order By: Relevance
“…Games have also been studied for the overall design of secure communication layers as networks by [102].…”
Section: Structural and Operational Securitymentioning
confidence: 99%
“…Games have also been studied for the overall design of secure communication layers as networks by [102].…”
Section: Structural and Operational Securitymentioning
confidence: 99%
“…Furthermore, using the same techniques, simultaneous multi-level security against other attacks can be achieved along the same lines to an arbitrarily selected level of service quality [80]. The topology of a quantum network generally has a strong impact on achievable security, and despite theoretical and practical progress in the construction of quantum networks, even without trusted repeaters [33,36,54], the problem remains computationally (in fact, NP-) hard in its most general form [81]. Methods for foiling covert channels and malicious classical post-processing units have been discussed in Reference [82].…”
Section: Security Without Trusted Repeatersmentioning
confidence: 99%
“…From the survey conducted in this study, a link between various types of games and different kinds of security issues was observed. Examples include dynamic games for adaptive network security defence [7][8][9][10][11], multiple-layered and Stackelberg games for proactive protection [12][13][14], investigation of resource allocation methods using mechanism design theory for network security economics [15][16][17][18][19], game-theoretic examination of the concepts of cryptographyauthentication and confidentiality [20,21], network provisioning and design [22][23][24][25], quantitative management of security risks [26][27][28][29][30], and network games for cyber-physical protection dealing with information assurance and critical infrastructure security [31][32][33][34][35].…”
Section: Introductionmentioning
confidence: 99%