Parisian Master of Research in Computer Science
Master Parisien de Recherche en Informatique (MPRI)

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

cours:c-2-12-1 [2019/12/16 22:25]
abdalla [Preliminary schedule for 2019-2020]
cours:c-2-12-1 [2020/01/31 10:48] (current)
abdalla [Notes]
Line 34: Line 34:
 |21/01  |Michel Abdalla| |21/01  |Michel Abdalla|
 |28/01  |Michel Abdalla| |28/01  |Michel Abdalla|
-|04/02  |Michel Abdalla|+|04/02  |Michel Abdalla| double class: **16h15-19h15** |
 |11/02  |**No Class**| |11/02  |**No Class**|
-|18/02  |Michel Abdalla|+|18/02  |Michel Abdalla| double class: **16h15-19h15** |
  
-|**25/02**  |Michel Abdalla+|**25/02**  |**Exam**
-|**03/03**  |**Exam**|+|**03/03**  |**No Class**|
  
-The Final Exam will take place on Tuesday, 3 March 2020, from 16h15 to 17h45 in the usual room. +The Final Exam will take place on Tuesday, 25 February 2020, from 16h15 to 17h45 in the usual room.
 ==== Summary ==== ==== Summary ====
 The main objective of the course is to introduce students to cryptographic schemes built using the *provable-security* paradigm and to cryptanalytic techniques.  Throughout the construction part of the course,  The main objective of the course is to introduce students to cryptographic schemes built using the *provable-security* paradigm and to cryptanalytic techniques.  Throughout the construction part of the course, 
Line 99: Line 99:
 Notes 1: http://www.di.ens.fr/~mabdalla/coursedocs/provablesecurity.pdf Notes 1: http://www.di.ens.fr/~mabdalla/coursedocs/provablesecurity.pdf
  
-Notes 2: References for the Naor-Reingold PRF[[http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=646134|Original paper]],  [[https://eprint.iacr.org/eprint-bin/getfile.pl?entry=2010/397&version=20100715:022021&file=397.pdf|Game-based proof]] (see Appendix A)+Notes 2: Reference for the Goldreich-Levin Theorem: http://www-cse.ucsd.edu/users/mihir/papers/gl.pdf
  
-Notes 3: Reference for the CHK transform: https://eprint.iacr.org/2003/182.pdf (see Sections 1---3)+Notes 3: References for the Naor-Reingold PRF[[http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=646134|Original paper]],  [[https://eprint.iacr.org/eprint-bin/getfile.pl?entry=2010/397&version=20100715:022021&file=397.pdf|Game-based proof]] (see Appendix A)
  
-Notes 4: Reference for the BBG scheme: https://eprint.iacr.org/2005/015.pdf (see Pages 5---8)+Notes 4: Reference for the CHK transform: https://eprint.iacr.org/2003/182.pdf (see Sections 1---3) 
 + 
 +Notes 5: Reference for the BBG scheme: https://eprint.iacr.org/2005/015.pdf (see Pages 5---8) 
 + 
 +Notes 6: Lecture Notes on the Complexity of Some Problems in Number Theory: https://people.csail.mit.edu/vinodv/6892-Fall2013/Angluin.pdf
  
 Slides on identity-based encryption: http://www.di.ens.fr/~mabdalla/coursedocs/IBE.pdf Slides on identity-based encryption: http://www.di.ens.fr/~mabdalla/coursedocs/IBE.pdf
 
Universités partenaires Université Paris-Diderot
Université Paris-Saclay
ENS Cachan École polytechnique Télécom ParisTech
ENS
Établissements associés Université Pierre-et-Marie-Curie CNRS INRIA CEA