Private Key and Decoder Side Information for Secure and Private Source Coding

被引:2
作者
Gunlu, Onur [1 ]
Schaefer, Rafael F. [2 ,3 ]
Boche, Holger [4 ,5 ,6 ,7 ]
Poor, Harold Vincent [8 ]
机构
[1] Linkoping Univ, Informat Coding Div, S-58183 Linkoping, Sweden
[2] Tech Univ Dresden, Chair Informat Theory & Machine Learning, D-01062 Dresden, Germany
[3] Tech Univ Dresden, BMBF Res Hub 6G Life, D-01062 Dresden, Germany
[4] Tech Univ Munich, TUM Sch Computat Informat & Technol, Lehrstuhl Theoret Informat Tech, D-80333 Munich, Germany
[5] Ruhr Univ Bochum, CASA Cyber Secur Age Large Scale Adversaries Exze, D-44780 Bochum, Germany
[6] Tech Univ Munich, BMBF Res Hub 6G Life, D-80333 Munich, Germany
[7] Munich Ctr Quantum Sci & Technol MCQST, Schellingstr 4, D-80799 Munich, Germany
[8] Princeton Univ, Dept Elect & Comp Engn, Princeton, NJ 08544 USA
基金
美国国家科学基金会;
关键词
information theoretic security; secure source coding; remote source; private key; side information; AGREEMENT; RANDOMNESS; SECRECY; ENTROPY;
D O I
10.3390/e24121716
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We extend the problem of secure source coding by considering a remote source whose noisy measurements are correlated random variables used for secure source reconstruction. The main additions to the problem are as follows: (1) all terminals noncausally observe a noisy measurement of the remote source; (2) a private key is available to all legitimate terminals; (3) the public communication link between the encoder and decoder is rate-limited; and (4) the secrecy leakage to the eavesdropper is measured with respect to the encoder input, whereas the privacy leakage is measured with respect to the remote source. Exact rate regions are characterized for a lossy source coding problem with a private key, remote source, and decoder side information under security, privacy, communication, and distortion constraints. By replacing the distortion constraint with a reliability constraint, we obtain the exact rate region for the lossless case as well. Furthermore, the lossy rate region for scalar discrete-time Gaussian sources and measurement channels is established. An achievable lossy rate region that can be numerically computed is also provided for binary-input multiple additive discrete-time Gaussian noise measurement channels.
引用
收藏
页数:22
相关论文
共 53 条
[1]   COMMON RANDOMNESS IN INFORMATION-THEORY AND CRYPTOGRAPHY .1. SECRET SHARING [J].
AHLSWEDE, R ;
CSISZAR, I .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) :1121-1132
[2]  
Anantharam V., 2007, LECT NOTES STOCHASTI
[3]   The CEO problem [J].
Berger, T ;
Zhang, Z ;
Viswanathan, H .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (03) :887-902
[4]  
Berger T., 1971, Rate distortion theory: A mathematical basis for data compression
[5]   SIMPLE CONVERSE FOR BROADCAST CHANNELS WITH ADDITIVE WHITE GAUSSIAN NOISE [J].
BERGMANS, PP .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) :279-280
[6]   An overview of information-theoretic security and privacy: Metrics, limits and applications [J].
Bloch M. ;
Günlü O. ;
Yener A. ;
Oggier F. ;
Poor H.V. ;
Sankar L. ;
Schaefer R.F. .
IEEE Journal on Selected Areas in Information Theory, 2021, 2 (01) :5-22
[7]  
Bloch M., 2018, LECT NOTES INFORM TH
[8]   Secure Cooperative Source-Coding With Side Information at the Eavesdropper [J].
Bross, Shraga I. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (08) :4544-4558
[9]   EXTENSION OF AN ENTROPY PROPERTY FOR BINARY INPUT MEMORYLESS SYMMETRIC CHANNELS [J].
CHAYAT, N ;
SHAMAI, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (05) :1077-1079
[10]  
Cover T. M., 2006, Elements of Information Theory, V2, DOI 10.1002/0471200611