Semantic-Security Capacity for the Physical Layer via Information Theory

Ziv Goldfeld, P. Cuff, H. Permuter
{"title":"Semantic-Security Capacity for the Physical Layer via Information Theory","authors":"Ziv Goldfeld, P. Cuff, H. Permuter","doi":"10.1109/SWSTE.2016.12","DOIUrl":null,"url":null,"abstract":"Physical layer security can ensure secure communication over noisy channels in the presence of an eavesdropper with unlimited computational power. We adopt an information theoretic variant of semantic-security (SS) (a cryptographic gold standard), as our secrecy metric and study the open problem of the type II wiretap channel (WTC II) with a noisy main channel is, whose secrecy-capacity is unknown even under looser metrics than SS. Herein the secrecy-capacity is derived and shown to be equal to its SS capacity. In this setting, the legitimate users communicate via a discrete-memory less (DM) channel in the presence of an eavesdropper that has perfect access to a subset of its choosing of the transmitted symbols, constrained to a fixed fraction of the block length. The secrecy criterion is achieved simultaneously for all possible eavesdropper subset choices. On top of that, SS requires negligible mutual information between the message and the eavesdropper's observations even when maximized over all message distributions. A key tool for the achievability proof is a novel and stronger version of Wyner's soft covering lemma. Specifically, the lemma shows that a random codebook achieves the soft-covering phenomenon with high probability. The probability of failure is doubly-exponentially small in the block length. Since the combined number of messages and subsets grows only exponentially with the block length, SS for the WTC II is established by using the union bound and invoking the stronger soft-covering lemma. The direct proof shows that rates up to the weak-secrecy capacity of the classic WTC with a DM erasure channel (EC) to the eavesdropper are achievable. The converse follows by establishing the capacity of this DM wiretap EC as an upper bound for the WTC II. From a broader perspective, the stronger soft-covering lemma constitutes a tool for showing the existence of codebooks that satisfy exponentially many constraints, a beneficial ability for many other applications in information theoretic security.","PeriodicalId":118525,"journal":{"name":"2016 IEEE International Conference on Software Science, Technology and Engineering (SWSTE)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Software Science, Technology and Engineering (SWSTE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SWSTE.2016.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Physical layer security can ensure secure communication over noisy channels in the presence of an eavesdropper with unlimited computational power. We adopt an information theoretic variant of semantic-security (SS) (a cryptographic gold standard), as our secrecy metric and study the open problem of the type II wiretap channel (WTC II) with a noisy main channel is, whose secrecy-capacity is unknown even under looser metrics than SS. Herein the secrecy-capacity is derived and shown to be equal to its SS capacity. In this setting, the legitimate users communicate via a discrete-memory less (DM) channel in the presence of an eavesdropper that has perfect access to a subset of its choosing of the transmitted symbols, constrained to a fixed fraction of the block length. The secrecy criterion is achieved simultaneously for all possible eavesdropper subset choices. On top of that, SS requires negligible mutual information between the message and the eavesdropper's observations even when maximized over all message distributions. A key tool for the achievability proof is a novel and stronger version of Wyner's soft covering lemma. Specifically, the lemma shows that a random codebook achieves the soft-covering phenomenon with high probability. The probability of failure is doubly-exponentially small in the block length. Since the combined number of messages and subsets grows only exponentially with the block length, SS for the WTC II is established by using the union bound and invoking the stronger soft-covering lemma. The direct proof shows that rates up to the weak-secrecy capacity of the classic WTC with a DM erasure channel (EC) to the eavesdropper are achievable. The converse follows by establishing the capacity of this DM wiretap EC as an upper bound for the WTC II. From a broader perspective, the stronger soft-covering lemma constitutes a tool for showing the existence of codebooks that satisfy exponentially many constraints, a beneficial ability for many other applications in information theoretic security.
基于信息论的物理层语义安全能力
物理层安全可以确保在具有无限计算能力的窃听者存在的嘈杂信道上的安全通信。我们采用语义安全(SS)(一种密码学黄金标准)的信息理论变体作为我们的保密度量,并研究了具有噪声主信道的II型窃听信道(WTC II)的开放问题,其保密容量即使在比SS更宽松的度量下也是未知的。在此推导了其保密容量并证明其等于其SS容量。在这种情况下,合法用户在窃听者存在的情况下,通过离散内存较少(DM)信道进行通信,窃听者可以完全访问其选择的传输符号的子集,限制为块长度的固定分数。对所有可能的窃听者子集选择同时实现保密准则。最重要的是,即使在所有消息分布上最大化时,SS对消息和窃听者观察之间的相互信息的要求也可以忽略不计。可实现性证明的一个关键工具是Wyner软覆盖引理的一个新的和更强的版本。具体来说,引理表明随机码本高概率地实现了软覆盖现象。故障的概率在块长度上是双指数小。由于消息和子集的组合数量仅随块长度呈指数增长,因此WTC II的SS通过使用联合界并调用更强的软覆盖引理来建立。直接证明表明,具有DM擦除信道(EC)的经典WTC的弱保密能力是可以实现的。反之,通过建立该DM窃听EC的容量作为WTC II的上界。从更广泛的角度来看,更强的软覆盖引理构成了显示满足指数多约束的码本存在的工具,这对信息理论安全中的许多其他应用都是有益的能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信