CSE530: Information Security ODD 26-27

Lecture 1 - 24 Jul - Introduction to Information Security & Probability - Slides1 Slides2

Lecture 2 - 28 Jul - Conditional Probability - Slides (Sections 2,8,9)

Lectures 3-5 - 4, 5 & 7 Aug - Historical Ciphers - Slides (Chapter 1 [KL])

Lecture 6 - 11 Aug - Definition of Perfect Secrecy & Dissucssion on perfect secrecy of historical ciphers - Slides (Chapter 2 [KL])

Lecture 7 - 12 Aug - Perfectly secure encryption Slides 

Discussion on perfect secrecy of Substitution and Vigenere Ciphers Slides 

Lecture 8 - 14 Aug - Perfect Secrecy and Drawbacks - Slides (Chapter 2 [KL])

Lecture 9 - 1 Sep - Negligible functions - Slides (Chapter 3.1 [KL])

Lecture 10 -  2 Sep - Computation Security - Slides (Chapter 3.2 [KL])

Lecture 12&13 - 5 Sep -  Pseudorandom Generators - Slides (3.3 [KL]) 

Various PRG Candidates were discussed on board

Lecture 14 - 8 Sep -  Encryption using PRGs - Slides (3.4 [KL])

Lecture 15 - 9 Sep -  CPA security - Slides (3.5 [KL]) PRFs and CPA secure Encryption from PRFs - Slides (3.6 [KL])

Lecture 16 - 11 Sep -  CPA security - Slides (3.5 [KL]) PRFs and CPA secure Encryption from PRFs - Slides (3.6 [KL])

Lectures 17&18 - 12 Sep - Detailed discussion on PRFs and PRGs. Slides are same as Lec16. Auxiliary pdf (Updated on 18 Sep)

Lecture 19 - 15 Sep - Analysis of different CPA encryption Candidates. (Ref: Auxiliary Pdf) 

Lecture 20 - 16 Sep - Discussion on multiple encryption security of any CPA secure encryption (Ref: Claim 3.23 [KL])

Lecture 21 - 18 Sep - Doubts clarification and revision of requested topics 

Midsem in the week of 21st Sep

Lecture 22 - 29 Sep - Modes of operation (Ref: 3.6.4[KL]) Message Authentication - Slides (4.2)

Lecture 23 - 30 Sep - MAC from PRF (4.3.1[KL])

Lecture 24 -6 Oct - Discussion of Various MAC candidates on board 

Lecture 25 - 7 Oct - Domain extension of MAC (slides of lec 19-23 in single pdf) (4.3.2[KL])

Lecture 26 - 7(2) Oct - Discussion on midsem

Lecture 27 -  13 Oct - Information-theoretic Message Authentication - Slides 

                                   Replay attacks and CCA security Slides (3.7.1, 4.5 [KL])

                                   CCA secure encryption scheme Slides  (3.7.1, 4.5 [KL])

Lecture 28 - 14 Oct - Diffie Hellman Key Exchange Slides (Lec28-30)  (8.3.2, 10.3 [KL])

Lecture 29 - 16(1) Oct - Basics of Number Theory (8.1 (upto 8.1.4) , 8.3.1 [KL])

Lecture 30 - 16(2) Oct - Public-key Encryption, RSA Encryption, Padded RSA, Elgamal Encryption Schemes Slides(Lec 30-31)  (11.1 (upto 11.1.1), 8.2.3, 8.2.4, 11.5.1, 11.5.2, 11.4.1)

Lecture 31 - 16(3) Oct - Digital Signatures (12.2, 12.4 [KL])

Lecture 32 - 23 Oct - Privacy: Secret sharing Scheme (n,n): Definitions (taught on board!)

Lecture 33 - 27 Oct - Field arithmetic & Secret sharing schemes (2,3) & (3,4) (taught on board!)

Lecture 34 - 28 Oct - Replicated Secret Sharing Scheme (taught on board!)

Lecture 35 - 30 Oct -Shamir secret Sharing Scheme, Lagrange polynomials, (taught on board!)  

Lecture 36 - 3 Nov - Privacy preserving multi-party computation (Secure Addition & multiplication protocols(BGW))

Lecture 37 - 4 Nov - Contd

Lecture 38 - 6 Nov - Contd

Lecture 39 - 6(2) Nov - Doubts Clarification and revision of any requested topics

Reference Text: 

• [KL] Introduction to modern Cryptography by Jonathan Katz and Yehuda Lindell. Second Edition 

Few more references will be updated as and when required.  

Teaching Assistants: 

Gaje Sathwik: gajesathwik.rs.cse24@itbhu.ac.in 

Anuradha Mall: anuradhamall.rs.cse24@itbhu.ac.in