|
" Physical-layer security : "
Matthieu Bloch & Joao Barros.
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
106084
|
| Doc. No
|
:
|
b63633
|
| Main Entry
|
:
|
Bloch, Matthieu,1981-
|
| Title & Author
|
:
|
Physical-layer security : : from information theory to security engineering /\ Matthieu Bloch Joao Barros.
|
| Publication Statement
|
:
|
Cambridge, UK ;New York :: Cambridge University Press,, 2011.
|
| Page. NO
|
:
|
xii, 329 p. :: ill., charts ;; 26 cm.
|
| ISBN
|
:
|
9780521516501 (hardback)
|
|
|
:
|
: 0521516501 (hardback)
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references and index.
|
| Contents
|
:
|
pt. I Preliminaries -- 1.An information-theoretic approach to physical-layer security -- 1.1.Shannon's perfect secrecy -- 1.2.Secure communication over noisy channels -- 1.3.Channel coding for secrecy -- 1.4.Secret-key agreement from noisy observations -- 1.5.Active attacks -- 1.6.Physical-layer security and classical cryptography -- 1.7.Outline of the rest of the book -- 2.Fundamentals of information theory -- 2.1.Mathematical tools of information theory -- 2.1.1.Useful bounds -- 2.1.2.Entropy and mutual information -- 2.1.3.Strongly typical sequences -- 2.1.4.Weakly typical sequences -- 2.1.5.Markov chains and functional dependence graphs -- 2.2.The point-to-point communication problem -- 2.2.1.Point-to-point communication model -- 2.2.2.The source coding theorem -- 2.2.3.The channel coding theorem -- 2.3.Network information theory -- 2.3.1.Distributed source coding -- 2.3.2.The multiple-access channel -- 2.3.3.The broadcast channel -- 2.4.Bibliographical notes -- pt. II Information-theoretic security -- 3.Secrecy capacity -- 3.1.Shannon's cipher system -- 3.2.Secure communication over a noisy channel -- 3.3.Perfect, weak, and strong secrecy -- 3.4.Wyner's wiretap channel -- 3.4.1.Achievability proof for the degraded wiretap channel -- 3.4.2.Converse proof for the degraded wiretap channel -- 3.5.Broadcast channel with confidential messages -- 3.5.1.Channel comparison -- 3.5.2.Achievability proof for the broadcast channel with confidential messages -- 3.5.3.Converse proof for the broadcast channel with confidential messages -- 3.6.Multiplexing and feedback -- 3.6.1.Multiplexing secure and non-secure messages -- 3.6.2.Feedback and secrecy -- 3.7.Conclusions and lessons learned -- 3.8.Bibliographical notes -- 4.Secret-key capacity -- 4.1.Source and channel models for secret-key agreement -- 4.2.Secret-key capacity of the source model -- 4.2.1.Secret-key distillation based on wiretap codes -- 4.2.2.Secret-key distillation based on Slepian--Wolf codes -- 4.2.3.Upper bound for secret-key capacity -- 4.2.4.Alternative upper bounds for secret-key capacity -- 4.3.Sequential key distillation for the source model -- 4.3.1.Advantage distillation -- 4.3.2.Information reconciliation -- 4.3.3.Privacy amplification -- 4.4.Secret-key capacity of the channel model -- 4.5.Strong secrecy from weak secrecy -- 4.6.Conclusions and lessons learned -- 4.7.Appendix -- 4.8.Bibliographical notes -- 5.Security limits of Gaussian and wireless channels -- 5.1.Gaussian channels and sources -- 5.1.1.Gaussian broadcast channel with confidential messages -- 5.1.2.Multiple-input multiple-output Gaussian wiretap channel -- 5.1.3.Gaussian source model -- 5.2.Wireless channels -- 5.2.1.Ergodic-fading channels -- 5.2.2.Block-fading channels -- 5.2.3.Quasi-static fading channels -- 5.3.Conclusions and lessons learned -- 5.4.Bibliographical notes -- pt. III Coding and system aspects -- 6.Coding for secrecy -- 6.1.Secrecy and capacity-achieving codes -- 6.2.Low-density parity-check codes -- 6.2.1.Binary linear block codes and LDPC codes -- 6.2.2.Message-passing decoding algorithm -- 6.2.3.Properties of LDPC codes under message-passing decoding -- 6.3.Secrecy codes for the binary erasure wiretap channel -- 6.3.1.Algebraic secrecy criterion -- 6.3.2.Coset coding with dual of LDPC codes -- 6.3.3.Degrading erasure channels -- 6.4.Reconciliation of binary memoryless sources -- 6.5.Reconciliation of general memoryless sources -- 6.5.1.Multilevel reconciliation -- 6.5.2.Multilevel reconciliation of Gaussian sources -- 6.6.Secure communication over wiretap channels -- 6.7.Bibliographical notes -- 7.System aspects -- 7.1.Basic security primitives -- 7.1.1.Symmetric encryption -- 7.1.2.Public-key cryptography -- 7.1.3.Hash functions -- 7.1.4.Authentication, integrity, and confidentiality -- 7.1.5.Key-reuse and authentication -- 7.2.Security schemes in the layered architecture -- 7.3.Practical case studies -- 7.4.Integrating physical-layer security into wireless systems -- 7.5.Bibliographical notes -- pt. IV Other applications of information-theoretic security -- 8.Secrecy and jamming in multi-user channels -- 8.1.Two-way Gaussian wiretap channel -- 8.2.Cooperative jamming -- 8.3.Coded cooperative jamming -- 8.4.Key-exchange -- 8.5.Bibliographical notes -- 9.Network-coding security -- 9.1.Fundamentals of network coding -- 9.2.Network-coding basics -- 9.3.System aspects of network coding -- 9.4.Practical network-coding protocols -- 9.5.Security vulnerabilities -- 9.6.Securing network coding against passive attacks -- 9.7.Countering Byzantine attacks -- 9.8.Bibliographical notes.
|
| Subject
|
:
|
Computer networks-- Security measures.
|
| Subject
|
:
|
Computer security.
|
| Subject
|
:
|
OSI-Modell.
|
| Subject
|
:
|
Physikalische Schicht.
|
| Dewey Classification
|
:
|
005.8
|
| LC Classification
|
:
|
TK5105.59.B574 2011
|
| Added Entry
|
:
|
Barros, Joao.
|
| |