Coding schemes for achieving strong secrecy at negligible cost

Document Type

Conference Proceeding

Publication Date

3-1-2017

Abstract

We study the problem of achieving strong secrecy over wiretap channels at negligible cost, in the sense of maintaining the overall communication rate of the same channel without secrecy constraints. Specifically, we propose and analyze two source-channel coding architectures, in which secrecy is achieved by multiplexing public and confidential messages. In both cases, our main contribution is to show that secrecy can be achieved without compromising communication rate and by requiring only randomness of asymptotically vanishing rate. Our first source-channel coding architecture relies on a modified wiretap channel code, in which randomization is performed using the output of a source code. In contrast, our second architecture relies on a standard wiretap code combined with a modified source code termed uniform compression code, in which a small shared secret seed is used to enhance the uniformity of the source code output. We carry out a detailed analysis of uniform compression codes and characterize the optimal size of the shared seed.

Identifier

85013413925 (Scopus)

Publication Title

IEEE Transactions on Information Theory

External Full Text Location

https://doi.org/10.1109/TIT.2016.2645225

ISSN

00189448

First Page

1858

Last Page

1873

Issue

3

Volume

63

Grant

13-BS03-0008

Fund Ref

Agence Nationale de la Recherche

This document is currently not available here.

Share

COinS