.png){kind=icon}
.png){kind=icon}
Return
Secure polar coding for a joint source-channel model
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-020-3119-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper investigates a joint source-channel model where Alice, Bob, and Eve, observe components of a discrete memoryless source and communicate over a discrete memoryless wiretap channel which is independent of the source. Alice and Bob wish to agree upon a secret key and simultaneously communicate a secret message, both of which are required to be kept concealed from Eve. An achievable tradeoff region between the secret-key and secret-message rates has been established in the literature. In this paper, we propose an explicit polar coding scheme that achieves the tradeoff region for general sources and channels under the strong secrecy criterion. The encoding scheme is constructed based on a nontrivial combination of (1) encoding scheme for secret-key generation using correlated sources, (2) utilizing the generated key as a one-time pad to encrypt the secret message partially, and (3) a modified form of wiretap channel encoding scheme that incorporates the structure of superposition coding.
Keywords:
polar codes
joint source-channel model
correlated sources
secret-key generation
wiretap channel
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
4.9K
Citations:
8.9K