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

Basic Study of Group Secret Key Agreement Based on Mobile Propagation Characteristics-Part II: Problems of the Conventional Method and Suggestion of New Method in Chain Connection-

秀一 笹岡, 誠人 岩井, ヒデイチ ササオカ, ヒサト イワイ, Hideichi Sasaoka, Hisato Iwai

Published Jan 1, 2020• 0 citations
Publisher

Abstract

Wireless physical layer security attracts attention as a kind of the information security that utilized radio propagation characteristics. A lot of studies of secret key agreement are performed as the main field, but there are relatively few studies of group secret key agreement. This Paper shows the summary of the conventional method based on mobile propagation characteristics for chain connection systems and clarified a problem of the technique to notify of difference of the series of RSSI. Then, this paper suggested a method to acquire multiple group secret key using a notice of the EX-OR of the series of two binary RSSI to solve a problem. This paper also suggested a method to acquire multiple group secret key by the key distribution using the notice of the EX-OR with the series of binary RSSI and the binary random number. These suggestion methods show that the update of the secret key becomes easy by utilizing multiple group secret key.

DOI
10.14988/pa.2019.0000000519

Related papers

移動伝搬特性に基づくグループ鍵共有の秘密鍵容量(その2) : 鎖型接続の場合

秀一 笹岡, 岩井 誠人

Secret key agreement based on radio propagation characteristics attracts attention as a kind of the wireless physical layer security recently. As one field, there is group secret key agreement to notify of the difference between the series of RSS in star and chain connection system. However, the conventional method has a problem in derivation of theoretical expression of the secret key capacity. This paper deals with a close numerical formula of upper and lower limit of the secret key capacity to be given in mutual information for chain connection systems. This paper derives new theoretical expression of the secret key capacity that is a function of the SN ratio by new theoretical analysis for the mutual information. As a result, numerical computation shows that the upper limit of the secret key capacity accords with the lower limit in high SN ratio. In addition, the simulation results show validity of theoretical expression because the simulation results accord with theoretical characteristics well.

•Oct 31, 2020•0 citations

移動伝搬特性に基づくグループ鍵共有の秘密鍵容量 : (その1)星型接続の場合

秀一 笹岡, 岩井 誠人

Secret key agreement based on radio propagation characteristics attracts attention as a kind of the wireless physical layer security recently. There are few studies of group secret key agreement in this field, but there is a method to notify of the difference between the series of RSS. However, the conventional method has a problem in derivation of theoretical expression of the secret key capacity. This paper deals with a close numerical formula of upper and lower limit of the secret key capacity to be given in mutual information. This paper derives new theoretical expression of the secret key capacity that is a function of the SN ratio by new theoretical analysis for the mutual information. As a result, numerical computation shows that the upper limit of the secret key capacity accords with the lower limit in high SN ratio. Numerical computation also shows that leakage information increases with increase of the number of the terminals. Furthermore, the result of the computer simulation shows validity of theoretical expression.

•Jul 31, 2020•0 citations

Group Secret Key Agreement Based on Radio Propagation Characteristics in Wireless Relaying Systems

Takayuki Shimizu, Hisato Iwai, Hideichi Sasaoka

We consider secret key agreement for multiple terminals based on radio propagation characteristics in a wireless relaying system where more than two terminals communicate with each other via a relay. In this system, the multiple terminals share a common secret key generated from their radio propagation characteristics with the help of the relay in the presence of an eavesdropper. In this paper, we present three secret key agreement schemes: an amplify-and-forward (AF) scheme, a signal-combining amplify-and-forward (SC-AF) scheme, and a multiple-access amplify-and-forward (MA-AF) scheme. The key idea of these schemes is that each terminal shares the fading coefficients between all terminals and the relay, and use them as the source of a secret key. The AF scheme is based on a conventional amplify-and-forward two-way relaying method, whereas in the SC-AF scheme and the MA-AF scheme, we apply the idea of analog network coding to secret key agreement. We analyze eavesdropping strategies and show that the AF scheme is not secure if the eavesdropper is located near the relay and can receive signals from the relay without multipath fading and noise. Simulation results show that the SC-AF and MA-AF schemes are effective.

IEICE Transactions on Communications•Jan 1, 2012•2 citations

複素チャネル係数に基づく無線秘密鍵共有における複数地点盗聴による秘密鍵容量の低下

Hideichi Sasaoka, Hisato Iwai

Secret key agreement based on radio propagation characteristics attracts attention as a kind of the wireless physical layer security. However, there are few studies on drop of the secret key capacity by multiple spot eavesdropping. This paper derived theoretical formula of the secret key capacity in secret key agreement based on the complex channel coefficient. This paper also derived theoretical formula of the leakage information by multiple spot eavesdropping and showed that leakage information increased with the increase of the eavesdropping spot number. Validity of these theoretical formulas was confirmed by computer simulation. Then, this paper calculated the coefficient of correlation of the channel coefficient in the simple propagation environment and evaluated security of secret key agreement by calculating leakage information for multiple spot eavesdropping.

•Jul 31, 2022•0 citations

Secret Key Agreement Based on Radio Propagation Characteristics in Two-Way Relaying Systems

Takayuki Shimizu, Hisato Iwai, Hideichi Sasaoka +1 more

We consider secret key agreement based on radio propagation characteristics in two-way relaying system where two legitimate parties named Alice and Bob communicate with each other via a relay. In this system, Alice and Bob share secret keys generated from their radio propagation characteristics by the help of the relay. In this paper, we present two secret key agreement schemes: an amplify-and-forward (AF) scheme and a multiple-access amplify-and-forward (MA-AF) scheme. In both of the schemes, the basic idea is to share the effective fading coefficient between Alice and Bob and use it as the source of secret keys. The AF scheme is based on a conventional amplify-and-forward two-way relaying method, while the MA-AF scheme utilizes the inherent combining of signals provided by simultaneous transmissions over a multiple-access channel in order to share the secret keys more securely efficiently. We analyze eavesdropping strategy in terms of eavesdropper's location and show that if the eavesdropper is located near the relay and can receive signals from the relay without multipath fading and noise, the AF scheme is not secure. Simulation results show that the MA-AF scheme is more secure and efficient than the AF scheme.

Globecom•Dec 1, 2010•7 citations

Physical-Layer Secret Key Agreement in Two-Way Wireless Relaying Systems

Takayuki Shimizu, Hisato Iwai, Hideichi Sasaoka

We consider secret key agreement based on radio propagation characteristics in a two-way relaying system where two legitimate parties named Alice and Bob communicate with each other via a trusted relay. In this system, Alice and Bob share secret keys generated from measured radio propagation characteristics with the help of the relay in the presence of an eavesdropper. We present four secret key agreement schemes: an amplify-and-forward (AF) scheme, a signal-combining amplify-and-forward (SC-AF) scheme, a multiple-access amplify-and-forward (MA-AF) scheme, and an amplify-and-forward with artificial noise (AF with AN) scheme. In these schemes, the basic idea is to share the effective fading coefficients between Alice and Bob and use them as the source of the secret keys. The AF scheme is based on a conventional amplify-and-forward two-way relaying method, whereas in the SC-AF scheme and the MA-AF scheme, we apply the idea of physical-layer network coding to the secret key agreement. In the AF with AN scheme, the relay transmits artificially generated noise, as well as channel information signal, in order to conceal the latter. Simulation results show that the MA-AF scheme outperforms the other schemes in Rayleigh fading channels, whereas the AF with AN scheme is suitable for Rician fading channels.

IEEE Transactions on Information Forensics and Security•Apr 26, 2011•70 citations
Wireless physical layer security attracts attention as a kind of the information security that utilized radio propagation characteristics. A lot of studies of secret key agreement are performed as the main field, but there are relatively few studies of group secret key agreement. This Paper shows the summary of the conventional method based on mobile propagation characteristics for chain connection systems and clarified a problem of the technique to notify of difference of the series of RSSI. Then, this paper suggested a method to acquire multiple group secret key using a notice of the EX-OR of the series of two binary RSSI to solve a problem. This paper also suggested a method to acquire multiple group secret key by the key distribution using the notice of the EX-OR with the series of binary RSSI and the binary random number. These suggestion methods show that the update of the secret key becomes easy by utilizing multiple group secret key.
Secret key agreement based on radio propagation characteristics attracts attention as a kind of the wireless physical layer security recently. As one field, there is group secret key agreement to notify of the difference between the series of RSS in star and chain connection system. However, the conventional method has a problem in derivation of theoretical expression of the secret key capacity. This paper deals with a close numerical formula of upper and lower limit of the secret key capacity to be given in mutual information for chain connection systems. This paper derives new theoretical expression of the secret key capacity that is a function of the SN ratio by new theoretical analysis for the mutual information. As a result, numerical computation shows that the upper limit of the secret key capacity accords with the lower limit in high SN ratio. In addition, the simulation results show validity of theoretical expression because the simulation results accord with theoretical characteristics well.
Secret key agreement based on radio propagation characteristics attracts attention as a kind of the wireless physical layer security recently. There are few studies of group secret key agreement in this field, but there is a method to notify of the difference between the series of RSS. However, the conventional method has a problem in derivation of theoretical expression of the secret key capacity. This paper deals with a close numerical formula of upper and lower limit of the secret key capacity to be given in mutual information. This paper derives new theoretical expression of the secret key capacity that is a function of the SN ratio by new theoretical analysis for the mutual information. As a result, numerical computation shows that the upper limit of the secret key capacity accords with the lower limit in high SN ratio. Numerical computation also shows that leakage information increases with increase of the number of the terminals. Furthermore, the result of the computer simulation shows validity of theoretical expression.
We consider secret key agreement for multiple terminals based on radio propagation characteristics in a wireless relaying system where more than two terminals communicate with each other via a relay. In this system, the multiple terminals share a common secret key generated from their radio propagation characteristics with the help of the relay in the presence of an eavesdropper. In this paper, we present three secret key agreement schemes: an amplify-and-forward (AF) scheme, a signal-combining amplify-and-forward (SC-AF) scheme, and a multiple-access amplify-and-forward (MA-AF) scheme. The key idea of these schemes is that each terminal shares the fading coefficients between all terminals and the relay, and use them as the source of a secret key. The AF scheme is based on a conventional amplify-and-forward two-way relaying method, whereas in the SC-AF scheme and the MA-AF scheme, we apply the idea of analog network coding to secret key agreement. We analyze eavesdropping strategies and show that the AF scheme is not secure if the eavesdropper is located near the relay and can receive signals from the relay without multipath fading and noise. Simulation results show that the SC-AF and MA-AF schemes are effective.
Secret key agreement based on radio propagation characteristics attracts attention as a kind of the wireless physical layer security. However, there are few studies on drop of the secret key capacity by multiple spot eavesdropping. This paper derived theoretical formula of the secret key capacity in secret key agreement based on the complex channel coefficient. This paper also derived theoretical formula of the leakage information by multiple spot eavesdropping and showed that leakage information increased with the increase of the eavesdropping spot number. Validity of these theoretical formulas was confirmed by computer simulation. Then, this paper calculated the coefficient of correlation of the channel coefficient in the simple propagation environment and evaluated security of secret key agreement by calculating leakage information for multiple spot eavesdropping.
We consider secret key agreement based on radio propagation characteristics in two-way relaying system where two legitimate parties named Alice and Bob communicate with each other via a relay. In this system, Alice and Bob share secret keys generated from their radio propagation characteristics by the help of the relay. In this paper, we present two secret key agreement schemes: an amplify-and-forward (AF) scheme and a multiple-access amplify-and-forward (MA-AF) scheme. In both of the schemes, the basic idea is to share the effective fading coefficient between Alice and Bob and use it as the source of secret keys. The AF scheme is based on a conventional amplify-and-forward two-way relaying method, while the MA-AF scheme utilizes the inherent combining of signals provided by simultaneous transmissions over a multiple-access channel in order to share the secret keys more securely efficiently. We analyze eavesdropping strategy in terms of eavesdropper's location and show that if the eavesdropper is located near the relay and can receive signals from the relay without multipath fading and noise, the AF scheme is not secure. Simulation results show that the MA-AF scheme is more secure and efficient than the AF scheme.
We consider secret key agreement based on radio propagation characteristics in a two-way relaying system where two legitimate parties named Alice and Bob communicate with each other via a trusted relay. In this system, Alice and Bob share secret keys generated from measured radio propagation characteristics with the help of the relay in the presence of an eavesdropper. We present four secret key agreement schemes: an amplify-and-forward (AF) scheme, a signal-combining amplify-and-forward (SC-AF) scheme, a multiple-access amplify-and-forward (MA-AF) scheme, and an amplify-and-forward with artificial noise (AF with AN) scheme. In these schemes, the basic idea is to share the effective fading coefficients between Alice and Bob and use them as the source of the secret keys. The AF scheme is based on a conventional amplify-and-forward two-way relaying method, whereas in the SC-AF scheme and the MA-AF scheme, we apply the idea of physical-layer network coding to the secret key agreement. In the AF with AN scheme, the relay transmits artificially generated noise, as well as channel information signal, in order to conceal the latter. Simulation results show that the MA-AF scheme outperforms the other schemes in Rayleigh fading channels, whereas the AF with AN scheme is suitable for Rician fading channels.