Article
Physics, Multidisciplinary
Manos Athanasakos, George Karagiannidis
Summary: This paper introduces a technique based on polar coding for the primitive relay wiretap channel, allowing the relay to intelligently decide whether to cooperate or not for information-theoretic security.
Article
Computer Science, Information Systems
Te Sun Han, Masahide Sasaki
Summary: The coding problem for wiretap channels with causal and/or non-causal channel state information available at the encoder and/or the decoder was studied, focusing on achievable secret-message secret-key rate pairs under the semantic security criterion. By introducing a new technique called "plugging", better results were obtained and existing achievable rate results were extended.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2021)
Article
Physics, Multidisciplinary
Daniel Harman, Karl Knapp, Tyler Sweat, Philip Lundrigan, Michael Rice, Willie Harrison
Summary: This study analyzes the potential for secure communication in a real-world scenario by using channel sounding measurements. The results show that secrecy capacity is highly affected by environmental changes.
Article
Computer Science, Information Systems
Sreejith Sreekumar, Alexander Bunin, Ziv Goldfeld, Haim H. Permuter, Shlomo Shamai
Summary: This paper investigates the information-theoretic channel coding problem with input cost constraints in the wiretap channel (WTC). It is found that, compared to the WTC without cost constraints, two auxiliary variables are required to achieve capacity in the cost-constrained DM-WTC. This highlights the essential role of superposition coding in cost-constrained WTCs.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2021)
Article
Physics, Multidisciplinary
Neri Merhav
Summary: In this study, we address the problem of encoding a deterministic source sequence for the degraded wiretap channel using finite-state machines as encoder and decoder. A necessary condition for reliable and secure transmission is presented, along with a lower bound on the smallest achievable bandwidth expansion factor. The bound is achievable through Lempel-Ziv compression and good channel coding, and a lower bound on the minimum necessary rate of purely random bits needed for security is also derived.
Article
Physics, Multidisciplinary
Rongwo Xu, Leiming Sun, Jianhua Ji, Ke Wang, Yufeng Song
Summary: The paper discusses how to quantitatively evaluate the physical layer security in fiber-optic wiretap channels. The traditional metric, secrecy capacity, can only qualitatively evaluate the security and cannot quantify the security of imperfect systems. By analyzing the information leakage rate in an optical CDMA network using wiretap code, the physical layer security can be quantitatively evaluated.
Article
Telecommunications
Saeid Pakravan, Ghosheh Abed Hodtani
Summary: Analyzing wireless communication performances using information-theoretic results is important in practice. This paper obtains achievable secrecy rate and outer bound on secrecy capacity for a discrete alphabet and memoryless wiretap channel with non-causal knowledge at the transmitter. Extending the results to a continuous alphabet wireless wiretap channel, the impact of side information on secrecy coverage region is analyzed, showing that side information increases the coverage region.
WIRELESS PERSONAL COMMUNICATIONS
(2022)
Article
Computer Science, Information Systems
Duckdong Hwang, Janghoon Yang, Kuhyung Kwon, Jingon Joung, Hyoung-Kyu Song
Summary: This paper proposes a beamforming scheme to maximize secrecy multicast rate in the presence of unauthorized users, and introduces three different algorithms to balance legitimate user channels and unauthorized user channels, ultimately improving SMR. Simulation results verify the effectiveness of the proposed approach.
Article
Computer Science, Theory & Methods
Hongliang He, Xizhao Luo, Jian Weng, Kaimin Wei
Summary: This paper proposes a novel cooperative jamming scheme to improve security in multiple access wiretap channels, where users use their own CSI to design artificial noise to eliminate eavesdroppers' ability to intercept legitimate information. The interference between users plays a key role in achieving security by ensuring that artificial noise from different users helps each other. The study considers both non-collusion and collusion scenarios of eavesdroppers, and shows that positive secrecy sum-rate can be achieved by the proposed scheme.
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
(2021)
Article
Computer Science, Information Systems
Yong Chen, Tao Zhang, Xiaoqiang Qiao, Hao Wu, Jiang Zhang
Summary: This paper investigates secure transmission in MIMO cognitive wiretap networks, proposing two antenna transmission schemes and introducing a power control mechanism to protect the quality of service for primary users. The secrecy performance of the two schemes is evaluated through the derivation of secrecy outage probability and secrecy throughput, with further exploration of security diversity gain and coding gain based on asymptotic secrecy outage probability.
Article
Engineering, Electrical & Electronic
Vidhi Rana, Remi A. Chou
Summary: We design short blocklength codes for the Gaussian wiretap channel, ensuring information-theoretic security. Our approach involves separating reliability and secrecy requirements in code design. By using an autoencoder for reliability and hash functions for secrecy, we evaluate the error probability at the legitimate receiver and the leakage at the eavesdropper through simulations. Our results show improved secrecy rates compared to existing non-constructive designs for the Gaussian wiretap channel, and suitability for compound and arbitrarily varying Gaussian wiretap channels with uncertain channel statistics.
IEEE TRANSACTIONS ON COMMUNICATIONS
(2023)
Article
Computer Science, Theory & Methods
Bin Dai, Chong Li, Yingbin Liang, Zheng Ma, Shlomo Shamai
Summary: This paper presents a feedback scheme for Gaussian multi-user wiretap channels, showing its capacity and secrecy capacity achievements. The outer bounds on secrecy capacity regions are derived, and numerical results demonstrate the rate gains from feedback.
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
(2022)
Article
Physics, Multidisciplinary
Eduard Jorswieck, Pin-Hsun Lin, Karl-Ludwig Besser
Summary: This paper investigates the dependency structures in the fading channels of a wiretap system and shows that positive zero-outage secrecy rates (ZOSR) are achievable when the legitimate and eavesdropper channels are statistically dependent. The authors consider the system parameters and channel gains to characterize these dependency structures and propose a conjecture about achieving maximum ZOSR. They also solve the zero-outage secrecy capacity (ZOSC) for channels with finite alphabets and continuous channel gains. The results suggest that the legitimate link needs to have an advantage in terms of antennas and average channel gains to obtain positive ZOSR.
Article
Computer Science, Information Systems
Yiqi Chen, Dan He, Chenhao Ying, Yuan Luo
Summary: This paper investigates the strong secrecy transmission problem of the arbitrarily varying wiretap channel (AVWC) with input and state constraints. Lower bounds for the strong secrecy capacity are established using stochastic-encoder codes. The superposition stochastic-encoder code lower bound is shown to be larger than the ordinary stochastic-encoder code lower bound. Random code lower and upper bounds for the secrecy capacity of the AVWC with constraints are also provided. The results are then further applied to the special case of severely less noisy AVWC, and the capacities of stochastic-encoder codes and random codes are given.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2022)
Article
Engineering, Electrical & Electronic
Shuai Han, Sai Xu, Wei-Xiao Meng, Lei He
Summary: This paper designs an artificial noise-aided beamformer for correlated main and wiretap channels, utilizing channel correlation to improve secrecy rate.
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
(2021)