Curriculum M1 MPRI at ENS Paris-Saclay

APSA: AProximation and String Algorithms

Description: This advanced algorithms course aims to introduce students to the fundamentals of string algorithms, approximation algorithms, and linear programming. The concepts covered include the design of efficient algorithms for classic problems and approximation problems, as well as applications of linear programming techniques.

Outline:

  1. Process algebra and security properties.
  2. . Symbolic model of cryptography (Dolev-Yao).
  3. Locality and decidability of symbolic attacker deduction.
  4. Deducibility constraints and decidability of security for a bounded number of sessions.
  5. Computational model and proofs by reduction.


References:

  • Véronique Cortier et Steve Kremer. Formal Models and Techniques for Analyzing Security Protocols : A Tutorial. Foundations and Trends® in Programming Languages 3. Know Publishers, sept. 2014
  • Dan Boneh et Victor Shoup. A graduate course in applied cryptography
  • Web site of instructors ...