scholarly journals Secure Polar Coding for the Primitive Relay Wiretap Channel

Entropy ◽  
2021 ◽  
Vol 23 (4) ◽  
pp. 442
Author(s):  
Manos Athanasakos ◽  
George Karagiannidis
Keyword(s):  
Error Correcting Codes ◽  
Wireless Channel ◽  
Secure Communications ◽  
Decode And Forward ◽  
Wiretap Channel ◽  
Information Theoretic ◽  
Channel Characteristics ◽  
Information Theoretic Security ◽  
Polar Coding ◽  
Cryptographic Techniques

With the emergence of wireless networks, cooperation for secrecy is recognized as an attractive way to establish secure communications. Departing from cryptographic techniques, secrecy can be provided by exploiting the wireless channel characteristics; that is, some error-correcting codes besides reliability have been shown to achieve information-theoretic security. In this paper, we propose a polar-coding-based technique for the primitive relay wiretap channel and show that this technique is suitable to provide information-theoretic security. Specifically, we integrate at the relay an additional functionality, which allows it to smartly decide whether it will cooperate or not based on the decoding detector result. In the case of cooperation, the relay operates in a decode-and-forward mode and assists the communication by transmitting a complementary message to the destination in order to correctly decode the initial source’s message. Otherwise, the communication is completed with direct transmission from source to the destination. Finally, we first prove that the proposed encoding scheme achieves weak secrecy, then, in order to overcome the obstacle of misaligned bits, we implement a double-chaining construction, which achieves strong secrecy.

scholarly journals E - Capacity - Equivocation Region of Wiretap Channel

2021 ◽  
Vol 27 (11) ◽  
pp. 1222-1239
Author(s):  
Mariam Haroutunian
Keyword(s):  
Secure Communication ◽  
Maximum Rate ◽  
Channel Model ◽  
Reliability Function ◽  
Achievable Rate ◽  
Secrecy Capacity ◽  
Wiretap Channel ◽  
Information Theoretic ◽  
Information Theoretic Security ◽  
The Given

One of the problems of information - theoretic security concerns secure communication over a wiretap channel. The aim in the general wiretap channel model is to maximize the rate of the reliable communication from the source to the legitimate receiver, while keeping the confidential information as secret as possible from the wiretapper (eavesdropper). We introduce and investigate the E - capacity - equivocation region and the E - secrecy capacity function for the wiretap channel, which are, correspondingly, the generalizations of the capacity - equivocation region and secrecy - capacity studied by Csiszár and Körner (1978). The E - capacity equivocation region is the closure of the set of all achievable rate - reliability and equivocation pairs, where the rate - reliability function represents the optimal dependence of rate on the error probability exponent (reliability). By analogy with the notion of E - capacity, we consider the E - secrecy capacity function that for the given E is the maximum rate at which the message can be transmitted being kept perfectly secret from the wiretapper.

scholarly journals Implications of Coding Layers on Physical-Layer Security: A Secrecy Benefit Approach

Entropy ◽  
2019 ◽  
Vol 21 (8) ◽  
pp. 755 ◽  
Author(s):  
Harrison ◽  
Beard ◽  
Dye ◽  
Holmes ◽  
Nelson ◽  
...  
Keyword(s):  
Physical Layer Security ◽  
Error Control ◽  
Physical Layer ◽  
Error Control Coding ◽  
Wiretap Channel ◽  
New Approach ◽  
Information Theoretic ◽  
Information Theoretic Security ◽  
Coset Coding ◽  
Pros And Cons

In this work, we consider the pros and cons of using various layers of keyless coding toachieve secure and reliable communication over the Gaussian wiretap channel. We define a newapproach to information theoretic security, called practical secrecy and the secrecy benefit, to be usedover real-world channels and finite blocklength instantiations of coding layers, and use this newapproach to show the fundamental reliability and security implications of several coding mechanismsthat have traditionally been used for physical-layer security. We perform a systematic/structuredanalysis of the effect of error-control coding, scrambling, interleaving, and coset coding, as codinglayers of a secrecy system. Using this new approach, scrambling and interleaving are shown to be ofno effect in increasing information theoretic security, even when measuring the effect at the output ofthe eavesdropper’s decoder. Error control coding is shown to present a trade-off between secrecyand reliability that is dictated by the chosen code and the signal-to-noise ratios at the legitimate andeavesdropping receivers. Finally, the benefits of secrecy coding are highlighted, and it is shown howone can shape the secrecy benefit according to system specifications using combinations of differentlayers of coding to achieve both reliable and secure throughput.

scholarly journals Mosaics of combinatorial designs for information-theoretic security

2022 ◽  
Author(s):  
Moritz Wiese ◽  
Holger Boche
Keyword(s):  
Combinatorial Designs ◽  
Block Designs ◽  
Secret Key ◽  
Wiretap Channel ◽  
Secret Key Generation ◽  
Information Theoretic ◽  
Information Theoretic Security ◽  
Versus Color ◽  
Functional Forms ◽  
Balanced Incomplete Block

AbstractWe study security functions which can serve to establish semantic security for the two central problems of information-theoretic security: the wiretap channel, and privacy amplification for secret key generation. The security functions are functional forms of mosaics of combinatorial designs, more precisely, of group divisible designs and balanced incomplete block designs. Every member of a mosaic is associated with a unique color, and each color corresponds to a unique message or key value. Every block index of the mosaic corresponds to a public seed shared between the two trusted communicating parties. The seed set should be as small as possible. We give explicit examples which have an optimal or nearly optimal trade-off of seed length versus color (i.e., message or key) rate. We also derive bounds for the security performance of security functions given by functional forms of mosaics of designs.

scholarly journals Device-independent quantum key distribution with random key basis

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
René Schwonnek ◽  
Koon Tong Goh ◽  
Ignatius W. Primaatmaja ◽  
Ernest Y.-Z. Tan ◽  
Ramona Wolf ◽  
...  
Keyword(s):  
Quantum Key Distribution ◽  
Bell Inequality ◽  
Key Distribution ◽  
Theory And Practice ◽  
Information Theoretic ◽  
Information Theoretic Security ◽  
Experimental Parameters ◽  
Secret Keys ◽  
Simple Variant ◽  
First Time

AbstractDevice-independent quantum key distribution (DIQKD) is the art of using untrusted devices to distribute secret keys in an insecure network. It thus represents the ultimate form of cryptography, offering not only information-theoretic security against channel attacks, but also against attacks exploiting implementation loopholes. In recent years, much progress has been made towards realising the first DIQKD experiments, but current proposals are just out of reach of today’s loophole-free Bell experiments. Here, we significantly narrow the gap between the theory and practice of DIQKD with a simple variant of the original protocol based on the celebrated Clauser-Horne-Shimony-Holt (CHSH) Bell inequality. By using two randomly chosen key generating bases instead of one, we show that our protocol significantly improves over the original DIQKD protocol, enabling positive keys in the high noise regime for the first time. We also compute the finite-key security of the protocol for general attacks, showing that approximately 108–1010 measurement rounds are needed to achieve positive rates using state-of-the-art experimental parameters. Our proposed DIQKD protocol thus represents a highly promising path towards the first realisation of DIQKD in practice.

scholarly journals Polar Coding for the Wiretap Channel With Shared Key

2018 ◽  
Vol 13 (6) ◽  
pp. 1351-1360 ◽  
Author(s):  
Haowei Wang ◽  
Xiaofeng Tao ◽  
Na Li ◽  
Zhu Han
Keyword(s):  
Wiretap Channel ◽  
Polar Coding ◽  
Shared Key

scholarly journals Physical-layer encryption on the public internet: A stochastic approach to the Kish-Sethuraman cipher

2014 ◽  
Vol 33 ◽  
pp. 1460361 ◽  
Author(s):  
Lachlan J. Gunn ◽  
James M. Chappell ◽  
Andrew Allison ◽  
Derek Abbott
Keyword(s):  
Quantum Key Distribution ◽  
Secure Communication ◽  
Key Distribution ◽  
Stochastic Approach ◽  
Physical Layer ◽  
Information Theoretic ◽  
The Public ◽  
Information Theoretic Security ◽  
Transit Times ◽  
The One

While information-theoretic security is often associated with the one-time pad and quantum key distribution, noisy transport media leave room for classical techniques and even covert operation. Transit times across the public internet exhibit a degree of randomness, and cannot be determined noiselessly by an eavesdropper. We demonstrate the use of these measurements for information-theoretically secure communication over the public internet.

Secret Error-Correcting Network Coding against Eavesdropping and Pollution Attacks

2012 ◽  
Vol 457-458 ◽  
pp. 1499-1507 ◽  
Author(s):  
Si Guang Chen ◽  
Meng Wu ◽  
Wei Feng Lu
Keyword(s):  
Network Coding ◽  
Necessary Condition ◽  
Information Theoretic ◽  
Transmitted Information ◽  
Information Theoretic Security ◽  
Secret Communication ◽  
Pollution Attacks ◽  
Rank Metric Codes ◽  
Shared Secret ◽  
And Performance

In this work we consider the problem of designing a secret error-correcting network coding scheme against an adversary that can re-select the tapping links in different time slot and inject z erroneous packets into network. We first derive a necessary condition for keeping the transmitted information secret from the adversary, while the network is only subject to the eavesdropping attack. We then design an error-correcting scheme by combining the rank-metric codes with shared secret model, which can decode the transmitted information correctly provided a sufficiently large q. With that, a secret error-correcting network coding is proposed by combining this error-correcting scheme with secret communication. We show that under the requirement of communication can achieve a rate of packets. Moreover, it ensures that the communicated information is reliable and information-theoretic security from the adversary. In particular, the requirement of packet length is not as large as the required in [12]. Finally, the security and performance analyses illustrate the characteristics of our scheme.

Sign in / Sign up

Export Citation Format

Share Document