具有物理层网络编码的双向中继信道的认证

Jhordany Rodriguez Parra, T. Chan, I. Land, Siu-Wai Ho
{"title":"具有物理层网络编码的双向中继信道的认证","authors":"Jhordany Rodriguez Parra, T. Chan, I. Land, Siu-Wai Ho","doi":"10.1109/ITWF.2015.7360732","DOIUrl":null,"url":null,"abstract":"Physical Layer Network coding (PLNC) can significantly improve network performance, but some security issues arise due to the limited information available to the forwarders. This paper analyses authentication in networks with PLNC and show theoretical and practical security limits. In particular, we obtain a lower bound for the probability of an attacker being able to insert a false message such that the message is believed to come from a legitimate source. We prove that an information-theoretic bound similar to the one for point-to-point communication systems can be achieved in networks employing PLNC. Necessary and sufficient conditions to achieve the bound are identified. Finally, a simple but important modification of a previous scheme is proposed to achieve the obtained bound.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Authentication for two-way relay channel with Physical-Layer Network coding\",\"authors\":\"Jhordany Rodriguez Parra, T. Chan, I. Land, Siu-Wai Ho\",\"doi\":\"10.1109/ITWF.2015.7360732\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Physical Layer Network coding (PLNC) can significantly improve network performance, but some security issues arise due to the limited information available to the forwarders. This paper analyses authentication in networks with PLNC and show theoretical and practical security limits. In particular, we obtain a lower bound for the probability of an attacker being able to insert a false message such that the message is believed to come from a legitimate source. We prove that an information-theoretic bound similar to the one for point-to-point communication systems can be achieved in networks employing PLNC. Necessary and sufficient conditions to achieve the bound are identified. Finally, a simple but important modification of a previous scheme is proposed to achieve the obtained bound.\",\"PeriodicalId\":281890,\"journal\":{\"name\":\"2015 IEEE Information Theory Workshop - Fall (ITW)\",\"volume\":\"112 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE Information Theory Workshop - Fall (ITW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITWF.2015.7360732\",\"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 IEEE Information Theory Workshop - Fall (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITWF.2015.7360732","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

物理层网络编码(PLNC)可以显著提高网络性能,但由于转发器可用的信息有限,会产生一些安全问题。本文分析了PLNC网络中的认证问题,给出了理论和实际的安全限制。特别是,我们获得了攻击者能够插入假消息的概率的下界,使得该消息被认为来自合法来源。我们证明了在采用PLNC的网络中可以实现类似于点对点通信系统的信息论界。给出了实现该边界的充分必要条件。最后,提出了一种简单但重要的改进方案来实现所得到的界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Authentication for two-way relay channel with Physical-Layer Network coding
Physical Layer Network coding (PLNC) can significantly improve network performance, but some security issues arise due to the limited information available to the forwarders. This paper analyses authentication in networks with PLNC and show theoretical and practical security limits. In particular, we obtain a lower bound for the probability of an attacker being able to insert a false message such that the message is believed to come from a legitimate source. We prove that an information-theoretic bound similar to the one for point-to-point communication systems can be achieved in networks employing PLNC. Necessary and sufficient conditions to achieve the bound are identified. Finally, a simple but important modification of a previous scheme is proposed to achieve the obtained bound.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信