香农密码系统的率失真理论

Hirosuke Yamamoto
{"title":"香农密码系统的率失真理论","authors":"Hirosuke Yamamoto","doi":"10.1109/ISIT.1994.394669","DOIUrl":null,"url":null,"abstract":"Considers Shannon's cipher system with a memoryless broadcast channel. The source output sequence {S/sub l/}/sub t//sup /spl infin//=1 is independent drawings of a random variable S taking values in S, and the key W/sub k/ is a random variable which is independent of S. For simplicity, we assume that the main channel (X/spl rarr/Y) is less noisy than the wiretap channel (X/spl rarr/Z). The security of the system can be measured by the uncertainty or the attainable minimum distortion of the wiretapper who gets only Z/sup N/. For each case, we define the admissible region.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"147","resultStr":"{\"title\":\"Rate-distortion theory for the Shannon cipher system\",\"authors\":\"Hirosuke Yamamoto\",\"doi\":\"10.1109/ISIT.1994.394669\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Considers Shannon's cipher system with a memoryless broadcast channel. The source output sequence {S/sub l/}/sub t//sup /spl infin//=1 is independent drawings of a random variable S taking values in S, and the key W/sub k/ is a random variable which is independent of S. For simplicity, we assume that the main channel (X/spl rarr/Y) is less noisy than the wiretap channel (X/spl rarr/Z). The security of the system can be measured by the uncertainty or the attainable minimum distortion of the wiretapper who gets only Z/sup N/. For each case, we define the admissible region.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"147\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1994.394669\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1994 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1994.394669","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 147

摘要

认为香农的密码系统有一个无记忆广播频道。源输出序列{S/sub l/}/sub t//sup /spl infin//=1是随机变量S在S中取值的独立图,密钥W/sub k/是与S无关的随机变量,为了简单起见,我们假设主通道(X/spl rarr/Y)比窃听通道(X/spl rarr/Z)噪声小。系统的安全性可以通过窃听者的不确定性或可达到的最小失真来衡量,窃听者只获得Z/sup / N/。对于每种情况,我们定义了可容许区域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Rate-distortion theory for the Shannon cipher system
Considers Shannon's cipher system with a memoryless broadcast channel. The source output sequence {S/sub l/}/sub t//sup /spl infin//=1 is independent drawings of a random variable S taking values in S, and the key W/sub k/ is a random variable which is independent of S. For simplicity, we assume that the main channel (X/spl rarr/Y) is less noisy than the wiretap channel (X/spl rarr/Z). The security of the system can be measured by the uncertainty or the attainable minimum distortion of the wiretapper who gets only Z/sup N/. For each case, we define the admissible region.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信