Bonn-Aachen International Center for Information Technology

  News Application for Master Programs B-IT Universities Institute
  About B-IT B-IT Research School B-IT Applied Science Institute
  Welcome!
Directors
About B-IT
Events
B-IT Annual Report
B-IT Research School
B-IT Universities Institute
News
Groups
 Life Science Informatics
 Computer Security
 Media Computing Group
 Decision and Process Support
 User Interface Engineering (UIE)
 Bioinformatics Group
 Algorithmic Bioinformatics
 Computational Structural Biology
Teaching
Life Science Informatics
Media Informatics
Application for Master Programs
International Program of Excellence (IPEC)
B-IT Applied Science Institute
Autonomous Systems
 
How to get to B-IT
City and student life
Contact
Impressum
Sitemap
Index

crypt@b-it 2007
Pascal Paillier
Security reductions for asymmetric systems

Abstract.

Provable security is a set of mathematical techniques by means of which cryptographers analyze a cryptographic system and demonstrate its security. Indeed, beside their functional properties and practical efficiency, cryptosystems must be convincingly secure in a sense that depends on their nature and mode of use. The recent formalization of security notions for cryptosystems allows one to formulate security by relating resistance to attacks to so-called intractability assumptions using polynomial reductions. Reductions provide security guarantees under current human knowledge and bounds on realistic computational capabilities. Initially of theoretical interest, reductionist security has become over the past few years an extremely popular, practical and powerful tool for both the design and evaluation of cryptographic systems.

This series of lectures explains the reductionist 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.

NEWS
Best Contribution Award for B-IT Student
[more]
Best Student Paper Award for B-IT Research School Student
[more]
B-IT Professor participates with "Silhouettes" at the EXPO 2010 Shanghai
Silhouettes: An Interactive Collaborative Gesture-Based Experience for the EXPO 2010 Shanghai [more]
Symposium in honour of Professor von zur Gathen 60th Birthday - "Professor von zur Gathen: A Modern Computer Algebraist"
International Symposium to celebrate Professor von zur Gathen's 60th Birthday [more]
B-IT Life Science Informatics Lecture Series 2010
[more]