移動通信路におけるチャネル係数列の一致確認に関する基礎検討

Hideichi Sasaoka, Hisato Iwai

Published Jan 31, 2023• 0 citations

Abstract

There are many studies of secret key agreement based on radio propagation characteristics, but there are few studies of the agreement of analog secret information (key). This paper deals with the agreement verification of the channel coefficient sequence (analog secret key) by the information exchange using the public channel. This paper showed a principle to reduce information leakage due to information exchange and devised agreement verification method to use unique event of channel coefficient sequence. This paper also showed examples of unique event such as three points of crossing with a straight line and the wave form of channel coefficient, and product set of the big and small decision of the channel coefficient, and this paper clarified possibility and a problem of the technique using them.

DOI: 10.14988/00029400

Related papers

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

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, 20220 citations

相互情報量最大化規範ベクトル量子化を用いた物理層秘密鍵共有方式に関する検討

Tomoyuki Higashide, Shinsuke Ibi, Takumi TAKAHASHI +1 more

Wireless communication is riskier than wired communication due to eavesdrop by unauthorized stations. To deal with this problem, public key cryptosystem and common key cryptosystem are used in general. In contrast, key agreement schemes based on information-theoretically security attract attention. One example is a secret key agreement scheme based on radio wave propagation characteristics. This technique uses channel reciprocity and location dependency of radio wave propagation. Most of the secret key agreement schemes generate keys by scalar quantization. However, secret keys generated by scalar quantization occur key disagreement in higher probability than these by vector quantization. A general quantizer selection scheme selects a quantizer with minimum key disagreement between two authorized stations. An eavesdropper is able to generate keys with this quantizer more easily. This paper assumes correlated MIMO channel, and proposed the quantizer utilizing correlation between authorized stations as key information and the quantizer selection scheme taking key entropies leak to eavesdroppers into consideration. This scheme that reduces information leaks to eavesdropper maintaining key disagreement probability between authorized stations.

Oct 31, 20210 citations

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

Hideichi Sasaoka, Hisato Iwai

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, 20200 citations

移動伝搬特性に基づくグループ秘密鍵共有の初期検討 : (その2)鎖型接続における従来方式の課題と新方式の提案

秀一笹岡, 誠人岩井, ヒデイチササオカ +3 more

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.

Jan 31, 20200 citations

Secret key agreement by public discussion from common information

Ueli M. Maurer

The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y, respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution P/sub XYZ/, can also receive all messages exchanged by the two parties over a public channel. The goal of a protocol is that the enemy obtains at most a negligible amount of information about S. Upper bounds on H(S) as a function of P/sub XYZ/ are presented. Lower bounds on the rate H(S)/N (as N to infinity ) are derived for the case in which X=(X/sub 1/, . . ., X/sub N/), Y=(Y/sub 1/, . . ., Y/sub N/) and Z=(Z/sub 1/, . . ., Z/sub N/) result from N independent executions of a random experiment generating X/sub i/, Y/sub i/ and Z/sub i/ for i=1, . . ., N. It is shown that such a secret key agreement is possible for a scenario in which all three parties receive the output of a binary symmetric source over independent binary symmetric channels, even when the enemy's channel is superior to the other two channels.>

IEEE Transactions on Information TheoryMay 1, 19932,005 citations

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

Hideichi Sasaoka, Hisato Iwai

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, 20200 citations