论任意窃听信道的保密能力

Matthieu Bloch, J. Nicholas Laneman
{"title":"论任意窃听信道的保密能力","authors":"Matthieu Bloch, J. Nicholas Laneman","doi":"10.1109/ALLERTON.2008.4797642","DOIUrl":null,"url":null,"abstract":"We investigate the fundamental secrecy limits of arbitrary wiretap channels using the information-spectrum approach and we provide a random coding theorem for the secrecy capacity under various secrecy metrics. We show how our result specializes to several recent results, e.g., compound channels, parallel channels, and fading channels. As a side benefit, our analysis shows that earlier results hold under more stringent secrecy metrics than previously established.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"73","resultStr":"{\"title\":\"On the secrecy capacity of arbitrary wiretap channels\",\"authors\":\"Matthieu Bloch, J. Nicholas Laneman\",\"doi\":\"10.1109/ALLERTON.2008.4797642\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the fundamental secrecy limits of arbitrary wiretap channels using the information-spectrum approach and we provide a random coding theorem for the secrecy capacity under various secrecy metrics. We show how our result specializes to several recent results, e.g., compound channels, parallel channels, and fading channels. As a side benefit, our analysis shows that earlier results hold under more stringent secrecy metrics than previously established.\",\"PeriodicalId\":120561,\"journal\":{\"name\":\"2008 46th Annual Allerton Conference on Communication, Control, and Computing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"73\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 46th Annual Allerton Conference on Communication, Control, and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2008.4797642\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2008.4797642","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 73

摘要

利用信息频谱方法研究了任意窃听信道的基本保密极限,并给出了不同保密度量下保密容量的随机编码定理。我们展示了我们的结果是如何专门针对几个最近的结果的,例如,复合信道,并行信道和衰落信道。作为附带的好处,我们的分析表明,早期的结果比以前建立的更严格的保密指标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On the secrecy capacity of arbitrary wiretap channels
We investigate the fundamental secrecy limits of arbitrary wiretap channels using the information-spectrum approach and we provide a random coding theorem for the secrecy capacity under various secrecy metrics. We show how our result specializes to several recent results, e.g., compound channels, parallel channels, and fading channels. As a side benefit, our analysis shows that earlier results hold under more stringent secrecy metrics than previously established.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信