Table of Links Abstract and I. Introduction Abstract and I. Introduction II. System Model II. System Model III. Secure and Private Source Coding Regions III. Secure and Private Source Coding Regions IV. Gaussian Sources and Channels IV. Gaussian Sources and Channels V. Proof for Theorem 1 V. Proof for Theorem 1 Acknowledgment and References Acknowledgment and References III. SECURE AND PRIVATE SOURCE CODING REGIONS A. Lossy Source Coding A. Lossy Source Coding The lossy secure and and private source coding region RD is characterized below; see Section V for its proof. We remark that (12) and (13) show that one can simultaneously achieve strong secrecy and strong privacy, i.e., the conditional mutual information terms in (2) and (3), respectively, are negligible, by using a large private key K, which is a result missing in some recent works on secure source coding with private key. B. Lossless Source Coding B. Lossless Source Coding The lossless secure and and private source coding region R is characterized next; see below for a proof sketch. Denote IV. GAUSSIAN SOURCES AND CHANNELS Suppose the following scalar discrete-time Gaussian source and channel model for the lossy source coding problem depicted in Fig. We next take the liberty to use the lossy rate region in Corollary 1, characterized for discrete memoryless channels, for the model in (29)-(31). This is common in the literature since there is a discretization procedure to extend the achievability proof to well-behaved continuous-alphabet random variables and the converse proof applies to arbitrary random variables; see [2, Remark 3.8]. For Gaussian sources and channels, we use differential entropy and eliminate the cardinality bound on the auxiliary random variable. The lossy source coding region for the model in (29)-(31) without a private key is given below. One can also show that Thus, by calculating (25)-(27), the achievability proof follows. For the converse proof, one can first show that Next, consider Combining the distortion constraint given in Corollary 1 with (50) and (51), the converse proof for (35) follows. Authors:
(1) Onur Gunlu, Chair of Communications Engineering and Security, University of Siegen and Information Coding Division, Department of Electrical Engineering, Linkoping University (onur.guenlue@uni-siegen.de);
(2) Rafael F. Schaefer, Chair of Communications Engineering and Security, University of Siegen (rafael.schaefer@uni-siegen.de);
(3) Holger Boche, Chair of Theoretical Information Technology, Technical University of Munich, CASA: Cyber Security in the Age of Large-Scale Adversaries Exzellenzcluster, Ruhr-Universitat Bochum, and BMBF Research Hub 6G-Life, Technical University of Munich (boche@tum.de);
(4) H. Vincent Poor, Department of Electrical and Computer Engineering, Princeton University (poor@princeton.edu). Authors: Authors: (1) Onur Gunlu, Chair of Communications Engineering and Security, University of Siegen and Information Coding Division, Department of Electrical Engineering, Linkoping University (onur.guenlue@uni-siegen.de); (2) Rafael F. Schaefer, Chair of Communications Engineering and Security, University of Siegen (rafael.schaefer@uni-siegen.de); (3) Holger Boche, Chair of Theoretical Information Technology, Technical University of Munich, CASA: Cyber Security in the Age of Large-Scale Adversaries Exzellenzcluster, Ruhr-Universitat Bochum, and BMBF Research Hub 6G-Life, Technical University of Munich (boche@tum.de); (4) H. Vincent Poor, Department of Electrical and Computer Engineering, Princeton University (poor@princeton.edu). This paper is available on arxiv under CC BY 4.0 DEED license. This paper is available on arxiv under CC BY 4.0 DEED license. available on arxiv available on arxiv

Part of HackerNoon's growing list of open-source research papers, promoting free access to academic material.

One-Time Padding Still Matters in Modern Cryptography

Can Privacy Issues Be Resolved with Secure Source Coding?

EScholar Technologies

Too Long; Didn't Read

Boost your HackerNoon story @ $159.99! 🚀

Can Coding Be Both Lossless and Private?

About Author

Comments

TOPICS

THIS ARTICLE WAS FEATURED IN

Related Stories

Untitled Story

5 Ways to Measure Privacy Risks in Text Data

Can Privacy Issues Be Resolved with Secure Source Coding?

One-Time Padding Still Matters in Modern Cryptography

Fractal Geometry as the Blueprint for Encryption

Can Privacy Issues Be Resolved with Secure Source Coding?

5 Ways to Measure Privacy Risks in Text Data

Can Privacy Issues Be Resolved with Secure Source Coding?

One-Time Padding Still Matters in Modern Cryptography

Fractal Geometry as the Blueprint for Encryption

Can Privacy Issues Be Resolved with Secure Source Coding?

Light-Mode

Classic

Newspaper

Dark-Mode

Neon Noir

Minty

HN StartUps