{"title":"A Modular Semantically Secure Wiretap Code with Shared Key for Weakly Symmetric Channels","authors":"Setareh Sharifian, R. Safavi-Naini","doi":"10.1109/ITW44776.2019.8989345","DOIUrl":null,"url":null,"abstract":"We study the problem of secure communication over a wiretap channel when the sender and the receiver have access to a shared secret key. We propose a modular secure construction of wiretap codes for a shared key setting that achieves secrecy capacity for weakly symmetric wiretap channels, and has computationally efficient encoding and decoding. The construction’s security and reliability guarantees are in terms of semantic security, which is the strongest notion of security for these channels, and worst case error, respectively. We give concrete parameters of the construction for finite length messages to obtain a desired level of security and reliability.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Information Theory Workshop (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW44776.2019.8989345","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
We study the problem of secure communication over a wiretap channel when the sender and the receiver have access to a shared secret key. We propose a modular secure construction of wiretap codes for a shared key setting that achieves secrecy capacity for weakly symmetric wiretap channels, and has computationally efficient encoding and decoding. The construction’s security and reliability guarantees are in terms of semantic security, which is the strongest notion of security for these channels, and worst case error, respectively. We give concrete parameters of the construction for finite length messages to obtain a desired level of security and reliability.