Secure Multiterminal Source Coding With Side Information at the Eavesdropper

被引:48
作者
Villard, Joffrey [1 ]
Piantanida, Pablo [1 ]
机构
[1] SUPELEC, Dept Telecommun, F-91192 Gif Sur Yvette, France
关键词
Distributed source coding; eavesdropper; equivocation-rate; rate-distortion region; random codes; secrecy; source coding; side information; Wyner-Ziv coding; RATE-DISTORTION FUNCTION; SHANNON CIPHER SYSTEM; RATE REGION; CAPACITY; SECRECY; COMMUNICATION; CODES; ENTROPY; DECODER; OUTPUTS;
D O I
10.1109/TIT.2013.2245394
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The problem of secure multiterminal source coding with side information at the eavesdropper is investigated. This scenario consists of a main encoder (referred to as Alice) that wishes to compress a single source but simultaneously satisfying the desired requirements on the distortion level at a legitimate receiver (referred to as Bob) and the equivocation rate-average uncertainty-at an eavesdropper (referred to as Eve). It is further assumed the presence of a (public) rate-limited link between Alice and Bob. In this setting, Eve perfectly observes the information bits sent by Alice to Bob and has also access to a correlated source which can be used as side information. A second encoder (referred to as Charlie) helps Bob in estimating Alice's source by sending a compressed version of its own correlated observation via a (private) rate-limited link, which is only observed by Bob. For instance, the problem at hands can be seen as the unification between the Berger-Tung and the secure source coding setups. Inner and outer bounds on the so-called rate-distortion-equivocation region are derived. The inner region turns to be tight for two cases: 1) uncoded side information at Bob and 2) lossless reconstruction of both sources at Bob-secure distributed lossless compression. Application examples to secure lossy source coding of Gaussian and binary sources in the presence of Gaussian and binary/ternary (respectively) side informations are also considered. Optimal coding schemes are characterized for some cases of interest where the statistical differences between the side information at the decoders and the presence of a nonzero distortion at Bob can be fully exploited to guarantee secrecy.
引用
收藏
页码:3668 / 3692
页数:25
相关论文
共 71 条
[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]   SOURCE CODING WITH SIDE INFORMATION AND A CONVERSE FOR DEGRADED BROADCAST CHANNELS [J].
AHLSWEDE, RF ;
KORNER, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (06) :629-637
[3]  
[Anonymous], 2006, Elements of Information Theory
[4]  
[Anonymous], 2010, ARXIV10013404
[5]  
[Anonymous], 2008, IEEE T INF THEORY, V54, P2405
[6]   UPPER BOUND ON THE RATE DISTORTION FUNCTION FOR SOURCE CODING WITH PARTIAL SIDE INFORMATION AT THE DECODER [J].
BERGER, T ;
HOUSEWRIGHT, KB ;
OMURA, JK ;
TUNG, S ;
WOLFOWITZ, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (06) :664-666
[7]   MULTITERMINAL SOURCE ENCODING WITH ONE DISTORTION CRITERION [J].
BERGER, T ;
YEUNG, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (02) :228-236
[8]   The CEO problem [J].
Berger, T ;
Zhang, Z ;
Viswanathan, H .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (03) :887-902
[9]  
Berger T., 1977, MULTITERMINAL SOURCE
[10]   On the Secrecy Capacity of Arbitrary Wiretap Channels [J].
Bloch, Matthieu ;
Laneman, J. Nicholas .
2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, :818-825