| |
| |
| Preface | |
| |
| |
| Notation | |
| |
| |
| List of abbreviations | |
| |
| |
| |
| Preliminaries | |
| |
| |
| |
| An information-theoretic approach to physical-layer security | |
| |
| |
| |
| Shannon's perfect secrecy | |
| |
| |
| |
| Secure communication over noisy channels | |
| |
| |
| |
| Channel coding for secrecy | |
| |
| |
| |
| Secret-key agreement from noisy observations | |
| |
| |
| |
| Active attacks | |
| |
| |
| |
| Physical-layer security and classical cryptography | |
| |
| |
| |
| Outline of the rest of the book | |
| |
| |
| |
| Fundamentals of information theory | |
| |
| |
| |
| Mathematical tools of information theory | |
| |
| |
| |
| Useful bounds | |
| |
| |
| |
| Entropy and mutual information | |
| |
| |
| |
| Strongly typical sequences | |
| |
| |
| |
| Weakly typical sequences | |
| |
| |
| |
| Markov chains and functional dependence graphs | |
| |
| |
| |
| The point-to-point communication problem | |
| |
| |
| |
| Point-to-point communication model | |
| |
| |
| |
| The source coding theorem | |
| |
| |
| |
| The channel coding theorem | |
| |
| |
| |
| Network information theory | |
| |
| |
| |
| Distributed source coding | |
| |
| |
| |
| The multiple-access channel | |
| |
| |
| |
| The broadcast channel | |
| |
| |
| |
| Bibliographical notes | |
| |
| |
| |
| Information-theoretic security | |
| |
| |
| |
| Secrecy capacity | |
| |
| |
| |
| Shannon's cipher system | |
| |
| |
| |
| Secure communication over a noisy channel | |
| |
| |
| |
| Perfect, weak, and strong secrecy | |
| |
| |
| |
| Wyner's wiretap channel | |
| |
| |
| |
| Achievability proof for the degraded wiretap channel | |
| |
| |
| |
| Converse proof for the degraded wiretap channel | |
| |
| |
| |
| Broadcast channel with confidential messages | |
| |
| |
| |
| Channel comparison | |
| |
| |
| |
| Achievability proof for the broadcast channel with confidential messages | |
| |
| |
| |
| Converse proof for the broadcast channel with confidential messages | |
| |
| |
| |
| Multiplexing and feedback | |
| |
| |
| |
| Multiplexing secure and non-secure messages | |
| |
| |
| |
| Feedback and secrecy | |
| |
| |
| |
| Conclusions and lessons learned | |
| |
| |
| |
| Bibliographical notes | |
| |
| |
| |
| Secret-key capacity | |
| |
| |
| |
| Source and channel models for secret-key agreement | |
| |
| |
| |
| Secret-key capacity of the source model | |
| |
| |
| |
| Secret-key distillation based on wiretap codes | |
| |
| |
| |
| Secret-key distillation based on Slepian-Wolf codes | |
| |
| |
| |
| Upper bound for secret-key capacity | |
| |
| |
| |
| Alternative upper bounds for secret-key capacity | |
| |
| |
| |
| Sequential key distillation for the source model | |
| |
| |
| |
| Advantage distillation | |
| |
| |
| |
| Information reconciliation | |
| |
| |
| |
| Privacy amplification | |
| |
| |
| |
| Secret-key capacity of the channel model | |
| |
| |
| |
| Strong secrecy from weak secrecy | |
| |
| |
| |
| Conclusions and lessons learned | |
| |
| |
| |
| Appendix | |
| |
| |
| |
| Bibliographical notes | |
| |
| |
| |
| Security limits of Gaussian and wireless channels | |
| |
| |
| |
| Gaussian channels and sources | |
| |
| |
| |
| Gaussian broadcast channel with confidential messages | |
| |
| |
| |
| Multiple-input multiple-output Gaussian wiretap channel | |
| |
| |
| |
| Gaussian source model | |
| |
| |
| |
| Wireless channels | |
| |
| |
| |
| Ergodic-fading channels | |
| |
| |
| |
| Block-fading channels | |
| |
| |
| |
| Quasi-static fading channels | |
| |
| |
| |
| Conclusions and lessons learned | |
| |
| |
| |
| Bibliographical notes | |
| |
| |
| |
| Coding and system aspects | |
| |
| |
| |
| Coding for secrecy | |
| |
| |
| |
| Secrecy and capacity-achieving codes | |
| |
| |
| |
| Low-density parity-check codes | |
| |
| |
| |
| Binary linear block codes and LDPC codes | |
| |
| |
| |
| Message-passing decoding algorithm | |
| |
| |
| |
| Properties of LDPC codes under message-passing decoding | |
| |
| |
| |
| Secrecy codes for the binary erasure wiretap channel | |
| |
| |
| |
| Algebraic secrecy criterion | |
| |
| |
| |
| Coset coding with dual of LDPC codes | |
| |
| |
| |
| Degrading erasure channels | |
| |
| |
| |
| Reconciliation of binary memoryless sources | |
| |
| |
| |
| Reconciliation of general memoryless sources | |
| |
| |
| |
| Multilevel reconciliation | |
| |
| |
| |
| Multilevel reconciliation of Gaussian sources | |
| |
| |
| |
| Secure communication over wiretap channels | |
| |
| |
| |
| Bibliographical notes | |
| |
| |
| |
| System aspects | |
| |
| |
| |
| Basic security primitives | |
| |
| |
| |
| Symmetric encryption | |
| |
| |
| |
| Public-key cryptography | |
| |
| |
| |
| Hash functions | |
| |
| |
| |
| Authentication, integrity, and confidentiality | |
| |
| |
| |
| Key-reuse and authentication | |
| |
| |
| |
| Security schemes in the layered architecture | |
| |
| |
| |
| Practical case studies | |
| |
| |
| |
| Integrating physical-layer security into wireless systems | |
| |
| |
| |
| Bibliographical notes | |
| |
| |
| |
| Other applications of information-theoretic security | |
| |
| |
| |
| Secrecy and jamming in multi-user channels | |
| |
| |
| |
| Two-way Gaussian wiretap channel | |
| |
| |
| |
| Cooperative jamming | |
| |
| |
| |
| Coded cooperative jamming | |
| |
| |
| |
| Key-exchange | |
| |
| |
| |
| Bibliographical notes | |
| |
| |
| |
| Network-coding security | |
| |
| |
| |
| Fundamentals of network coding | |
| |
| |
| |
| Network-coding basics | |
| |
| |
| |
| System aspects of network coding | |
| |
| |
| |
| Practical network-coding protocols | |
| |
| |
| |
| Security vulnerabilities | |
| |
| |
| |
| Securing network coding against passive attacks | |
| |
| |
| |
| Countering Byzantine attacks | |
| |
| |
| |
| Bibliographical notes | |
| |
| |
| References | |
| |
| |
| Author index | |
| |
| |
| Subject index | |