Secure Cooperative Source-Coding With Side Information at the Eavesdropper

In the secure cooperative source-coding problem that we consider, Encoder 1 and Decoder 1 observe, respectively, a pair of independent identically distributed (i.i.d.) correlated sources and wish to communicate the first source to Decoder 2 subject to a distortion constraint. Encoder 1 sends a messa...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 62; no. 8; pp. 4544 - 4558
Main Author Bross, Shraga I.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.08.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN0018-9448
1557-9654
DOI10.1109/TIT.2016.2572727

Cover

More Information
Summary:In the secure cooperative source-coding problem that we consider, Encoder 1 and Decoder 1 observe, respectively, a pair of independent identically distributed (i.i.d.) correlated sources and wish to communicate the first source to Decoder 2 subject to a distortion constraint. Encoder 1 sends a message to both the decoders over a public nonsecure channel, and then Decoder 1-the helper-sends a message just to Decoder 2 over a secure channel. An eavesdropper, which has access to memoryless side-information that is correlated with the first source, intercepts the message sent by Encoder 1 and based on both wishes to minimize its uncertainty about the first source. The secrecy measure of the system is the equivocation of the first source at the eavesdropper. We determine the rates equivocation region for this problem assuming that conditioned on the side-information of Decoder 1 the eavesdropper's side-information is independent of the first source. To that end, we derive an inner and an outer bound that depend explicitly on the proportional rate that Encoder 1 spends in the cooperation process. Subsequently, we evaluate this region for the case of a doubly symmetric binary source and Hamming distortion.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2016.2572727