scholarly journals Feedback Schemes for the Action-Dependent Wiretap Channel with Noncausal State at the Transmitter

Entropy ◽  
2019 ◽  
Vol 21 (3) ◽  
pp. 278 ◽  
Author(s):  
Haonan Zhang ◽  
Linman Yu ◽  
Bin Dai
Keyword(s):  
Secret Key ◽  
Wiretap Channel ◽  
Coding Scheme ◽  
Coding Schemes ◽  
Feedback Scheme ◽  
Noiseless Feedback ◽  
Better Than

In this paper, we propose two feedback coding schemes for the action-dependent wiretap channel with noncausal state at the transmitter. The first scheme follows from the already existing secret key based feedback coding scheme for the wiretap channel. The second one follows from our recently proposed hybrid feedback scheme for the wiretap channel. We show that, for the action-dependent wiretap channel with noncausal state at the transmitter, the second feedback scheme performs better than the first one, and the capacity results of this paper are further explained via a Gaussian example, which we call the action-dependent dirty paper wiretap channel with noiseless feedback.

scholarly journals Wiretap Channel with Action-Dependent States and Rate-Limited Feedback

2013 ◽  
Vol 2013 ◽  
pp. 1-19 ◽  
Author(s):  
Xinxing Yin ◽  
Xiao Chen ◽  
Zhi Xue
Keyword(s):  
Communication Systems ◽  
Limited Feedback ◽  
The State ◽  
Secrecy Capacity ◽  
Wiretap Channel ◽  
Action Sequence ◽  
State Sequence ◽  
Coding Schemes ◽  
Rate Splitting ◽  
Noiseless Feedback

We introduce the wiretap channel with action-dependent states and rate-limited feedback. In the new model, the state sequence is dependent on the action sequence which is selected according to the message, and a secure rate-limited feedback link is shared between the transmitter and the receiver. We obtain the capacity-equivocation region and secrecy capacity of such a channel both for the case where the channel inputs depend noncausally on the state sequence and the case where they are restricted to causal dependence. We construct the capacity-achieving coding schemes utilizing Wyner's random binning, Gel'fand and Pinsker’s coding technique, and rate splitting. Furthermore, we compare our results with the existing approaches without feedback, with noiseless feedback, and without action-dependent states. The simulation results show that the secrecy capacity of our model is bigger than that of the first two existed approaches. Besides, it is also shown that, by taking actions to affect the channel states, we guarantee the data integrity of the message transmitted in the two-stage communication systems although the tolerable overhead of transmission time is brought.

scholarly journals New Result on the Feedback Capacity of the Action-Dependent Dirty Paper Wiretap Channel

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 929
Author(s):  
Guangfen Xie ◽  
Bin Dai
Keyword(s):  
Lower Bound ◽  
Secrecy Capacity ◽  
Hybrid Scheme ◽  
Wiretap Channel ◽  
Numerical Examples ◽  
Feedback Model ◽  
Feedback Scheme ◽  
Channel Feedback ◽  
Noiseless Feedback ◽  
State Interference

The Gaussian wiretap channel with noncausal state interference available at the transmitter, which is also called the dirty paper wiretap channel (DP-WTC), has been extensively studied in the literature. Recently, it has been shown that taking actions on the corrupted state interference of the DP-WTC (also called the action-dependent DP-WTC) helps to increase the secrecy capacity of the DP-WTC. Subsequently, it has been shown that channel feedback further increases the secrecy capacity of the action-dependent DP-WTC (AD-DP-WTC), and a sub-optimal feedback scheme is proposed for this feedback model. In this paper, a two-step hybrid scheme and a corresponding new lower bound on the secrecy capacity of the AD-DP-WTC with noiseless feedback are proposed. The proposed new lower bound is shown to be optimal (achieving the secrecy capacity) and tighter than the existing one in the literature for some cases, and the results of this paper are further explained via numerical examples.

scholarly journals Security Analysis of Discrete-Modulated Continuous-Variable Quantum Key Distribution over Seawater Channel

2019 ◽  
Vol 9 (22) ◽  
pp. 4956 ◽  
Author(s):  
Xinchao Ruan ◽  
Hang Zhang ◽  
Wei Zhao ◽  
Xiaoxue Wang ◽  
Xuan Li ◽  
...  
Keyword(s):  
Quantum Key Distribution ◽  
Secure Communication ◽  
Security Analysis ◽  
Finite Size ◽  
Key Distribution ◽  
Continuous Variable ◽  
Heterodyne Detection ◽  
Secret Key ◽  
Transmission Distance ◽  
Better Than

We investigate the optical absorption and scattering properties of four different kinds of seawater as the quantum channel. The models of discrete-modulated continuous-variable quantum key distribution (CV-QKD) in free-space seawater channel are briefly described, and the performance of the four-state protocol and the eight-state protocol in asymptotic and finite-size cases is analyzed in detail. Simulation results illustrate that the more complex is the seawater composition, the worse is the performance of the protocol. For different types of seawater channels, we can improve the performance of the protocol by selecting different optimal modulation variances and controlling the extra noise on the channel. Besides, we can find that the performance of the eight-state protocol is better than that of the four-state protocol, and there is little difference between homodyne detection and heterodyne detection. Although the secret key rate of the protocol that we propose is still relatively low and the maximum transmission distance is only a few hundred meters, the research on CV-QKD over the seawater channel is of great significance, which provides a new idea for the construction of global secure communication network.

scholarly journals An overview of channel coding for 5G NR cellular communications

2019 ◽  
Vol 8 ◽  
Author(s):  
Jung Hyun Bae ◽  
Ahmed Abotabl ◽  
Hsien-Ping Lin ◽  
Kee-Bong Song ◽  
Jungwon Lee
Keyword(s):  
Channel Coding ◽  
Ldpc Codes ◽  
Low Latency ◽  
Polar Codes ◽  
Coding Scheme ◽  
Coding Schemes ◽  
Successive Cancellation ◽  
New Radio ◽  
Key Characteristics ◽  
User Data

AbstractA 5G new radio cellular system is characterized by three main usage scenarios of enhanced mobile broadband (eMBB), ultra-reliable and low latency communications (URLLC), and massive machine type communications, which require improved throughput, latency, and reliability compared with a 4G system. This overview paper discusses key characteristics of 5G channel coding schemes which are mainly designed for the eMBB scenario as well as for partial support of the URLLC scenario focusing on low latency. Two capacity-achieving channel coding schemes of low-density parity-check (LDPC) codes and polar codes have been adopted for 5G where the former is for user data and the latter is for control information. As a coding scheme for data, 5G LDPC codes are designed to support high throughput, a variable code rate and length and hybrid automatic repeat request in addition to good error correcting capability. 5G polar codes, as a coding scheme for control, are designed to perform well with short block length while addressing a latency issue of successive cancellation decoding.

scholarly journals Cryptanalysis of Loiss Stream Cipher-Revisited

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Lin Ding ◽  
Chenhui Jin ◽  
Jie Guan ◽  
Qiuyan Wang
Keyword(s):  
Time Complexity ◽  
Stream Cipher ◽  
Linear Equations ◽  
Data Complexity ◽  
Secret Key ◽  
Key Recovery ◽  
Systems Of Linear Equations ◽  
Key Recovery Attack ◽  
Better Than

Loiss is a novel byte-oriented stream cipher proposed in 2011. In this paper, based on solving systems of linear equations, we propose an improved Guess and Determine attack on Loiss with a time complexity of 2231and a data complexity of 268, which reduces the time complexity of the Guess and Determine attack proposed by the designers by a factor of 216. Furthermore, a related key chosenIVattack on a scaled-down version of Loiss is presented. The attack recovers the 128-bit secret key of the scaled-down Loiss with a time complexity of 280, requiring 264chosenIVs. The related key attack is minimal in the sense that it only requires one related key. The result shows that our key recovery attack on the scaled-down Loiss is much better than an exhaustive key search in the related key setting.

Stories students tell about their lived experiences of spirituality in the Dalcroze class

2020 ◽  
Vol 37 (2) ◽  
pp. 125-139
Author(s):  
John Habron ◽  
Liesl van der Merwe
Keyword(s):  
Data Analysis ◽  
Social Interaction ◽  
Lived Experiences ◽  
Music Educators ◽  
Evidence Based ◽  
Spiritual Experiences ◽  
Coding Scheme ◽  
Coding Schemes ◽  
Personal Interaction ◽  
Evidence Based Guidelines

AbstractThis article is a narrative inquiry of the lived spiritual experiences of students participating in Dalcroze Eurhythmics training. Previous studies have located Jaques-Dalcroze’s own writings and thought within the context of spirituality and have explored the spiritual experiences of Dalcroze teachers, but students’ perspectives remain to be investigated. We interviewed seven students, broadly defined as anyone currently attending regular Dalcroze training or who have recently attended Dalcroze courses and still consider themselves Dalcroze students. Various strategies for narrative data analysis were synthesised into our own coding scheme. Themes emerged from the data analysis: situation, continuity, personal interaction, social interaction and significant moments. The themes helped us construct a fictive conversation between the participants, using direct quotations from the interviews. Implications for practice focus on what inhibits and promotes experiences of spirituality in the Dalcroze class. This research will be relevant to music educators, as it gives clear, evidence-based guidelines on how opportunities for spirituality can be created in the Dalcroze classroom. It also offers an original synthesis of existing coding schemes for other researchers undertaking narrative inquiries.

Sign in / Sign up

Export Citation Format

Share Document