{"title":"密钥生成的信道估计","authors":"M. McGuire","doi":"10.1109/AINA.2014.60","DOIUrl":null,"url":null,"abstract":"Generating secret keys from radio channel measurements has been shown to allow private communications. Previously described methods for performing wireless key generation have not come close to achieving the theoretical upper bounds on key rates theory for this technique. This paper demonstrates how using a Kalman filter based on an auto-regressive (AR) model for the channel process, channel gain measurements can be converted into a sequence of independent Gaussian vectors. Methods for processing these vectors so they are compatible with existing secret key quantization and error reconciliation techniques are also presented. It is shown how the mutual information in these vectors is near that of the theoretical upper bounds. Finally, it is shown that most of the available secret key bits can be extracted using practical quantization and error reconciliation techniques.","PeriodicalId":316052,"journal":{"name":"2014 IEEE 28th International Conference on Advanced Information Networking and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Channel Estimation for Secret Key Generation\",\"authors\":\"M. McGuire\",\"doi\":\"10.1109/AINA.2014.60\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Generating secret keys from radio channel measurements has been shown to allow private communications. Previously described methods for performing wireless key generation have not come close to achieving the theoretical upper bounds on key rates theory for this technique. This paper demonstrates how using a Kalman filter based on an auto-regressive (AR) model for the channel process, channel gain measurements can be converted into a sequence of independent Gaussian vectors. Methods for processing these vectors so they are compatible with existing secret key quantization and error reconciliation techniques are also presented. It is shown how the mutual information in these vectors is near that of the theoretical upper bounds. Finally, it is shown that most of the available secret key bits can be extracted using practical quantization and error reconciliation techniques.\",\"PeriodicalId\":316052,\"journal\":{\"name\":\"2014 IEEE 28th International Conference on Advanced Information Networking and Applications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 28th International Conference on Advanced Information Networking and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINA.2014.60\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 28th International Conference on Advanced Information Networking and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2014.60","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Generating secret keys from radio channel measurements has been shown to allow private communications. Previously described methods for performing wireless key generation have not come close to achieving the theoretical upper bounds on key rates theory for this technique. This paper demonstrates how using a Kalman filter based on an auto-regressive (AR) model for the channel process, channel gain measurements can be converted into a sequence of independent Gaussian vectors. Methods for processing these vectors so they are compatible with existing secret key quantization and error reconciliation techniques are also presented. It is shown how the mutual information in these vectors is near that of the theoretical upper bounds. Finally, it is shown that most of the available secret key bits can be extracted using practical quantization and error reconciliation techniques.