{"title":"论任意窃听信道的保密能力","authors":"Matthieu Bloch, J. Nicholas Laneman","doi":"10.1109/ALLERTON.2008.4797642","DOIUrl":null,"url":null,"abstract":"We investigate the fundamental secrecy limits of arbitrary wiretap channels using the information-spectrum approach and we provide a random coding theorem for the secrecy capacity under various secrecy metrics. We show how our result specializes to several recent results, e.g., compound channels, parallel channels, and fading channels. As a side benefit, our analysis shows that earlier results hold under more stringent secrecy metrics than previously established.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"73","resultStr":"{\"title\":\"On the secrecy capacity of arbitrary wiretap channels\",\"authors\":\"Matthieu Bloch, J. Nicholas Laneman\",\"doi\":\"10.1109/ALLERTON.2008.4797642\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the fundamental secrecy limits of arbitrary wiretap channels using the information-spectrum approach and we provide a random coding theorem for the secrecy capacity under various secrecy metrics. We show how our result specializes to several recent results, e.g., compound channels, parallel channels, and fading channels. As a side benefit, our analysis shows that earlier results hold under more stringent secrecy metrics than previously established.\",\"PeriodicalId\":120561,\"journal\":{\"name\":\"2008 46th Annual Allerton Conference on Communication, Control, and Computing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"73\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 46th Annual Allerton Conference on Communication, Control, and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2008.4797642\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2008.4797642","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the secrecy capacity of arbitrary wiretap channels
We investigate the fundamental secrecy limits of arbitrary wiretap channels using the information-spectrum approach and we provide a random coding theorem for the secrecy capacity under various secrecy metrics. We show how our result specializes to several recent results, e.g., compound channels, parallel channels, and fading channels. As a side benefit, our analysis shows that earlier results hold under more stringent secrecy metrics than previously established.