Secure Storage Capacity Under Rate Constraints—Continuity and Super Activation

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.

[1]  H. Vincent Poor,et al.  On the Computability of the Secret Key Capacity under Rate Constraints , 2019, ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[2]  Noga Alon,et al.  The Shannon Capacity of a Union , 1998, Comb..

[3]  Claude E. Shannon,et al.  The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[4]  Holger Boche,et al.  On the Algorithmic Computability of the Secret Key and Authentication Capacity Under Channel, Storage, and Privacy Leakage Constraints , 2019, IEEE Transactions on Signal Processing.

[5]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[6]  Holger Boche,et al.  Information Theoretic Security and Privacy of Information Systems , 2017 .

[7]  Moritz Wiese,et al.  The Arbitrarily Varying Wiretap Channel - Secret Randomness, Stability, and Super-Activation , 2016, IEEE Trans. Inf. Theory.

[8]  H. Vincent Poor,et al.  Privacy–Security Trade-Offs in Biometric Security Systems—Part I: Single Use Case , 2011, IEEE Transactions on Information Forensics and Security.

[9]  Willem H. Haemers,et al.  On Some Problems of Lovász Concerning the Shannon Capacity of a Graph , 1979, IEEE Trans. Inf. Theory.

[10]  H. Vincent Poor,et al.  Analytical Properties of Shannon’s Capacity of Arbitrarily Varying Channels under List Decoding: Super-Additivity and Discontinuity Behavior , 2018, Probl. Inf. Transm..

[11]  Rudolf Ahlswede,et al.  Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.

[12]  J. Smolin,et al.  Quantum communication with Gaussian channels of zero quantum capacity , 2011 .

[13]  Holger Boche,et al.  Robust authentication and data storage with perfect secrecy , 2017, 2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[14]  Graeme Smith,et al.  Quantum Communication with Zero-Capacity Channels , 2008, Science.

[15]  U. Maurer,et al.  Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.

[16]  Shlomo Shamai,et al.  Secret key generation over noisy channels with common randomness , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[17]  Gerhard P. Fettweis,et al.  The Tactile Internet: Applications and Challenges , 2014, IEEE Vehicular Technology Magazine.

[18]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[19]  H. Vincent Poor,et al.  Secure Communication Under Channel Uncertainty and Adversarial Attacks , 2015, Proceedings of the IEEE.

[20]  Onur Günlü.  Key Agreement with Physical Unclonable Functions and Biometric Identifiers , 2019 .

[21]  Holger Boche,et al.  Storage of general data sources on a public database with security and privacy constraints , 2017, 2017 IEEE Conference on Communications and Network Security (CNS).

[22]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[23]  H. Witsenhausen.  ON SEQUENCES OF PAIRS OF DEPENDENT RANDOM VARIABLES , 1975 .

[24]  Frans M. J. Willems,et al.  Biometric Security from an Information-Theoretical Perspective , 2012, Found. Trends Commun. Inf. Theory.

[25]  Matthieu R. Bloch,et al.  Physical-Layer Security: From Information Theory to Security Engineering , 2011 .