| Preface | p. xi |
| Notation | p. xiii |
| List of abbreviations | p. xv |
| Preliminaries | p. 1 |
| An information-theoretic approach to physical-layer security | p. 3 |
| Shannon's perfect secrecy | p. 4 |
| Secure communication over noisy channels | p. 6 |
| Channel coding for secrecy | p. 7 |
| Secret-key agreement from noisy observations | p. 8 |
| Active attacks | p. 9 |
| Physical-layer security and classical cryptography | p. 10 |
| Outline of the rest of the book | p. 11 |
| Fundamentals of information theory | p. 13 |
| Mathematical tools of information theory | p. 13 |
| Useful bounds | p. 13 |
| Entropy and mutual information | p. 14 |
| Strongly typical sequences | p. 18 |
| Weakly typical sequences | p. 21 |
| Markov chains and functional dependence graphs | p. 22 |
| The point-to-point communication problem | p. 23 |
| Point-to-point communication model | p. 24 |
| The source coding theorem | p. 26 |
| The channel coding theorem | p. 29 |
| Network information theory | p. 32 |
| Distributed source coding | p. 33 |
| The multiple-access channel | p. 37 |
| The broadcast channel | p. 40 |
| Bibliographical notes | p. 44 |
| Information-theoretic security | p. 47 |
| Secrecy capacity | p. 49 |
| Shannon's cipher system | p. 49 |
| Secure communication over a noisy channel | p. 53 |
| Perfect, weak, and strong secrecy | p. 55 |
| Wyner's wiretap channel | p. 58 |
| Achievability proof for the degraded wiretap channel | p. 65 |
| Converse proof for the degraded wiretap channel | p. 76 |
| Broadcast channel with confidential messages | p. 78 |
| Channel comparison | p. 83 |
| Achievability proof for the broadcast channel with confidential messages | p. 90 |
| Converse proof for the broadcast channel with confidential messages | p. 98 |
| Multiplexing and feedback | p. 103 |
| Multiplexing secure and non-secure messages | p. 103 |
| Feedback and secrecy | p. 104 |
| Conclusions and lessons learned | p. 108 |
| Bibliographical notes | p. 110 |
| Secret-key capacity | p. 112 |
| Source and channel models for secret-key agreement | p. 113 |
| Secret-key capacity of the source model | p. 118 |
| Secret-key distillation based on wiretap codes | p. 120 |
| Secret-key distillation based on Slepian-Wolf codes | p. 121 |
| Upper bound for secret-key capacity | p. 127 |
| Alternative upper bounds for secret-key capacity | p. 129 |
| Sequential key distillation for the source model | p. 134 |
| Advantage distillation | p. 136 |
| Information reconciliation | p. 143 |
| Privacy amplification | p. 148 |
| Secret-key capacity of the channel model | p. 162 |
| Strong secrecy from weak secrecy | p. 166 |
| Conclusions and lessons learned | p. 169 |
| Appendix | p. 170 |
| Bibliographical notes | p. 174 |
| Security limits of Gaussian and wireless channels | p. 177 |
| Gaussian channels and sources | p. 177 |
| Gaussian broadcast channel with confidential messages | p. 177 |
| Multiple-input multiple-output Gaussian wiretap channel | p. 185 |
| Gaussian source model | p. 190 |
| Wireless channels | p. 193 |
| Ergodic-fading channels | p. 195 |
| Block-fading channels | p. 203 |
| Quasi-static fading channels | p. 206 |
| Conclusions and lessons learned | p. 210 |
| Bibliographical notes | p. 210 |
| Coding and system aspects | p. 213 |
| Coding for secrecy | p. 215 |
| Secrecy and capacity-achieving codes | p. 216 |
| Low-density parity-check codes | p. 217 |
| Binary linear block codes and LDPC codes | p. 217 |
| Message-passing decoding algorithm | p. 220 |
| Properties of LDPC codes under message-passing decoding | p. 222 |
| Secrecy codes for the binary erasure wiretap channel | p. 223 |
| Algebraic secrecy criterion | p. 225 |
| Coset coding with dual of LDPC codes | p. 228 |
| Degrading erasure channels | p. 229 |
| Reconciliation of binary memoryless sources | p. 231 |
| Reconciliation of general memoryless sources | p. 234 |
| Multilevel reconciliation | p. 235 |
| Multilevel reconciliation of Gaussian sources | p. 239 |
| Secure communication over wiretap channels | p. 242 |
| Bibliographical notes | p. 245 |
| System aspects | p. 247 |
| Basic security primitives | p. 248 |
| Symmetric encryption | p. 248 |
| Public-key cryptography | p. 249 |
| Hash functions | p. 250 |
| Authentication, integrity, and confidentiality | p. 251 |
| Key-reuse and authentication | p. 251 |
| Security schemes in the layered architecture | p. 253 |
| Practical case studies | p. 256 |
| Integrating physical-layer security into wireless systems | p. 260 |
| Bibliographical notes | p. 265 |
| Other applications of information-theoretic security | p. 267 |
| Secrecy and jamming in multi-user channels | p. 269 |
| Two-way Gaussian wiretap channel | p. 270 |
| Cooperative jamming | p. 275 |
| Coded cooperative jamming | p. 283 |
| Key-exchange | p. 289 |
| Bibliographical notes | p. 291 |
| Network-coding security | p. 293 |
| Fundamentals of network coding | p. 293 |
| Network-coding basics | p. 295 |
| System aspects of network coding | p. 297 |
| Practical network-coding protocols | p. 299 |
| Security vulnerabilities | p. 302 |
| Securing network coding against passive attacks | p. 303 |
| Countering Byzantine attacks | p. 306 |
| Bibliographical notes | p. 309 |
| References | p. 311 |
| Author index | p. 323 |
| Subject index | p. 326 |
| Table of Contents provided by Ingram. All Rights Reserved. |
