Experimental validation of wireless secret key agreement using array antennas

Shimizu, Takayuki; Otani, N.; Takayasu, Kitano; Iwai, Hisato; Sasaoka, Hideichi

doi:10.1109/ursigass.2011.6050501

Cited by 5 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The MIMO technique can be applied to communications and sensing or radar systems that are non-communicative, by employing MIMO propagation characteristics [94], [95]. There is also a scheme for secret key agreement based on radio propagation characteristics using array antennas that have been developed as a novel approach to this application [96].…”

Section: Mimo Propagation For Various Applicationsmentioning

confidence: 99%

Recent Technologies in Japan on Array Antennas for Wireless Systems

Hirokawa

Chen

Fujimoto

et al. 2017

IEICE Trans. Commun.

View full text Add to dashboard Cite

SUMMARY Array antenna technology for wireless systems is highly integrated for demands such as multi-functionality and high-performance. This paper details recent technologies in Japan in design techniques based on computational electromagnetics, antenna hardware techniques in the millimeter-wave band, array signal processing to add adaptive functions, and measurement methods to support design techniques, for array antennas for future wireless systems. Prospects of these four technologies are also described. key words: array antenna, multiple antenna, computational electromagnetics, millimeter-wave, antenna measurement, signal processing

show abstract

Section: Mimo Propagation For Various Applicationsmentioning

confidence: 99%

Recent Technologies in Japan on Array Antennas for Wireless Systems

Hirokawa

Chen

Fujimoto

et al. 2017

IEICE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…By a similar argument we have that Pr(J 1 ) → 0. Since H(φ A ) ≤ K(I(u BA ; ĥBA | ĥAB ) + 2ε) and since the rate constraint (18) is imposed, terminal B decodes φ A with high probability. In similar fashion it can be argued that Pr(J 2 ) → 0 as K → ∞.…”

Section: F Equivocation Analysismentioning

confidence: 99%

“…A number of experimental testbeds already demonstrate practical viability of such methods. See e..g., [13], [18]- [20].…”

Section: Introductionmentioning

confidence: 99%

Secret-Key Agreement Capacity over Reciprocal Fading Channels: A Separation Approach

Khisti

2012

Preprint

View full text Add to dashboard Cite

Fundamental limits of secret-key agreement over reciprocal wireless channels are investigated. We consider a two-way block-fading channel where the channel gains in the forward and reverse links between the legitimate terminals are correlated. The channel gains between the legitimate terminals are not revealed to any terminal, whereas the channel gains of the eavesdropper are revealed to the eavesdropper. We propose a twophase transmission scheme, that reserves a certain portion of each coherence block for channel estimation, and the remainder of the coherence block for correlated source generation. The resulting secret-key involves contributions of both channel sequences and source sequences, with the contribution of the latter becoming dominant as the coherence period increases. We also establish an upper bound on the secret-key capacity, which has a form structurally similar to the lower bound. Our upper and lower bounds coincide in the limit of high signal-to-noise-ratio (SNR) and large coherence period, thus establishing the secret-key agreement capacity in this asymptotic regime. Numerical results indicate that the proposed scheme achieves significant gains over training-only schemes, even for moderate SNR and small coherence periods, thus implying the necessity of randomnesssharing in practical secret-key generation systems.

show abstract