Papers
Topics
Authors
Recent
Search
2000 character limit reached

Secure Polar Coding with Delayed Wiretapping Information

Published 29 Dec 2018 in cs.IT and math.IT | (1812.11271v2)

Abstract: In this paper, we investigate the secure coding issue for a wiretap channel model with fixed main channel and varying wiretap channel, by assuming that legitimate parties can obtain the wiretapping channel state information (CSI) after some time delay. For the symmetric degraded delay CSI case, we present an explicit weak security scheme by constructing secure polar codes on a one-time pad chaining structure, and prove its weak security, reliability and capability of approaching the secrecy capacity of perfect CSI case with delay CSI assumption. Further for the symmetric no-degraded delay CSI case, we present a modified multi-block chaining structure in which the original subset of frozen bit is designed for conveying functional random bits securely. Then we combine this modified multi-block chaining structure with the weak security scheme to construct an explicit strong security polar coding scheme, and prove its strong security, reliability and also the capability of approaching the secrecy capacity of perfect CSI case with delay CSI assumption. At last, we carry out stimulations to prove the performance of both secure schemes.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.