Paper Info
Title
On The Computability Of The Secret Key Capacity Under Rate Constraints
Abstract
Secret key generation refers to the problem of generating a common secret key without revealing any information about it to an eavesdropper. All users observe correlated components of a common source and can further use a rate-limited public channel for discussion which is open to eavesdroppers. This paper studies the Turing computability of the secret key capacity with a single rate-limited public forward transmission. Turing computability provides fundamental performance limits for today's digital computers. It is shown that the secret key capacity under rate constraints is not Turing computable, and consequently there is no algorithm that can simulate or compute the secret key capacity, even if there are no limitations on computational complexity and computing power. On the other hand, if there are no rate constraints on the forward transmission, the secret key capacity is Turing computable. This shows that restricting the communication rate over the public channel transforms a Turing computable problem into a non-computable problem. To the best of our knowledge, this is the first time that such a phenomenon has been observed.
Year
DOI
Venue
2019
10.1109/icassp.2019.8683122
2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP)
Keywords
Field
DocType
Secret key generation, secret key capacity, rate constraint, Turing computability
Key generation,Mathematical optimization,Computer science,Communication channel,Theoretical computer science,Computability,Computable function,Turing computability,Computational complexity theory
Conference
ISSN
Citations 
PageRank 
1520-6149
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Holger Boche12348265.41
Rafael F. Schaefer216535.85
H. V. Poor3254111951.66