TY - GEN
T1 - Channel upgrading for semantically-secure encryption on wiretap channels
AU - Tal, Ido
AU - Vardy, Alexander
PY - 2013
Y1 - 2013
N2 - Bellare and Tessaro recently introduced a new coding scheme, based on cryptographic principles, that guarantees strong security for a wide range of symmetric wiretap channels. This scheme has numerous advantages over alternative constructions, including constructions based on polar codes. However, it achieves secrecy capacity only under a certain restrictive condition. Specifically, let V be the main channel (from Alice to Bob) and let W be wiretap channel (from Alice to Eve). Suppose that W has a finite output alphabet y, and let X and Y denote the input and output of W, respectively. Then the rate of the Bellare-Tessaro coding scheme is at most I(V) - Ψ(W), where I(V) is the capacity of V and Ψ(W) is given by Ψ(W) = log2y-H(YX). For symmetric channels, it is clear that Φ(τ4) I(W) with equality if and only if uniform input to W produces uniform output. Unfortunately, few symmetric DMCs satisfy this condition. In this paper, we show how the Bellare-Tessaro coding scheme can be extended to achieve secrecy capacity in the case where W is an arbitrary symmetric DMC. To this end, we solve the following problem. Given W and ε > 0, we construct another channel Q such that W is degraded with respect to Q while the difference between Ψ(<3) and I(W) is at most ε. We also solve a closely related problem, where the output alphabet of Q is required to be of a given size M. In this case, we construct a channel Q that is equivalent to W, such that Ψ(<3) is a small as possible. We furthermore extend these results, and thereby the applicability of the Bellare-Tessaro coding scheme, to channels with binary input and continuous output.
AB - Bellare and Tessaro recently introduced a new coding scheme, based on cryptographic principles, that guarantees strong security for a wide range of symmetric wiretap channels. This scheme has numerous advantages over alternative constructions, including constructions based on polar codes. However, it achieves secrecy capacity only under a certain restrictive condition. Specifically, let V be the main channel (from Alice to Bob) and let W be wiretap channel (from Alice to Eve). Suppose that W has a finite output alphabet y, and let X and Y denote the input and output of W, respectively. Then the rate of the Bellare-Tessaro coding scheme is at most I(V) - Ψ(W), where I(V) is the capacity of V and Ψ(W) is given by Ψ(W) = log2y-H(YX). For symmetric channels, it is clear that Φ(τ4) I(W) with equality if and only if uniform input to W produces uniform output. Unfortunately, few symmetric DMCs satisfy this condition. In this paper, we show how the Bellare-Tessaro coding scheme can be extended to achieve secrecy capacity in the case where W is an arbitrary symmetric DMC. To this end, we solve the following problem. Given W and ε > 0, we construct another channel Q such that W is degraded with respect to Q while the difference between Ψ(<3) and I(W) is at most ε. We also solve a closely related problem, where the output alphabet of Q is required to be of a given size M. In this case, we construct a channel Q that is equivalent to W, such that Ψ(<3) is a small as possible. We furthermore extend these results, and thereby the applicability of the Bellare-Tessaro coding scheme, to channels with binary input and continuous output.
UR - http://www.scopus.com/inward/record.url?scp=84890405684&partnerID=8YFLogxK
U2 - https://doi.org/10.1109/ISIT.2013.6620489
DO - https://doi.org/10.1109/ISIT.2013.6620489
M3 - منشور من مؤتمر
SN - 9781479904464
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1561
EP - 1565
BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013
T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013
Y2 - 7 July 2013 through 12 July 2013
ER -