Number of hours
- Lectures 24.0
- Projects -
- Tutorials 12.0
- Internship -
- Laboratory works 12.0
- Written tests -
ECTS
ECTS 6.0
Goal(s)
Introduction to advanced topics in cryptology
Responsible(s)
Emmanuel PEYRE, Pierre KARPMAN
Content(s)
Information-theoretical security
================================
- Secret sharing
- MDS codes and basic code-based secret-sharing
- Minimal codewords, access structures
- Perfectly-secure message transmission
- A simple example
Advanced protocols
==================
Zero-Knowledge (ZK) proofs are a fundamental building block to design advanced cryptographic schemes for privacy-related purpose. An example of such schemes, can be group signatures, which allow users to sign on behalf of a group they previously enrolled in, while keeping their identities private inside the group and finally staying accountable for the signatures they provide. We will present some constructions of ZK proofs from lattice assumptions and use them in the construction of privacy-friendly protocols along with their security proofs.
PrerequisitesSome knowledge of the following is required:
- Cryptography
- Symmetric and asymmetric primitives and their associated security definitions
- Mathematics
- Linear algebra
- Finite fields
- Computer science
- Algorithmics
Test
Evaluation : 50% of Examen écrit + TP notés and 50% of Examen Ecrit (3h00)
Resit : 50% of Examen écrit + TP notés (reported score) and 50% of Examen écrit + examen oral (N.C.)
Assessment = Written / lab / project
Final exam = Written exam (3h)
Re take = we keep the assessment grade + Written and/or exam session 2
The exam is given in english only
Calendar
The course exists in the following branches:
- Curriculum - Master in Computer Science - Semester 9 (this course is given in english only)
- Curriculum - Master in Applied Mathematics - Semester 9 (this course is given in english only)
Additional Information
Course ID : WMM9SY07
Course language(s): 
You can find this course among all other courses.