可靠和安全区域的高斯窃听信道使用LDPC码与颗粒HARQ

M. H. Taieb, J. Chouinard
{"title":"可靠和安全区域的高斯窃听信道使用LDPC码与颗粒HARQ","authors":"M. H. Taieb, J. Chouinard","doi":"10.1109/WSCNIS.2015.7368289","DOIUrl":null,"url":null,"abstract":"This paper investigates reliable and secure transmissions over the Gaussian wiretap channel. A physical layer coding scheme based on Low-Density-Parity-Check (LDPC) codes with granular Hybrid Automatic Repeat reQuest(HARQ) protocol is presented. Increasing the HARQ granularity aims at sending coded data at the minimum rate required for legitimate successful decoding. This minimizes the information leakage that may benefit to eavesdropping. It will be shown that the granularity increases the frame error rate of the eavesdropper. Since the secrecy level can be assessed through the bit error rate (BER) at the unintended receiver, intraframe and interframe error contamination is employed to convert the loss of only few packets into much higher BERs. After obtaining the BERs at the legitimate and illegitimate receivers the reliable and secret regions can be determined. It is observed that with granular HARQ and interframe error contamination, regions that are reliable and secure at the same time are expanded.","PeriodicalId":253256,"journal":{"name":"2015 World Symposium on Computer Networks and Information Security (WSCNIS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reliable and secure regions for the Gaussian wiretap channel using LDPC codes with granular HARQ\",\"authors\":\"M. H. Taieb, J. Chouinard\",\"doi\":\"10.1109/WSCNIS.2015.7368289\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates reliable and secure transmissions over the Gaussian wiretap channel. A physical layer coding scheme based on Low-Density-Parity-Check (LDPC) codes with granular Hybrid Automatic Repeat reQuest(HARQ) protocol is presented. Increasing the HARQ granularity aims at sending coded data at the minimum rate required for legitimate successful decoding. This minimizes the information leakage that may benefit to eavesdropping. It will be shown that the granularity increases the frame error rate of the eavesdropper. Since the secrecy level can be assessed through the bit error rate (BER) at the unintended receiver, intraframe and interframe error contamination is employed to convert the loss of only few packets into much higher BERs. After obtaining the BERs at the legitimate and illegitimate receivers the reliable and secret regions can be determined. It is observed that with granular HARQ and interframe error contamination, regions that are reliable and secure at the same time are expanded.\",\"PeriodicalId\":253256,\"journal\":{\"name\":\"2015 World Symposium on Computer Networks and Information Security (WSCNIS)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 World Symposium on Computer Networks and Information Security (WSCNIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WSCNIS.2015.7368289\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 World Symposium on Computer Networks and Information Security (WSCNIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WSCNIS.2015.7368289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了在高斯窃听信道上可靠和安全的传输。提出了一种基于低密度奇偶校验(LDPC)码和粒度混合自动重复请求(HARQ)协议的物理层编码方案。增加HARQ粒度旨在以合法成功解码所需的最小速率发送编码数据。这样可以最大限度地减少可能有利于窃听的信息泄漏。结果表明,粒度增加了窃听器的帧错误率。由于保密级别可以通过意外接收端的误码率(BER)来评估,因此采用帧内和帧间错误污染将少量数据包的丢失转换为更高的误码率。获取合法和非法接收者的ber后,就可以确定可靠区域和秘密区域。结果表明,在存在颗粒级HARQ和帧间误差污染的情况下,可靠和安全区域得到了扩展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Reliable and secure regions for the Gaussian wiretap channel using LDPC codes with granular HARQ
This paper investigates reliable and secure transmissions over the Gaussian wiretap channel. A physical layer coding scheme based on Low-Density-Parity-Check (LDPC) codes with granular Hybrid Automatic Repeat reQuest(HARQ) protocol is presented. Increasing the HARQ granularity aims at sending coded data at the minimum rate required for legitimate successful decoding. This minimizes the information leakage that may benefit to eavesdropping. It will be shown that the granularity increases the frame error rate of the eavesdropper. Since the secrecy level can be assessed through the bit error rate (BER) at the unintended receiver, intraframe and interframe error contamination is employed to convert the loss of only few packets into much higher BERs. After obtaining the BERs at the legitimate and illegitimate receivers the reliable and secret regions can be determined. It is observed that with granular HARQ and interframe error contamination, regions that are reliable and secure at the same time are expanded.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Cloudification and security implications of TaaS An improved reduced-complexity scheme to accelerate sphere decoding for MIMO systems Incorporating SHA-2 256 with OFB to realize a novel encryption method Management of utilization and accuracy of positioning approaches in wireless sensor networks The effect of network traffic on Duplicate Address Detection in wireless ad-hoc networks
×
引用
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