{"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}
引用次数: 9
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.