ترغب بنشر مسار تعليمي؟ اضغط هنا

Stealthy Secret Key Generation

112   0   0.0 ( 0 )
 نشر من قبل Pin-Hsun Lin
 تاريخ النشر 2017
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

In this work, we consider a complete covert communication system, which includes the source-model of a stealthy secret key generation (SSKG) as the first phase. The generated key will be used for the covert communication in the second phase of the current round and also in the first phase of the next round. We investigate the stealthy SK rate performance of the first phase. The derived results show that the SK capacity lower and upper bounds of the source-model SKG are not affected by the additional stealth constraint. This result implies that we can attain the SSKG capacity for free when the sequences observed by the three terminals Alice ($X^n$), Bob ($Y^n$) and Willie ($Z^n$) follow a Markov chain relationship, i.e., $X^n-Y^n-Z^n$. We then prove that the sufficient condition to attain both, the SK capacity as well as the SSK capacity, can be relaxed from physical to stochastic degradedness. In order to underline the practical relevance, we also derive a sufficient condition to attain the degradedness by the usual stochastic order for Maurers fast fading Gaussian (satellite) model for the source of common randomness.



قيم البحث

اقرأ أيضاً

91 - J. Harshan , Rohit Joshi , 2018
It is well known that physical-layer Group Secret-Key (GSK) generation techniques allow multiple nodes of a wireless network to synthesize a common secret-key, which can be subsequently used to keep their group messages confidential. As one of its sa lient features, the wireless nodes involved in physical-layer GSK generation extract randomness from a subset of their wireless channels, referred as the common source of randomness (CSR). Unlike two-user key generation, in GSK generation, some nodes must act as facilitators by broadcasting quantiz
77 - You Chen , Guyue Li , Chen Sun 2020
Physical-layer key generation (PKG) in multi-user massive MIMO networks faces great challenges due to the large length of pilots and the high dimension of channel matrix. To tackle these problems, we propose a novel massive MIMO key generation scheme with pilot reuse based on the beam domain channel model and derive close-form expression of secret key rate. Specifically, we present two algorithms, i.e., beam-domain based channel probing (BCP) algorithm and interference neutralization based multi-user beam allocation (IMBA) algorithm for the purpose of channel dimension reduction and multi-user pilot reuse, respectively. Numerical results verify that the proposed PKG scheme can achieve the secret key rate that approximates the perfect case, and significantly reduce the dimension of the channel estimation and pilot overhead.
125 - You Chen , Guyue Li , Cunhua Pan 2021
Physical-layer key generation (PKG) can generate symmetric keys between two communication ends based on the reciprocal uplink and downlink channels. By smartly reconfiguring the radio signal propagation, intelligent reflecting surface (IRS) is able t o improve the secret key rate of PKG. However, existing works involving IRS-assisted PKG are concentrated in single-antenna wireless networks. So this paper investigates the problem of PKG in the IRS-assisted multiple-input single-output (MISO) system, which aims to maximize the secret key rate by optimally designing the IRS passive beamforming. First, we analyze the correlation between channel state information (CSI) of eavesdropper and legitimate ends and derive the expression of the upper bound of secret key rate under passive eavesdropping attack. Then, an optimal algorithm for designing IRS reflecting coefficients based on Semi-Definite Relaxation (SDR) and Taylor expansion is proposed to maximize the secret key rate. Numerical results show that our optimal IRS-assisted PKG scheme can achieve much higher secret key rate when compared with two benchmark schemes.
Physical-layer group secret-key (GSK) generation is an effective way of generating secret keys in wireless networks, wherein the nodes exploit inherent randomness in the wireless channels to generate group keys, which are subsequently applied to secu re messages while broadcasting, relaying, and other network-level communications. While existing GSK protocols focus on securing the common source of randomness from external eavesdroppers, they assume that the legitimate nodes of the group are trusted. In this paper, we address insider attacks from the legitimate participants of the wireless network during the key generation process. Instead of addressing conspicuous attacks such as switching-off communication, injecting noise, or denying consensus on group keys, we introduce stealth attacks that can go undetected against state-of-the-art GSK schemes. We propose two forms of attacks, namely: (i) different-key attacks, wherein an insider attempts to generate different keys at different nodes, especially across nodes that are out of range so that they fail to recover group messages despite possessing the group key, and (ii) low-rate key attacks, wherein an insider alters the common source of randomness so as to reduce the key-rate. We also discuss various detection techniques, which are based on detecting anomalies and inconsistencies on the channel measurements at the legitimate nodes. Through simulations we show that GSK generation schemes are vulnerable to insider-threats, especially on topologies that cannot support additional secure links between neighbouring nodes to verify the attacks.
81 - Rohit Joshi , J. Harshan 2021
It is well known that physical-layer key generation methods enable wireless devices to harvest symmetric keys by accessing the randomness offered by the wireless channels. Although two-user key generation is well understood, group secret-key (GSK) ge neration, wherein more than two nodes in a network generate secret-keys, still poses open problems. Recently, Manish Rao et al., have proposed the Algebraic Symmetrically Quantized GSK (A-SQGSK) protocol for a network of three nodes wherein the nodes share quantiz
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا