Secure transmission using an untrusted relay with scaled compute-and-forward

Zhijie Ren, J. Goseling, J. Weber, M. Gastpar
{"title":"Secure transmission using an untrusted relay with scaled compute-and-forward","authors":"Zhijie Ren, J. Goseling, J. Weber, M. Gastpar","doi":"10.1109/ITW.2015.7133135","DOIUrl":null,"url":null,"abstract":"A two-hop channel is considered, in which the source wants to send information to the destination while keeping the information confidential from the relay. A novel lattice chain and compute-and-forward based scheme is proposed in which the destination provides cooperative jamming. Channel state information is used at the source and the destination to scale the encoding lattices for the message and the jamming signal according to the channel gains. We compare the achievable secrecy rate of our scheme with an upper bound and with the achievable secrecy rate of other schemes. It follows that our scheme outperforms all existing schemes except in the low power region.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Information Theory Workshop (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2015.7133135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

A two-hop channel is considered, in which the source wants to send information to the destination while keeping the information confidential from the relay. A novel lattice chain and compute-and-forward based scheme is proposed in which the destination provides cooperative jamming. Channel state information is used at the source and the destination to scale the encoding lattices for the message and the jamming signal according to the channel gains. We compare the achievable secrecy rate of our scheme with an upper bound and with the achievable secrecy rate of other schemes. It follows that our scheme outperforms all existing schemes except in the low power region.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
安全传输使用一个不可信的中继与缩放计算和转发
考虑一个两跳信道,其中源希望向目标发送信息,同时对中继保持信息的机密性。提出了一种新的基于点阵链和计算转发的目标提供协同干扰的方案。信道状态信息在源端和目标端根据信道增益对报文和干扰信号的编码格进行缩放。我们将该方案的可实现保密率与上界进行了比较,并与其他方案的可实现保密率进行了比较。由此可见,除了在低功耗区域,我们的方案优于所有现有的方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Degraded broadcast channel: Secrecy outside of a bounded range On compute-and-forward with feedback On the capacity of multihop device-to-device caching networks Lattice index coding for the broadcast channel On the transmission of a bivariate Gaussian source over the Gaussian broadcast channel with feedback
×
引用
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