物联网时代无线安全通信的最佳秘密共享

Lei Miao, Dingde Jiang
{"title":"物联网时代无线安全通信的最佳秘密共享","authors":"Lei Miao, Dingde Jiang","doi":"10.1049/CP.2017.0122","DOIUrl":null,"url":null,"abstract":"Secret sharing is crucial to information security in smart city related wireless applications. In this paper, we study how to optimally share secrets between two users using the effect of wireless channel dynamics on the data link layer. Specifically, we formulate an optimization problem whose objective is to minimize the expectation of the probability that an eavesdropper receives all secret sharing packets. Our contributions are: (i) we come up with the secret sharing mechanism that minimizes the aforementioned objective function and (ii) we perform analysis on our approach and derive the worst-case probability of the eavesdropper receiving all secret sharing packets. Our theoretical results are validated via simulations.","PeriodicalId":424212,"journal":{"name":"4th International Conference on Smart and Sustainable City (ICSSC 2017)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Optimal secret sharing for secure wireless communications in the era of Internet of Things\",\"authors\":\"Lei Miao, Dingde Jiang\",\"doi\":\"10.1049/CP.2017.0122\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Secret sharing is crucial to information security in smart city related wireless applications. In this paper, we study how to optimally share secrets between two users using the effect of wireless channel dynamics on the data link layer. Specifically, we formulate an optimization problem whose objective is to minimize the expectation of the probability that an eavesdropper receives all secret sharing packets. Our contributions are: (i) we come up with the secret sharing mechanism that minimizes the aforementioned objective function and (ii) we perform analysis on our approach and derive the worst-case probability of the eavesdropper receiving all secret sharing packets. Our theoretical results are validated via simulations.\",\"PeriodicalId\":424212,\"journal\":{\"name\":\"4th International Conference on Smart and Sustainable City (ICSSC 2017)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"4th International Conference on Smart and Sustainable City (ICSSC 2017)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1049/CP.2017.0122\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"4th International Conference on Smart and Sustainable City (ICSSC 2017)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/CP.2017.0122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

在智慧城市相关无线应用中,秘密共享对信息安全至关重要。在本文中,我们研究了如何利用无线信道动态对数据链路层的影响来优化两个用户之间的秘密共享。具体来说,我们提出了一个优化问题,其目标是最小化窃听者接收到所有秘密共享数据包的概率期望。我们的贡献是:(i)我们提出了最小化上述目标函数的秘密共享机制;(ii)我们对我们的方法进行了分析,并得出了窃听者接收所有秘密共享数据包的最坏概率。通过仿真验证了理论结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimal secret sharing for secure wireless communications in the era of Internet of Things
Secret sharing is crucial to information security in smart city related wireless applications. In this paper, we study how to optimally share secrets between two users using the effect of wireless channel dynamics on the data link layer. Specifically, we formulate an optimization problem whose objective is to minimize the expectation of the probability that an eavesdropper receives all secret sharing packets. Our contributions are: (i) we come up with the secret sharing mechanism that minimizes the aforementioned objective function and (ii) we perform analysis on our approach and derive the worst-case probability of the eavesdropper receiving all secret sharing packets. Our theoretical results are validated via simulations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
GPS data cleaning and analysis based on YouSense mobile application A new approach for tracking human body movements by kinect sensor Crowd counting and density estimation via two-column convolutional neural network Human pose estimation via improved ResNet50 IOT based smart restaurant system using RFID
×
引用
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