Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Wireless Communications Letters

Multi-Party Secret Key Generation Over Underwater Acoustic Channels

Ming Xu, Yimeng Fan, Ling Liu

Published Jan 1, 2020• 25 citations
Publisher

Abstract

Concerning the problem of how to extract a highly confidential key for an arbitrary number of legitimate nodes under the circumstances of multipath and Doppler effects in underwater acoustic channels, we propose a multi-party secret key generation scheme over underwater acoustic channels against active attacks. In the proposed scheme, the α order Rényi entropy with multipath and Doppler effects is accurately depicted, and the uncertainty of the source sequence from the legitimate nodes and the eavesdropping node is also obtained. On this basis, a multi-party secret key generation protocol against active attacks is designed using bilinear mapping, which does not depend on the length and randomness of the random seed. Our results demonstrate the security of the proposed scheme in the metrics of the key leakage rate and the probability of a successful active attack.

DOI
10.1109/lwc.2020.2981067

Related papers

Secret Underwater Acoustic Key Generation Challenged by Eve's Simulator

Seçkin Yldrm, Konstantinos Pelekanakis, George Sklivanitis +6 more

Symmetric cryptography is the de-facto approach to information security for ad-hoc underwater acoustic networks. The requirement is that all network nodes possess the same cryptographic keys and key distribution that happens offline. Thus, it is hardly possible to include a new keyless node during network operation. In addition, online key replenishment is an open problem. In this article, we tackle key distribution/replenishment by formulating a new protocol that generates a key between two trusted underwater acoustic nodes (Alice and Bob) without the need to exchange the key itself. The proposed protocol initially extracts common acoustic channel features between Alice and Bob after some signal exchanges. Then, each party uses these features to generate his/her own secret bits via a random sequence generator. To correct any differences in their secret bits, we propose two reconciliation methods that employ Reed–Solomon codes. At the last step of the protocol, a 256-bit cryptographic key is generated by feeding the reconciled secret bit string to the Secure Hash Algorithm 3. We evaluate the key generation rate of the proposed protocol with real acoustic data recorded from a littoral environment, in which Alice and Bob exchanged 915 channel probes over different link geometries. To assess security performance, we invent a passive eavesdropper, Eve, who is able to simulate the acoustic link between Alice and Bob. She uses her simulated channels and the same protocol to generate her keys. Our analysis demonstrates a tradeoff between the key generation rate of Alice and Bob and Eve's ability to extract the same key. Our best result shows that Alice and Bob can independently generate 567 keys out of 915 attempts while Eve does not have access to any of the keys.

IEEE Journal of Oceanic Engineering•Feb 14, 2024•11 citations

Secret Key Generation From Route Propagation Delays for Underwater Acoustic Networks

Roee Diamant, Stefano Tomasin, Francesco Ardizzon +2 more

With the growing use of underwater acoustic communications and the recent adoption of standards in this field, it is becoming increasingly important to secure messages against eavesdroppers. In this paper, we focus on a physical-layer security solution to generate sequences of random bits (keys) between two devices (Alice and Bob) belonging to an underwater acoustic network (UWAN); the key must remain secret to a passive eavesdropper (Eve) not belonging to the UWAN. Our method is based on measuring the propagation delay of the underwater acoustic channel over multiple hops of the UWAN: this harvests the randomness in the UWAN topology and turns the slow sound propagation in water into an advantage against eavesdropping. Our key generation protocol includes a route discovery handshake, whereby all UWAN devices at intermediate hops accumulate their message processing delays. This enables Alice and Bob to compute the actual propagation delays along each route and to map such information to a sequence of bits. Finally, from these bit sequences, Alice and Bob obtain a secret key. We analyze the performance of the protocol theoretically and assess it via extensive simulations and field experiments.

IEEE Transactions on Information Forensics and Security•Jan 1, 2023•31 citations

Covert Secret-Key Agreement Protocol Based on the Underwater Acoustic Channel

Ming Xu, Hexin Feng, Линг Лиу

In order to cope with the problem of information leakage of existing secret-key agreement protocols under the environment of underwater acoustic channel (UAC), a covert secret-key agreement protocol called CSAP is proposed. In CSAP, the transmitter sends the uniformly distributed random messages to the receiver within a certain range of power constraints to ensure the reliability and the covertness of the protocol. The receiver calculates the estimated messages with Gibbs sampling according to the variance information of the underwater noise and uses the Log-Likelihood Ratio (LLR) test to extract the secret-key so as to reduce the uncertainty and the bit error rate (BER) of data transmission between two legitimate parties. The complexity of the CSAP protocol is${O}$(${n}$), where${n}$denotes the message length. The secrecy, covertness, and reliability of the CSAP protocol are proved by the information theory. The simulation results show that the CSAP protocol reduces the bit error rate (BER) by 28.88%, improves the secret-key generation rate by 25.70%, and decreases the communication cost by 11.32% on average compared to the existing protocol.

IEEE Wireless Communications Letters•Apr 26, 2022•9 citations

On the Security of Fast Secret Key Generation Protocol with Virtual Channel Approach

Chen Da-jian

It is vitally important to generate keys and keep them secret in secure wireless communications. Due to the broadcast nature of wireless channels, secret key distribution is more vulnerable to attacks in wireless communication. An ingenious solution is to generate secret keys by using the multipath channel as a source of common randomness. To address the problems that the existing physical-based protocols have low key generation rate and high reliance on mobile nodes or environments, a fast secret key generation protocol with virtual channel approach was proposed by HUANG and WANG for static wireless networks. In this paper, we show that, in the presence of an eavesdropper with multiple antennas, the scheme does not improve the theoretical upper bound of the key generation rate with information-theory security. Thus, the protocol is not information-theory security.

Dianzi Ke-ji Daxue xuebao•Jan 1, 2015•2 citations

Channel Frequency Response-Based Secret Key Generation in Underwater Acoustic Systems

Yi Huang, Shengli Zhou, Zhijie Jerry Shi +1 more

Preestablished secret keys are often used to encrypt and decrypt data in communication systems, which are not secure once the keys are compromised. One desirable method is to generate secret keys dynamically using correlated channel measurements. We explore this concept in underwater acoustic (UWA) channels, and present a protocol that can generate secret keys dynamically based on the channel frequency response (CFR) in orthogonal frequency-division multiplexing systems. The multi-bit quantization is carried out on the amplitude of each tone, and the Bose-Chaudhuri-Hocquenghem codes are used for information reconciliation. Part of the protocol was implemented in lake tests, and multiple data sets were collected. The lake test results verify that the amplitude of CFR can be used as a randomness source for key generation in UWA channels, and we also find the low correlation between the mutual channels of the legitimate users. Based on the lake test results, we incorporate two modules into the protocol for performance improvement. The first module employs the adaptively weighted probing signaling to increase the channel correlation, and the second module of block-sliced key verification is used to deal with channel dynamics and increase the key agreement probability. The simulation results demonstrate the improved performance of the enhanced protocol.

IEEE Transactions on Wireless Communications•May 24, 2016•49 citations

A Practical Secret Key Generation Scheme Based on Wireless Channel Characteristics for 5G Networks

Qiuhua Wang, Mingyang KANG, Guohua Wu +2 more

Secret key generation based on channel characteristics is an effective physical-layer security method for 5G wireless networks. The issues of how to ensure the high key generation rate and correlation of the secret key under active attack are needed to be addressed. In this paper, a new practical secret key generation scheme with high rate and correlation is proposed. In our proposed scheme, Alice and Bob transmit independent random sequences instead of known training sequences or probing signals; neither Alice nor Bob can decode these random sequences or estimate the channel. User's random sequences together with the channel effects are used as common random source to generate the secret key. With this solution, legitimate users are able to share secret keys with sufficient length and high security under active attack. We evaluate the proposed scheme through both analytic and simulation studies. The results show that our proposed scheme achieves high key generation rate and key security, and is suitable for 5G wireless networks with resource-constrained devices.

IEICE Transactions on Information and Systems•Jan 31, 2020•7 citations
Concerning the problem of how to extract a highly confidential key for an arbitrary number of legitimate nodes under the circumstances of multipath and Doppler effects in underwater acoustic channels, we propose a multi-party secret key generation scheme over underwater acoustic channels against active attacks. In the proposed scheme, the α order Rényi entropy with multipath and Doppler effects is accurately depicted, and the uncertainty of the source sequence from the legitimate nodes and the eavesdropping node is also obtained. On this basis, a multi-party secret key generation protocol against active attacks is designed using bilinear mapping, which does not depend on the length and randomness of the random seed. Our results demonstrate the security of the proposed scheme in the metrics of the key leakage rate and the probability of a successful active attack.
Symmetric cryptography is the de-facto approach to information security for ad-hoc underwater acoustic networks. The requirement is that all network nodes possess the same cryptographic keys and key distribution that happens offline. Thus, it is hardly possible to include a new keyless node during network operation. In addition, online key replenishment is an open problem. In this article, we tackle key distribution/replenishment by formulating a new protocol that generates a key between two trusted underwater acoustic nodes (Alice and Bob) without the need to exchange the key itself. The proposed protocol initially extracts common acoustic channel features between Alice and Bob after some signal exchanges. Then, each party uses these features to generate his/her own secret bits via a random sequence generator. To correct any differences in their secret bits, we propose two reconciliation methods that employ Reed–Solomon codes. At the last step of the protocol, a 256-bit cryptographic key is generated by feeding the reconciled secret bit string to the Secure Hash Algorithm 3. We evaluate the key generation rate of the proposed protocol with real acoustic data recorded from a littoral environment, in which Alice and Bob exchanged 915 channel probes over different link geometries. To assess security performance, we invent a passive eavesdropper, Eve, who is able to simulate the acoustic link between Alice and Bob. She uses her simulated channels and the same protocol to generate her keys. Our analysis demonstrates a tradeoff between the key generation rate of Alice and Bob and Eve's ability to extract the same key. Our best result shows that Alice and Bob can independently generate 567 keys out of 915 attempts while Eve does not have access to any of the keys.
With the growing use of underwater acoustic communications and the recent adoption of standards in this field, it is becoming increasingly important to secure messages against eavesdroppers. In this paper, we focus on a physical-layer security solution to generate sequences of random bits (keys) between two devices (Alice and Bob) belonging to an underwater acoustic network (UWAN); the key must remain secret to a passive eavesdropper (Eve) not belonging to the UWAN. Our method is based on measuring the propagation delay of the underwater acoustic channel over multiple hops of the UWAN: this harvests the randomness in the UWAN topology and turns the slow sound propagation in water into an advantage against eavesdropping. Our key generation protocol includes a route discovery handshake, whereby all UWAN devices at intermediate hops accumulate their message processing delays. This enables Alice and Bob to compute the actual propagation delays along each route and to map such information to a sequence of bits. Finally, from these bit sequences, Alice and Bob obtain a secret key. We analyze the performance of the protocol theoretically and assess it via extensive simulations and field experiments.
In order to cope with the problem of information leakage of existing secret-key agreement protocols under the environment of underwater acoustic channel (UAC), a covert secret-key agreement protocol called CSAP is proposed. In CSAP, the transmitter sends the uniformly distributed random messages to the receiver within a certain range of power constraints to ensure the reliability and the covertness of the protocol. The receiver calculates the estimated messages with Gibbs sampling according to the variance information of the underwater noise and uses the Log-Likelihood Ratio (LLR) test to extract the secret-key so as to reduce the uncertainty and the bit error rate (BER) of data transmission between two legitimate parties. The complexity of the CSAP protocol isO{O}O(n{n}n), wheren{n}ndenotes the message length. The secrecy, covertness, and reliability of the CSAP protocol are proved by the information theory. The simulation results show that the CSAP protocol reduces the bit error rate (BER) by 28.88%, improves the secret-key generation rate by 25.70%, and decreases the communication cost by 11.32% on average compared to the existing protocol.
It is vitally important to generate keys and keep them secret in secure wireless communications. Due to the broadcast nature of wireless channels, secret key distribution is more vulnerable to attacks in wireless communication. An ingenious solution is to generate secret keys by using the multipath channel as a source of common randomness. To address the problems that the existing physical-based protocols have low key generation rate and high reliance on mobile nodes or environments, a fast secret key generation protocol with virtual channel approach was proposed by HUANG and WANG for static wireless networks. In this paper, we show that, in the presence of an eavesdropper with multiple antennas, the scheme does not improve the theoretical upper bound of the key generation rate with information-theory security. Thus, the protocol is not information-theory security.
Preestablished secret keys are often used to encrypt and decrypt data in communication systems, which are not secure once the keys are compromised. One desirable method is to generate secret keys dynamically using correlated channel measurements. We explore this concept in underwater acoustic (UWA) channels, and present a protocol that can generate secret keys dynamically based on the channel frequency response (CFR) in orthogonal frequency-division multiplexing systems. The multi-bit quantization is carried out on the amplitude of each tone, and the Bose-Chaudhuri-Hocquenghem codes are used for information reconciliation. Part of the protocol was implemented in lake tests, and multiple data sets were collected. The lake test results verify that the amplitude of CFR can be used as a randomness source for key generation in UWA channels, and we also find the low correlation between the mutual channels of the legitimate users. Based on the lake test results, we incorporate two modules into the protocol for performance improvement. The first module employs the adaptively weighted probing signaling to increase the channel correlation, and the second module of block-sliced key verification is used to deal with channel dynamics and increase the key agreement probability. The simulation results demonstrate the improved performance of the enhanced protocol.
Secret key generation based on channel characteristics is an effective physical-layer security method for 5G wireless networks. The issues of how to ensure the high key generation rate and correlation of the secret key under active attack are needed to be addressed. In this paper, a new practical secret key generation scheme with high rate and correlation is proposed. In our proposed scheme, Alice and Bob transmit independent random sequences instead of known training sequences or probing signals; neither Alice nor Bob can decode these random sequences or estimate the channel. User's random sequences together with the channel effects are used as common random source to generate the secret key. With this solution, legitimate users are able to share secret keys with sufficient length and high security under active attack. We evaluate the proposed scheme through both analytic and simulation studies. The results show that our proposed scheme achieves high key generation rate and key security, and is suitable for 5G wireless networks with resource-constrained devices.