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 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.

Secure Communications over Wireless Networks

2012 ◽  
pp. 10-37
Author(s):  
Md. Zahurul Islam Sarkar
Keyword(s):  
Fading Channels ◽  
Open Loop ◽  
Main Channel ◽  
Secrecy Capacity ◽  
Transmission Scheme ◽  
Information Theoretic ◽  
Information Theoretic Security ◽  
Input Multiple Output ◽  
Single Input ◽  
Analytical Expressions

Nakagami-m fading channel is chosen to analyze the secrecy capacity for fading channels since the Nakagami-m distribution can model fading conditions, which are more or less severe than that of Rayleigh and has the advantage of including Rayleigh as a special case. At first, secrecy capacity is defined in case of full channel state information (CSI) at the transmitter, where transmitter has access to both the main channel and eavesdropper channel gains. Secondly, secrecy capacity is defined with only main channel CSI at the transmitter. Then, optimal power allocation at the transmitter that achieves the secrecy capacity is derived for both the cases. Moreover, secrecy capacity is defined under open-loop transmission scheme, and the exact closed form analytical expression for the lower bound of ergodic secrecy capacity is derived for Nakagami-m fading single-input multiple-output (SIMO) channel. In addition, secrecy capacity is defined for the AWGN channel in order to realize the information-theoretic security of wireless channels with no fading. Finally, analytical expressions for the probability of non-zero secrecy capacity and secure outage probability are derived in order to investigate the secure outage performance of fading channels.

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.

Some attacks on quantum-based cryptographic protocols

2005 ◽  
Vol 5 (1) ◽  
pp. 40-47
Author(s):  
H-K Lo ◽  
T-M Ko
Keyword(s):  
Coherent States ◽  
Secure Communication ◽  
Single Photon ◽  
Cryptographic Protocols ◽  
Original Design ◽  
Information Theoretic ◽  
Information Theoretic Security ◽  
Photon States ◽  
Lossy Channel ◽  
Known Plaintext Attack

Quantum-based cryptographic protocols are often said to enjoy security guaranteed by the fundamental laws of physics. However, even carefully designed quantum-based cryptographic schemes may be susceptible to subtle attacks that are outside the original design. As an example, we give attacks against a recently proposed ``secure communication using mesoscopic coherent states'', which employs mesoscopic states, rather than single-photon states. Our attacks can be used either as a known-plaintext attack or in the case where the plaintext has not been randomized. One of our attacks requires beamsplitters and the replacement of a lossy channel by a lossless one. It is successful provided that the original loss in the channel is so big that Eve can obtain $2^k$ copies of what Bob receives, where $k$ is the length of the seed key pre-shared by Alice and Bob. In addition, substantial improvements over such an exhaustive key search attack can be made, whenever a key is reused. Furthermore, we remark that, under the same assumption of a known or non-random plaintext, Grover's exhaustive key search attack can be applied directly to "secure communication using mesoscopic coherent states", whenever the channel loss is more than 50 percent. Therefore, as far as information-theoretic security is concerned, optically amplified signals necessarily degrade the security of the proposed scheme, when the plaintext is known or non-random. Our attacks apply even if the mesoscopic scheme is used only for key generation with a subsequent use of the key for one-time-pad encryption. Studying those attacks can help us to better define the risk models and parameter spaces in which quantum-based cryptographic schemes can operate securely. Finally, we remark that our attacks do not affect standard protocols such as Bennett-Brassard BB84 protocol or Bennett B92 protocol, which rely on single-photon signals.

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.

Sign in / Sign up

Export Citation Format

Share Document