Accès direct au contenu

Direct Access to menu

logo N&B

Security Models : Protocols and Certification - Grenoble INP - Ensimag

Print page Français
Search
 
 

Membre de la CDEFI


Security Models : Protocols and Certification

ECTS credits : 6.0
 
Hours
Lecture : 39.75
Tutorial : 21.75
 
Objectives

The course presents the theoretical and practical models and tools used to assess and to caracterise the security of a cryptosystem, a protocol or an effective information system.


Contact Jean-Louis ROCH
Content

The course is divided in three parts:

  • Security proofs [12 lectures, Prof: Jean-Louis Roch]: foundations of provable security in relation with complexity
    1. Introduction: computationally, provably, unconditionally secure; Attack models; Probabilities
    2. Entropy and perfect secret/unconditional secure cryptosystem
    3. Provably secure cryptosystem - One-way functions. Polynomial reductions
    4. One-way hash function
    5. Pseudo-random generators
    6. Probabilistic algorithm - Interactive proofs
    7. Zero-knowledge protocols
  • Models for Security [12 lectures, Prof: Pascal Lafourcade]: foundations of semantic security,
    1. Indistinguishability
    2. Public Encryption
    3. Symmetric encryption
    4. Protocol Symbolic model and computational model
    5. Non-interference
    6. Access control and security policies
  • Security politics and audit [4 lectures, Prof: Florent Autreau]: methods and tools to assess and characterize security, availability
    and performance for Information System.
    1. Concepts
    2. Threats, risks.
    3. Methods and Standards
    4. Tools
    5. Hand-on labs


Prerequisites

Basic knowledge (master-1st year level) in probabilities, algorithms and complexity, operating systems; arithmetic and basic cryptography protocols.

Further information
This course is given in english only EN
Curriculum->M2 SCCI.->Semester 5
Bibliography

Cf webpage of the course;
[1] The handbook of applied cryptography", by Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone; online: http://www.cacr.math.uwaterloo.ca/hac/index.html
[2] The Foundations of Cryptography (vol 1 and 2) by Oded Goldreich. http://www.wisdom.weizmann.ac.il/~oded/foc.html
[3] 'Security Engineering, 2nd ed', Ross Anderson - http://www.cl.cam.ac.uk/~rja14/book.html

Assessment
The exam may be taken in french or in english FR EN

Session1
E1 - final examination: 1 written exam (3h);
TP: practical work: 1;
CC: continuous controls: 2 written controls (30' each). The mark obtained to the continuous control is taken into account only if larger than the mark of the final examination.
Session2
(under decision of the jury): E2: 1 final examination in session2: oral (30') if <=5 students; written (1h) if >= 6 students.



S1=20%TP+65E1+15%Max(E1,CC);
S2=20%TP+65E2+15%Max(E2,CC)

Version française
 
 
 
École nationale supérieure d'informatique et de mathématiques appliquées
681, rue de la passerelle - Domaine universitaire - BP 72 - 38402 SAINT MARTIN D'HERES Copyright Grenoble INP