In this paper, we use a linear programming (LP) optimization approach to evaluate the equivocation when coding over a wiretap channel model where the main channel is noiseless and the eavesdropper's channel is a b...
详细信息
In this paper, we use a linear programming (LP) optimization approach to evaluate the equivocation when coding over a wiretap channel model where the main channel is noiseless and the eavesdropper's channel is a binary symmetric channel (BSC). Using this technique, we present a numerically-derived upper bound for the achievable secrecy rate in the finite blocklength regime that is tighter than traditional infinite blocklength bounds. We also propose a secrecy coding technique that outperforms random binning codes. When there is one overhead bit, this coding technique is optimum and achieves the newly derived bound. For cases with additional bits of overhead, our coding scheme can achieve equivocation rates close to the new bound. Furthermore, we explore the patterns of the generator matrix and the parity-check matrix for linear codes and we present binning techniques for both linear and nonlinear codes using two different approaches: recursive and non-recursive. To our knowledge, this is the first optimization solution for secrecy coding obtained through linear programming. Our new bounds and codes mark a significant breakthrough towards understanding fundamental limits of performance (and how to achieve them in some instances) for the binary symmetric wiretap channel with real finite blocklength coding constructions. Our techniques are especially useful for codes of small to medium blocklength, such as those that may be required by applications with small payloads, such as the Internet of Things.
A typical cyber-physical system setup includes a local system sending measurements of its internal state to a remote state estimator. A form of attack consists of an eavesdropper observing this information exchange. S...
详细信息
A typical cyber-physical system setup includes a local system sending measurements of its internal state to a remote state estimator. A form of attack consists of an eavesdropper observing this information exchange. secrecy coding schemes have been recently proposed to achieve immunity to eavesdropping. The essential idea consists in coding the transmitting information in a way such that a single packet lost by the eavesdropper causes an irrecoverable error of its state estimation. Common limitations of the available methods are the assumptions that the local system can directly measure its internal state and that the system is unstable. In this work, we drop these assumptions and consider the general case in which measurements are noisy linear combinations of an inaccessible internal state and that the system is not necessarily unstable. To design the coding scheme, we introduce the concept of total secrecy, meaning that if the eavesdropper misses a packet that is available at the remote estimator, the former behaves as if no further packets were received. We derive a sufficient condition for total secrecy, as well as the code achieving this property. Also, for the case in which we cannot guarantee total secrecy, we address the problem of designing a code achieving maximum secrecy in some sense. We present numerical examples illustrating our claims.
In this paper we present a new scheme combining artificial noise beam forming and secrecy coding to strengthen the security of existing wireless communication systems. Artificial noise and beam forming guarantee a rad...
详细信息
In this paper we present a new scheme combining artificial noise beam forming and secrecy coding to strengthen the security of existing wireless communication systems. Artificial noise and beam forming guarantee a radio advantage to legitimate users, enabling the use of our secrecy coding scheme to provide reliability and secrecy. This overall security protocol is compliant with existing widespread radio access technologies and it can be considered as a key-free add-on to improve security of the physical layer of wireless networks.
A secrecy coding scheme is provided for degraded wire-tap channels via the method of channel polarization. It is shown that the entire rate-equivocation region is achievable via the provided scheme. The key element in...
详细信息
暂无评论