Views
Course:
The provable security of asymmetric privacy and authenticity:
definitions, design methodologies, proof techniques and related issues
Speaker: Dr. Pascal Paillier (Gemplus, France)
Document Actions
Provable security is a set of mathematical techniques by the means of which cryptographers analyze a practical cryptographic system and possibly make the demonstration of its quality. Indeed, beside their properties and sometimes their efficiency, cryptosystems are expected to be secure in a certain sense depending on their nature and mode of use. Formalizing security notions for cryptosystems allows one to assess security by relating resistance to attacks to so-called intractability assumptions, thereby providing a guarantee of trust under current human knowledge and computational capabilities. Initially of theoretical interest, provable security has become over the past few years a popular and powerful tool for both the design and evaluation of cryptographic systems.
This series of lectures explains the provable security approach with a focus on privacy (encryption) and authenticity (signature) in the public-key setting. The scope of this course extends from foundations of encryption and signature schemes to proof methodologies (with an emphasis on the random oracle model) for existing constructions and research issues related to improving current reduction techniques. The course is therefore suitable for undergraduate and graduate students in computer science with minimal or basic knowledge in cryptography.
- Registration Information
- Note that registration is free. However in order to plan drinks etc, a confirmation of attendance is requested (email or by phone). Those requesting accomodation can contact the organiser directly.
- What
- Course
- When
-
2005-08-24 14:30
to
2005-08-26 16:30
- Where
- Dunn 108 (24-25) and room Dunn 106 (26)
- Contact Name
- Dr. Francesco Sica
- Contact Email
- fsica@mta.ca
- Contact Phone
- +1-506-364-2171
SAC 2008 -- Workshop on Selected Areas in Cryptography
