Surveys the research dating back to the 1970s which forms the basis of applying this technique in modern communication systems. It provides an overview of how information theoretic approaches are developed to achieve secrecy for a basic wire-tap channel model and for its extensions to multiuser networks.

Learn how information theoretic approaches can inform the design of more secure information systems and networks with this expert guide. Covering theoretical models, analytical results, and the state of the art in research, it will be of interest to researchers, graduate students, and practitioners working in communications engineering.

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.

Nigel Smartâ¬"s Cryptography provides the rigorous detail required for advanced cryptographic studies, yet approaches the subject matter in an accessible style in order to gently guide new students through difficult mathematical topics.

Information Theory: Coding Theorems for Discrete Memoryless Systems presents mathematical models that involve independent random variables with finite range. This three-chapter text specifically describes the characteristic phenomena of information theory. Chapter 1 deals with information measures in simple coding problems, with emphasis on some formal properties of Shannon's information and the non-block source coding. Chapter 2 describes the properties and practical aspects of the two-terminal systems. This chapter also examines the noisy channel coding problem, the computation of channel capacity, and the arbitrarily varying channels. Chapter 3 looks into the theory and practicality of multi-terminal systems. This book is intended primarily for graduate students and research workers in mathematics, electrical engineering, and computer science.

This book covers key concepts of cryptography, from encryption and digital signatures to cryptographic protocols, presenting techniques and protocols for key exchange, user ID, electronic elections and digital cash. Advanced topics include bit security of one-way functions and computationally perfect pseudorandom bit generators. Assuming no special background in mathematics, it includes chapter-ending exercises and the necessary algebra, number theory and probability theory in the appendix. This edition offers new material including a complete description of the AES, a section on cryptographic hash functions, new material on random oracle proofs, and a new section on public-key encryption schemes that are provably secure against adaptively-chosen-ciphertext attacks.

This book constitutes the proceedings of the Third International Conference on Information Theoretic Security, held in Calgary, Canada, in August 2008. The 14 papers presented in this volume were carefully reviewed and selected from 43 submissions. There were nine invited speeches to the conference. The topics covered are secure and reliable communication; quantum information and communication; networks and devices; multiparty computation; information hiding and tracing; coding theory and security; quantum computation; foundation; and encryption.

Hash functions are the cryptographer’s Swiss Army knife. Even though they play an integral part in today’s cryptography, existing textbooks discuss hash functions only in passing and instead often put an emphasis on other primitives like encryption schemes. In this book the authors take a different approach and place hash functions at the center. The result is not only an introduction to the theory of hash functions and the random oracle model but a comprehensive introduction to modern cryptography. After motivating their unique approach, in the first chapter the authors introduce the concepts from computability theory, probability theory, information theory, complexity theory, and information-theoretic security that are required to understand the book content. In Part I they introduce the foundations of hash functions and modern cryptography. They cover a number of schemes, concepts, and proof techniques, including computational security, one-way functions, pseudorandomness and pseudorandom functions, game-based proofs, message authentication codes, encryption schemes, signature schemes, and collision-resistant (hash) functions. In Part II the authors explain the random oracle model, proof techniques used with random oracles, random oracle constructions, and examples of real-world random oracle schemes. They also address the limitations of random oracles and the random oracle controversy, the fact that uninstantiable schemes exist which are provably secure in the random oracle model but which become insecure with any real-world hash function. Finally in Part III the authors focus on constructions of hash functions. This includes a treatment of iterative hash functions and generic attacks against hash functions, constructions of hash functions based on block ciphers and number-theoretic assumptions, a discussion of privately keyed hash functions including a full security proof for HMAC, and a presentation of real-world hash functions. The text is supported with exercises, notes, references, and pointers to further reading, and it is a suitable textbook for undergraduate and graduate students, and researchers of cryptology and information security.

This book constitutes the thoroughly refereed post-conference proceedings of the 4th International Conference on Information Theoretic Security, held in Shizuoka, Japan, in December 2009. The 13 revised full papers presented together with 6 invited lectures were carefully reviewed and selected from 50 submissions. The papers are organized in topical sections on leakage resilient cryptography, quantum cryptography and indistinguishability, connection to computational security, secret sharing, key agreement from common randomness, random graph and group testing, reliable data transmission and computation, as well as fingerprint and watermarking.

This book constitutes the refereed proceedings of the 5th International Conference on Information Theoretic Security, held in Amsterdam, The Netherlands, in May 2011. The 12 revised full papers presented together with 7 invited lectures were carefully reviewed and selected from 27 submissions. Understanding the minimal requirements for information-theoretic security is a central part of this line of research. Very attractive is the mathematical neatness of the field, and its rich connections to other areas of mathematics, like probability and information theory, algebra, combinatorics, coding theory, and quantum information processing, just to mention the most prominent ones.