George Sklivanitis, Konstantinos Pelekanakis, S. Yildirim, R. Petroccia, J. Alves, D. Pados
{"title":"Physical Layer Security against an Informed Eavesdropper in Underwater Acoustic Channels: Reconciliation and Privacy Amplification","authors":"George Sklivanitis, Konstantinos Pelekanakis, S. Yildirim, R. Petroccia, J. Alves, D. Pados","doi":"10.1109/UComms50339.2021.9598159","DOIUrl":null,"url":null,"abstract":"We propose a strategy for generating the same crypto-key between two trusted underwater acoustic nodes (Alice and Bob) without revealing it to an eavesdropper (Eve). Our work builds upon the results of [1] where a methodology for generating a string of bits for Alice, Bob and Eve based on channel feature extraction and quantization is discussed. In this paper, we aim to reconcile the respective bits of Alice and Bob while minimizing the information leaked to Eve. To this end, we examine various Reed Solomon (RS) codes and measure the reconciliation rate of Alice, Bob and Eve. Additionally, we propose the Secure Hash Algorithm-3 (SHA-3) as means to eliminate any information that Eve acquires during reconciliation. We evaluate our reconciliation and privacy amplification strategies with bits generated from real underwater acoustic channel probe exchanges between Alice and Bob and Bellhop-simulated channels for Eve. Our analysis confirms that appropriate combinations of channel features and RS codes lead to a computationally secure generation of a 256-bit crypto-key according to the principles of the National Institute of Standards and Technology (NIST), even if Eve is informed about the RS encoder and the SHA-3 function.","PeriodicalId":371411,"journal":{"name":"2021 Fifth Underwater Communications and Networking Conference (UComms)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 Fifth Underwater Communications and Networking Conference (UComms)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UComms50339.2021.9598159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
We propose a strategy for generating the same crypto-key between two trusted underwater acoustic nodes (Alice and Bob) without revealing it to an eavesdropper (Eve). Our work builds upon the results of [1] where a methodology for generating a string of bits for Alice, Bob and Eve based on channel feature extraction and quantization is discussed. In this paper, we aim to reconcile the respective bits of Alice and Bob while minimizing the information leaked to Eve. To this end, we examine various Reed Solomon (RS) codes and measure the reconciliation rate of Alice, Bob and Eve. Additionally, we propose the Secure Hash Algorithm-3 (SHA-3) as means to eliminate any information that Eve acquires during reconciliation. We evaluate our reconciliation and privacy amplification strategies with bits generated from real underwater acoustic channel probe exchanges between Alice and Bob and Bellhop-simulated channels for Eve. Our analysis confirms that appropriate combinations of channel features and RS codes lead to a computationally secure generation of a 256-bit crypto-key according to the principles of the National Institute of Standards and Technology (NIST), even if Eve is informed about the RS encoder and the SHA-3 function.