{"title":"Secure Communication with Non-Causal Side Information in the Low-SNR Regime","authors":"Mustafa El-Halabi, M. Ghantous","doi":"10.1109/EUROCON.2019.8861746","DOIUrl":null,"url":null,"abstract":"The concept of secrecy capacity per unit cost was introduced in the study of cost-efficient secure wide-band communications. It has been established that for a degraded memoryless wiretap channel, a structured orthogonal code achieves the secrecy capacity per unit cost. In this paper, we consider a memoryless wiretap channel with channel state, where the state is available non-causally to the transmitter as side information. Under the assumption of the existence of a zero cost input “0”, it is shown that a lower bound on the secrecy capacity per unit cost for such a channel can be achieved using a nested orthogonal random binning coding scheme.","PeriodicalId":232097,"journal":{"name":"IEEE EUROCON 2019 -18th International Conference on Smart Technologies","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE EUROCON 2019 -18th International Conference on Smart Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUROCON.2019.8861746","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The concept of secrecy capacity per unit cost was introduced in the study of cost-efficient secure wide-band communications. It has been established that for a degraded memoryless wiretap channel, a structured orthogonal code achieves the secrecy capacity per unit cost. In this paper, we consider a memoryless wiretap channel with channel state, where the state is available non-causally to the transmitter as side information. Under the assumption of the existence of a zero cost input “0”, it is shown that a lower bound on the secrecy capacity per unit cost for such a channel can be achieved using a nested orthogonal random binning coding scheme.