The CrySP Group is a part of the Deparment of Computer Science and Automation at Indian Institute of Science.
Our group contributes to various projects of national importance and collaborates closely with the industry. One such collboration resulted in the creation of Online Lecture for Discrete Mathematics.
These lectures are a part of Microsoft's Massively Empowered Classroms initiative.
Our research is funded, in part, through generous research grants received from Department of Science and Technology and Department of Information Technology.
E0248: Theoretical Foundations of Cryptography, Fall 2017
Instructor: Dr.Bhavana Kanukurthi
9:30 - 11 Monday, Wednesday
Lecture 1 (07/8/17): Introduction to Cryptography
Lecture 2 (09/8/17): Limitations of Information-theoretic Cryptography [Section 1.3 of Pass-shelat]
Lecture 3 (14/8/17): Perfect Secrecy [Contd.], Computational hardness and One-way Functions [Sections 2.1-2.2 of Pass-shelat]
Lecture 4 (16/8/17): One-way functions (contd.)
Lecture 5 (21/8/2017) One-way functions continued. [In this lecture and the previous lecture, we proved several lemmas regarding one-way functions. Two of these appear in Problem Set 2 [Problems 1 and 2].]
Lecture 6 (23/8/2017) Hardness Amplification. [We covered Section 2.4.3 of Pass-shelat. Reading the rest of Section 2.4 is recommended.]
Lecture 7 (28/8/2017) Hardness Amplification contd. Introduced Pseudo-randomness and computational indistinguishability.
Lecture 8 (30/8/2017) [Covered by OSL Bhavana] Collection of One-way Functions.[Sections 2.5-2.7,2.9 of Pass-shelat]
Lecture 9 (4/9/2017) [Covered by Sruthi Sekar] Basic probability theory overview.
Lecture 10 (6/9/2017) Computational Indistinguishability and Pseudo-randomness. [Pointers to lecture notes will be put up after next class.
Lecture 11 (11/9/2017) Hard-core predicates and Pseudorandomness definitions (next-bit unpredictability and computational indistinguishability) [See Lec 12 handout and reading list]
Lecture 12 (13/9/2017) Intro to Hybrid arguments via equivalence of PRG definitions. [Slides based on Leo Reyzin's Lecture Notes; Suggested reading: Reyzin's notes for Lec#2 and Lec#3]
Class cancelled on 18/9/2017
Lecture 13 (20/8/2017) Recap of Lec 12/PRG with one-bit stretch/Secure Encryption [Pass-shelat Sections 3.3.1-3.3.4, 3.5 - 3.7]
Lecture 14 (25/8/2017) Expansion of a PRG [Pass-shelat: Section 3.3.5]
Foundations of Cryptography, Volume I-II , Oded Goldreich
Introduction to Modern Cryptography by Jonathan Katz and Yehuda Lindell
by Leonid Reyzin
by Rafail Pass and Abhi Shelat
Draft Lecture notes
by Rafail Ostrovsky
Due on Monday, August 28th, 5:00PM
Due on Friday, September 15th, 5:00PM
Assignment 2 is up!!
A joint IISc-MSR reading group on Secure Computation is currently (Spring 2017) taking place. Please find below a tentative list of research papers to be presented and the corresponding speakers. Reading material will be provided here as and when required. Venue of the talk will be updated before the talk. Please feel to drop by if interested in any of the talks!
||Completeness theorems for non-cryptographic fault-tolerant distributed computation [BGW88]
|| 2pm - 4pm, 6/1/17
3pm- 5pm, 13/1/17
| Full proof of BGW [pdf]
||Multiparty unconditionally secure protocols [CCD88]
|| Preliminaries of MPC and Yao's Garbled circuits
|| Divya Ravi
|| 10am-12pm, 27/1/17
|| [2 , Chapter 3]
|| How to play any mental game [GMW87]
|| Pratik Sarkar
| 10am-12pm, 3/2/17
| [4, Lecture 9-10]
Foundations of Cryptography,
Vol 2, Chapter 7
|| The round complexity of secure protocols [BMR90]
|| OSL Bhavana
| 10am-12pm, 24/2/17
| Rogaway's thesis
|| A Zero-One Law for Boolean Privacy [CK89]
| 10am-12pm, 10/3/17
|| Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator [DI05]
|| Rohith Chatterjee
| 10am-12pm, 17/3/17
1. Secure Multiparty Computation and Secret Sharing - An Information Theoretic Appoach
by Ronald Cramer, Ivan Damgaard and Jesper Buus Nielsen. Cambridge Press.
2. Efficient Secure Two-party Protocols- Techniques and Constructions
by Carmit Hazay and Yehuda Lindell.
Additional reading material for some of the research papers can be found on
3. Introduction to Secure computation
course by Dr.Jonathan Katz
course by Dr.Arpita Patra