Wiretap channel with strictly causal side information at encoder
Wiretap channel with strictly causal side information at encoder
复制标题
编码器处具有严格因果辅助信息的窃听通道
DOI：
10.1109/iwcit.2014.6842507
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
G. Hodtani
中科院分区：
文献类型：
--
作者：
Amir Sonee;G. Hodtani
本文对文献[2]中研究的具有边信息的窃听信道进行了重新研究，在这种情况下，边信息只能在编码端以严格的因果方式获得。基于一种编码方案，我们推导出了信道保密容量的下界，该编码方案由块马尔可夫编码和使用编码端可用的严格因果状态信息生成密钥组成。为了提供消息的保密性，在每个块的末尾，使用由编码器获得的状态序列的描述来生成密钥，该密钥对要在下一块中发送的消息的全部或部分进行加密。此外，为了使解码器能够解密消息，每个块的状态序列的描述与该块的消息一起发送。在编码端状态是非因果已知的情况下，给出了保密容量的一个上界，并证明了它与特殊情况下的下界重合，从而得到了保密容量。
In this paper, the wiretap channel with side information studied in [2] is revisited for the case in which the side information is available only at the encoder and in a strictly causal manner. We derive a lower bound on the secrecy capacity of the channel based on a coding scheme which consists of block Markov encoding and key generation using the strictly causal state information available at the encoder. In order to provide the secrecy of messages, at the end of each block a description of the state sequence obtained by the encoder is used to generate the key which encrypts the whole or part of the message to be transmitted in the next block. Moreover, for the decoder to be able to decrypt the messages, the description of the sate sequence of each block is sent in common with the message of that block. Also, an upper bound on the secrecy capacity is developed which assumes that the state is noncausally known at the encoder and we prove that it would coincide the lower bound for a special case and results in the secrecy capacity.