安全量化的低复杂度指标分配

João Almeida, G. Maierbacher, J. Barros
{"title":"安全量化的低复杂度指标分配","authors":"João Almeida, G. Maierbacher, J. Barros","doi":"10.1109/CISS.2009.5054850","DOIUrl":null,"url":null,"abstract":"Focusing on the design of scalar quantizers for secure communication in a wiretap environment we propose a low-complexity encoding method that minimizes the end-to-end distortion between legitimate terminals while maximizing the distortion at the eavesdropping receiver. The key idea is to generate confusion by means of randomized index assignments. A simple iterative optimization scheme is shown to yield low distortion mappings with noticeable privacy benefits.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Low-complexity index assignments for secure quantization\",\"authors\":\"João Almeida, G. Maierbacher, J. Barros\",\"doi\":\"10.1109/CISS.2009.5054850\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Focusing on the design of scalar quantizers for secure communication in a wiretap environment we propose a low-complexity encoding method that minimizes the end-to-end distortion between legitimate terminals while maximizing the distortion at the eavesdropping receiver. The key idea is to generate confusion by means of randomized index assignments. A simple iterative optimization scheme is shown to yield low distortion mappings with noticeable privacy benefits.\",\"PeriodicalId\":433796,\"journal\":{\"name\":\"2009 43rd Annual Conference on Information Sciences and Systems\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-03-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 43rd Annual Conference on Information Sciences and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2009.5054850\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 43rd Annual Conference on Information Sciences and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2009.5054850","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

针对窃听环境下安全通信的标量量化器设计,提出了一种低复杂度的编码方法,该方法可以最大限度地减少合法终端之间的端到端失真,同时最大限度地提高窃听接收端的失真。关键思想是通过随机索引分配来产生混淆。一个简单的迭代优化方案显示产生低失真映射与显著的隐私利益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Low-complexity index assignments for secure quantization
Focusing on the design of scalar quantizers for secure communication in a wiretap environment we propose a low-complexity encoding method that minimizes the end-to-end distortion between legitimate terminals while maximizing the distortion at the eavesdropping receiver. The key idea is to generate confusion by means of randomized index assignments. A simple iterative optimization scheme is shown to yield low distortion mappings with noticeable privacy benefits.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Molecular recognition as an information channel: The role of conformational changes Extrinsic tree decoding Message transmission and state estimation over Gaussian broadcast channels Iteratively re-weighted least squares for sparse signal reconstruction from noisy measurements Speech enhancement using the multistage Wiener filter
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1