Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Cambridge ; : Cambridge University Press,
    UID:
    almafu_9960119141402883
    Format: 1 online resource (xii, 329 pages) : , digital, PDF file(s).
    ISBN: 1-316-08727-1 , 1-283-31630-7 , 9786613316301 , 1-139-12231-2 , 1-139-11657-6 , 1-139-12723-3 , 1-139-11221-X , 0-511-97798-0 , 1-139-11440-9
    Content: This complete guide to physical-layer security presents the theoretical foundations, practical implementation, challenges and benefits of a groundbreaking new model for secure communication. Using a bottom-up approach from the link level all the way to end-to-end architectures, it provides essential practical tools that enable graduate students, industry professionals and researchers to build more secure systems by exploiting the noise inherent to communications channels. The book begins with a self-contained explanation of the information-theoretic limits of secure communications at the physical layer. It then goes on to develop practical coding schemes, building on the theoretical insights and enabling readers to understand the challenges and opportunities related to the design of physical layer security schemes. Finally, applications to multi-user communications and network coding are also included.
    Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , Cover; Title; Copyright; Dedication; Contents; Preface; Notation; Abbreviations; Part 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; 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 sequences2.1.5 Markov chains and functional dependence graphs; 2.2 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; Part 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 channel3.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 , 4.2 Secret-key capacity of the source model4.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 channels5.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; Part 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 , English
    Additional Edition: ISBN 1-139-11874-9
    Additional Edition: ISBN 0-521-51650-1
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages