Semantic-Security Capacity for the Physical Layer via Information Theory

被引:3
作者
Goldfeld, Ziv [1 ]
Cuff, Paul [2 ]
Permuter, Haim H. [1 ]
机构
[1] Ben Gurion Univ Negev, Beer Sheva, Israel
[2] Princeton Univ, Princeton, NJ 08544 USA
来源
2016 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE SCIENCE, TECHNOLOGY AND ENGINEERING (SWSTE 2016) | 2016年
关键词
Erasure wiretap channel; information theoretic security; physical-layer security; semantic-security; soft-covering lemma; wiretap channel of type II; wiretap codes; WIRE-TAP CHANNEL; CODES; ENCRYPTION;
D O I
10.1109/SWSTE.2016.12
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Physical layer security can ensure secure communication over noisy channels in the presence of an eavesdropper with unlimited computational power. We adopt an information theoretic variant of semantic-security (SS) (a cryptographic gold standard), as our secrecy metric and study the open problem of the type II wiretap channel (WTC II) with a noisy main channel is, whose secrecy-capacity is unknown even under looser metrics than SS. Herein the secrecy-capacity is derived and shown to be equal to its SS capacity. In this setting, the legitimate users communicate via a discrete-memoryless (DM) channel in the presence of an eavesdropper that has perfect access to a subset of its choosing of the transmitted symbols, constrained to a fixed fraction of the blocklength. The secrecy criterion is achieved simultaneously for all possible eavesdropper subset choices. On top of that, SS requires negligible mutual information between the message and the eavesdropper's observations even when maximized over all message distributions. A key tool for the achievability proof is a novel and stronger version of Wyner's soft covering lemma. Specifically, the lemma shows that a random codebook achieves the soft-covering phenomenon with high probability. The probability of failure is doubly-exponentially small in the blocklength. Since the combined number of messages and subsets grows only exponentially with the blocklength, SS for the WTC II is established by using the union bound and invoking the stronger soft-covering lemma. The direct proof shows that rates up to the weak-secrecy capacity of the classic WTC with a DM erasure channel (EC) to the eavesdropper are achievable. The converse follows by establishing the capacity of this DM wiretap EC as an upper bound for the WTC II. From a broader perspective, the stronger soft-covering lemma constitutes a tool for showing the existence of codebooks that satisfy exponentially many constraints, a beneficial ability for many other applications in information theoretic security.
引用
收藏
页码:17 / 27
页数:11
相关论文
共 26 条
[1]  
Aggarwal V., 2009, P INT S INF THEOR IS
[2]   A concrete security treatment of symmetric encryption [J].
Bellare, M ;
Desai, A ;
Jokipii, E ;
Rogaway, P .
38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, :394-403
[3]  
Bellare M., 2012, 2012022 CRYPT EPRINT
[4]  
Bellare M, 2012, P ADV CRYPT CRYPTO 2
[5]   Strong Secrecy From Channel Resolvability [J].
Bloch, Matthieu R. ;
Laneman, J. Nicholas .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (12) :8077-8098
[6]  
Cover TM., 1991, ELEMENTS INFORM THEO, V1, P279
[7]  
CSISZAR I, 1978, IEEE T INFORM THEORY, V24, P339, DOI 10.1109/TIT.1978.1055892
[8]   Distributed Channel Synthesis [J].
Cuff, Paul .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (11) :7071-7096
[9]  
Goldfeld Z., 2015, IEEE T INF THE UNPUB
[10]   PROBABILISTIC ENCRYPTION [J].
GOLDWASSER, S ;
MICALI, S .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1984, 28 (02) :270-299