Existing works for securing network coding against wiretapping either incur high coding complexity or bring large bandwidth overhead. For exploiting the lightweight security mechanism for resource-constrained networks...Existing works for securing network coding against wiretapping either incur high coding complexity or bring large bandwidth overhead. For exploiting the lightweight security mechanism for resource-constrained networks, an efficient secure coding scheme is proposed in conjunction with the inherent mix- ing characteristic of network coding. The key idea is to minimize the randomizing operations to the entire plaintext data. The pro- posed scheme is shown to have properties of lightweight security complexity and lower communication overhead compared with the existing traditional solutions, and can be easy in implementation and combination with classical cryptography techniques.展开更多
Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead mechanism for secure network coding against wiretapping, t...Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead mechanism for secure network coding against wiretapping, three efficient schemes are proposed for the applications with different security requirements. The basic idea behind this paper is first to encrypt a small part of source vectors and then subject the remaining original source vectors and the encrypted vectors to a special linear transformation. Also, a lightweight version of this scheme is then presented for resource-constrained networks. Moreover, an extensive scheme with enhanced security is also considered. All proposals are shown to have properties of lower security complexity and smaller bandwidth usage compared with the existing solutions. Also, the proposals can be easy to achieve flexible levels of security for various applications.展开更多
极化码是适用于物理层wiretap信道安全模型的一种编码方式,针对在超奈奎斯特(FTN)条件下传输的极化码,设计了一种无需获知窃听信道信噪比(SNR)的帧间链式加密的安全结构。通过混淆结构将对合法接收端可靠而对非法窃听端阻塞的码元进行扩...极化码是适用于物理层wiretap信道安全模型的一种编码方式,针对在超奈奎斯特(FTN)条件下传输的极化码,设计了一种无需获知窃听信道信噪比(SNR)的帧间链式加密的安全结构。通过混淆结构将对合法接收端可靠而对非法窃听端阻塞的码元进行扩散,利用物理层主信道和窃听信道的差异,在每一帧中生成主信道可译而窃听信道不可译的密钥序列,对下一帧进行加密,实现安全容量的帧间传输。仿真结果显示,在FTN加速场景和窃听信道SNR相对于主信道波动的前提下,提出的极化码帧间安全结构可在wiretap信道的平均信道退化程度为0 d B时实现信息的安全传输。展开更多
In this paper, for physical-layer security(PLS), a novel scheme of polar coding encryption is introduced in the wiretap channel(WTC) model. To decrease transmission overhead of the shared secret information and enhanc...In this paper, for physical-layer security(PLS), a novel scheme of polar coding encryption is introduced in the wiretap channel(WTC) model. To decrease transmission overhead of the shared secret information and enhance the security performance against an attacker, we have employed the two following encryption technologies: Firstly, randomization of output bits is not dependent on the traditional randomized bit-channels but they are directly flipped through the random bit sequence. Secondly, for employing Advanced Encryption Standard(AES), we utilize the secret seed to extend an initial secret key of AES cryptosystem, which it appears a good avalanche performance. Result analyses demonstrate that the proposed scheme is strongly resistant against conventional attacks.展开更多
To investigate the impact of antenna correlation on secrecy performance in MIMO wiretap channels with Nakagami-m fading, the expressions of secrecy outage probability and positive secrecy probability were derived. Div...To investigate the impact of antenna correlation on secrecy performance in MIMO wiretap channels with Nakagami-m fading, the expressions of secrecy outage probability and positive secrecy probability were derived. Diversity order and array gain were also achieved for further insight. The study was based on the information theory that physical layer security can be guaranteed when the quality of the main channel is higher than that of the eavesdropper's channel. Monte Carlo simulations well validated the numerical results of analytic expressions. It was shown that antenna correlation is detrimental to secrecy performance when average SNR of the main channel is at medium and high level. Interestingly, when average SNR of the main channel reduces to low level, the effect of antenna correlation becomes benefi cial to secrecy performance.展开更多
Reliable communication imposes an upper limit on the achievable rate,namely the Shannon capacity.Wyner's wiretap coding ensures a security constraint and reliability,but results in a decrease of achievable rate.To...Reliable communication imposes an upper limit on the achievable rate,namely the Shannon capacity.Wyner's wiretap coding ensures a security constraint and reliability,but results in a decrease of achievable rate.To mitigate the loss in secrecy rate,we propose a coding scheme in which we use sufficiently old messages as key and prove that multiple messages are secure with respect to all the information possessed by the eavesdropper.We also show that we can achieve security in the strong sense.Next,we study a fading wiretap channel with full channel state information of the eavesdropper's channel and use our coding/decoding scheme to achieve a secrecy capacity close to the Shannon capacity of the main channel(in the ergodic sense).Finally,we study a case where the transmitter does not have instantaneous information of the channel state of the eavesdropper,but only its distribution.展开更多
An amplify-and-forward(AF) dual-hop relay is proposed for secure communication within Wyner s wiretap channel.Based on an information-theoretic formulation,the average secrecy rate is characterized when two legitimate...An amplify-and-forward(AF) dual-hop relay is proposed for secure communication within Wyner s wiretap channel.Based on an information-theoretic formulation,the average secrecy rate is characterized when two legitimate partners communicate over a quasi-static fading channel.Theoretical analysis and simulation results show that both cooperative strategies of average power scaling(APS) and instantaneous power scaling(IPS) are proved to be able to achieve information-theoretic security,and eavesdropper is unable to decode any information.展开更多
Under the assumption that the wiretapper can get at most r(r < n) independent messages, Cai et al. showed that any rate n multicast code can be modified to another secure network code with transmitting rate n- r by...Under the assumption that the wiretapper can get at most r(r < n) independent messages, Cai et al. showed that any rate n multicast code can be modified to another secure network code with transmitting rate n- r by a properly chosen matrix Q^(-1). They also gave the construction for searching such an n × n nonsingular matrix Q. In this paper, we find that their method implies an efficient construction of Q. That is to say, Q can be taken as a special block lower triangular matrix with diagonal subblocks being the(n- r) ×(n- r)and r × r identity matrices, respectively. Moreover, complexity analysis is made to show the efficiency of the specific construction.展开更多
This paper analyzed the security of constant dimensional subspace code against wiretap attacks. The security was measured in the probability with which an eavesdropper guessed the source message successfully. With the...This paper analyzed the security of constant dimensional subspace code against wiretap attacks. The security was measured in the probability with which an eavesdropper guessed the source message successfully. With the methods of linear algebra and combinatorics, an analytic solution of the probability was obtained. Performance of subspace code was compared to several secure network coding schemes from the perspective of security, flexibility, complexity, and independence, etc. The comparison showed subspace code did not have perfect security, but it achieved probabilistic security with low complexity. As a result, subspace code was suitable to the applications with limited computation and moderate security requirement.展开更多
基金Supported by the National Natural Science Foundation of China(11371290,61301178)the Science and Technology Innovation Foundation of Xi'an(CXY1352WL28,CXY1352WL27)
文摘Existing works for securing network coding against wiretapping either incur high coding complexity or bring large bandwidth overhead. For exploiting the lightweight security mechanism for resource-constrained networks, an efficient secure coding scheme is proposed in conjunction with the inherent mix- ing characteristic of network coding. The key idea is to minimize the randomizing operations to the entire plaintext data. The pro- posed scheme is shown to have properties of lightweight security complexity and lower communication overhead compared with the existing traditional solutions, and can be easy in implementation and combination with classical cryptography techniques.
基金Supported by the National Natural Science Foundation of China(6127117)
文摘Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead mechanism for secure network coding against wiretapping, three efficient schemes are proposed for the applications with different security requirements. The basic idea behind this paper is first to encrypt a small part of source vectors and then subject the remaining original source vectors and the encrypted vectors to a special linear transformation. Also, a lightweight version of this scheme is then presented for resource-constrained networks. Moreover, an extensive scheme with enhanced security is also considered. All proposals are shown to have properties of lower security complexity and smaller bandwidth usage compared with the existing solutions. Also, the proposals can be easy to achieve flexible levels of security for various applications.
文摘极化码是适用于物理层wiretap信道安全模型的一种编码方式,针对在超奈奎斯特(FTN)条件下传输的极化码,设计了一种无需获知窃听信道信噪比(SNR)的帧间链式加密的安全结构。通过混淆结构将对合法接收端可靠而对非法窃听端阻塞的码元进行扩散,利用物理层主信道和窃听信道的差异,在每一帧中生成主信道可译而窃听信道不可译的密钥序列,对下一帧进行加密,实现安全容量的帧间传输。仿真结果显示,在FTN加速场景和窃听信道SNR相对于主信道波动的前提下,提出的极化码帧间安全结构可在wiretap信道的平均信道退化程度为0 d B时实现信息的安全传输。
基金supported in part by the National Natural Science Foundation of China (Grant No. 61871009)
文摘In this paper, for physical-layer security(PLS), a novel scheme of polar coding encryption is introduced in the wiretap channel(WTC) model. To decrease transmission overhead of the shared secret information and enhance the security performance against an attacker, we have employed the two following encryption technologies: Firstly, randomization of output bits is not dependent on the traditional randomized bit-channels but they are directly flipped through the random bit sequence. Secondly, for employing Advanced Encryption Standard(AES), we utilize the secret seed to extend an initial secret key of AES cryptosystem, which it appears a good avalanche performance. Result analyses demonstrate that the proposed scheme is strongly resistant against conventional attacks.
文摘To investigate the impact of antenna correlation on secrecy performance in MIMO wiretap channels with Nakagami-m fading, the expressions of secrecy outage probability and positive secrecy probability were derived. Diversity order and array gain were also achieved for further insight. The study was based on the information theory that physical layer security can be guaranteed when the quality of the main channel is higher than that of the eavesdropper's channel. Monte Carlo simulations well validated the numerical results of analytic expressions. It was shown that antenna correlation is detrimental to secrecy performance when average SNR of the main channel is at medium and high level. Interestingly, when average SNR of the main channel reduces to low level, the effect of antenna correlation becomes benefi cial to secrecy performance.
文摘Reliable communication imposes an upper limit on the achievable rate,namely the Shannon capacity.Wyner's wiretap coding ensures a security constraint and reliability,but results in a decrease of achievable rate.To mitigate the loss in secrecy rate,we propose a coding scheme in which we use sufficiently old messages as key and prove that multiple messages are secure with respect to all the information possessed by the eavesdropper.We also show that we can achieve security in the strong sense.Next,we study a fading wiretap channel with full channel state information of the eavesdropper's channel and use our coding/decoding scheme to achieve a secrecy capacity close to the Shannon capacity of the main channel(in the ergodic sense).Finally,we study a case where the transmitter does not have instantaneous information of the channel state of the eavesdropper,but only its distribution.
基金Supported by the National Natural Science Foundation of China(No.61325018,61272379)the National High Technology Research and Development Program of China(No.2006AA04Z246)the Ministry of Education Science and Technology Innovation Engineering Major Cultivation Project of China(No.107053)
文摘An amplify-and-forward(AF) dual-hop relay is proposed for secure communication within Wyner s wiretap channel.Based on an information-theoretic formulation,the average secrecy rate is characterized when two legitimate partners communicate over a quasi-static fading channel.Theoretical analysis and simulation results show that both cooperative strategies of average power scaling(APS) and instantaneous power scaling(IPS) are proved to be able to achieve information-theoretic security,and eavesdropper is unable to decode any information.
基金Supported by the National Natural Science Foundation of China(61201253)
文摘Under the assumption that the wiretapper can get at most r(r < n) independent messages, Cai et al. showed that any rate n multicast code can be modified to another secure network code with transmitting rate n- r by a properly chosen matrix Q^(-1). They also gave the construction for searching such an n × n nonsingular matrix Q. In this paper, we find that their method implies an efficient construction of Q. That is to say, Q can be taken as a special block lower triangular matrix with diagonal subblocks being the(n- r) ×(n- r)and r × r identity matrices, respectively. Moreover, complexity analysis is made to show the efficiency of the specific construction.
文摘This paper analyzed the security of constant dimensional subspace code against wiretap attacks. The security was measured in the probability with which an eavesdropper guessed the source message successfully. With the methods of linear algebra and combinatorics, an analytic solution of the probability was obtained. Performance of subspace code was compared to several secure network coding schemes from the perspective of security, flexibility, complexity, and independence, etc. The comparison showed subspace code did not have perfect security, but it achieved probabilistic security with low complexity. As a result, subspace code was suitable to the applications with limited computation and moderate security requirement.
