Information Theoretic Security

From Information-Theoretic Primitives to Algorithms
Slides PDF

Quick guide to viewing the slides:

  • To go full screen, press ‘F’
  • To view the side menu, press ‘M’
  • To export the presentation as a PDF file, press ‘E’ while watching the presentation. This will reformat the presentation to make it easily printable or exportable as a PDF. This is best done with Chrome, although it seems to work with Firefox and Safari.
  • To view handwritten proofs, press ‘B’ to visualize the board

Abstract: While the foundations of information-theoretic security can be traced back to the works of Shannon (1949), Wyner (1975), Maurer (1993), Ahslwede and Csiszár (1993), the past decade of research on the topic has enabled conceptual simplifications and generalizations, spanning both information and coding theory. This three-part tutorial will leverage these recent advances to provide a modern perspective on the topic. In the first part, we will develop four information-theoretic primitives that will prove central to the study of information theoretic security. In the second part, we will introduce canonical information-theoretic security models and combine information-theoretic primitives to establish their capacity. In the last part, we will show how to translate the insights from information-theory to actual codes and algorithms with manageable complexity.