{"title":"基于发送方信息的窃听信道密钥协议","authors":"A. Khisti","doi":"10.1109/EW.2010.5483458","DOIUrl":null,"url":null,"abstract":"The secret-key agreement problem over wiretap channels controlled by a state parameter is studied. The entire state sequence is known (non-causally) to the sender but not to the receiver and the eavesdropper. Upper and lower bounds on the secret-key capacity are established both with and without public discussion. In absence of public-discussion, our lower bound is strictly better than the best known lower bound for transmitting an independent secret message. This illustrates that the coding schemes for secret-key agreement are substantially different than secret-message transmission. For the special case of Gaussian channels, we establish the secret-key capacity when the legitimate receiver's signal-to-noise-ratio is greater than 0 dB. When a public discussion channel is available between the sender and the receiver, upper and lower bounds on the secret-key capacity are again established. These bounds coincide, yielding the capacity, when then the channels of the receiver and the eavesdropper satisfy an independent noise condition.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Secret key agreement on wiretap channel with transmitter side information\",\"authors\":\"A. Khisti\",\"doi\":\"10.1109/EW.2010.5483458\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The secret-key agreement problem over wiretap channels controlled by a state parameter is studied. The entire state sequence is known (non-causally) to the sender but not to the receiver and the eavesdropper. Upper and lower bounds on the secret-key capacity are established both with and without public discussion. In absence of public-discussion, our lower bound is strictly better than the best known lower bound for transmitting an independent secret message. This illustrates that the coding schemes for secret-key agreement are substantially different than secret-message transmission. For the special case of Gaussian channels, we establish the secret-key capacity when the legitimate receiver's signal-to-noise-ratio is greater than 0 dB. When a public discussion channel is available between the sender and the receiver, upper and lower bounds on the secret-key capacity are again established. These bounds coincide, yielding the capacity, when then the channels of the receiver and the eavesdropper satisfy an independent noise condition.\",\"PeriodicalId\":232165,\"journal\":{\"name\":\"2010 European Wireless Conference (EW)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 European Wireless Conference (EW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EW.2010.5483458\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 European Wireless Conference (EW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EW.2010.5483458","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Secret key agreement on wiretap channel with transmitter side information
The secret-key agreement problem over wiretap channels controlled by a state parameter is studied. The entire state sequence is known (non-causally) to the sender but not to the receiver and the eavesdropper. Upper and lower bounds on the secret-key capacity are established both with and without public discussion. In absence of public-discussion, our lower bound is strictly better than the best known lower bound for transmitting an independent secret message. This illustrates that the coding schemes for secret-key agreement are substantially different than secret-message transmission. For the special case of Gaussian channels, we establish the secret-key capacity when the legitimate receiver's signal-to-noise-ratio is greater than 0 dB. When a public discussion channel is available between the sender and the receiver, upper and lower bounds on the secret-key capacity are again established. These bounds coincide, yielding the capacity, when then the channels of the receiver and the eavesdropper satisfy an independent noise condition.