Secure Storage Capacity under Rate Constraints — Continuity and Super Activation
2019Konferenz / Journal
Autor*innen
Sebastian Baur Harold Vincent Poor Rafael Schaefer Holger Boche
Research Hub
Research Hub A: Kryptographie der Zukunft
Research Hub B: Eingebettete Sicherheit
Research Challenges
RC 2: Quantum-Resistant Cryptography
RC 5: Physical-Layer Security
Abstract
The source model for secret key generation with one way public communication refers to a setting in which a secret key should be agreed upon at two terminals. At both terminals correlated components of a common source are available. In addition, a message can be sent from one terminal to the other via a public channel. In this paper, a related scenario is considered where instead of secret key generation, the goal is to securely store data in a public database. The database allows for error-free storing of the data, but is constrained in its size which imposes a rate constraint on storing. The corresponding capacity for secure storage is known and it has been shown that the capacity-achieving strategy satisfies the strong secrecy criterion. Here, the case when the storage in the public database is subject to errors is considered and the corresponding capacity is characterized. In addition, the continuity properties of the two capacity functions are analyzed. These capacity functions are continuous as opposed to the discontinuous secret key capacity with rate constraint. It is shown that for secure storage the phenomenon of super activation can occur. Finally, it is discussed how the results in this paper differ from previous results on super activation.