Bonn-Aachen International Center for Information Technology

  News Application for Master Programmes B-IT Universities Institute
  About B-IT B-IT Research School B-IT Applied Science Institute
  Welcome!
Directors
About B-IT
Lecture Series, Talks and 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
 Bioinformatics Group
 Algorithmic Bioinformatics
 Computational Structural Biology
Teaching
IT Services
Master Programme of Life Science Informatics
Master Programme of Media Informatics
Application for Master Programmes
International Program of Excellence (IPEC)
B-IT Applied Science Institute
Master Programme of 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
Media Computing Group Acquires Funding For Interactive Surface Research
[more]
Professor Kaisa Nyberg for talk at B-IT
Professor Kaisa Nyberg, Aalto University Finnland, will deliver a talk on 20 January 2012 at 12.00 noon in B-IT lecture hall. [more]
B-IT Media Informatics Students Receives Internship at NII Tokyo
[more]
"Young Scientist Award" 2011 to Steffen Kirchhoff
[more]
Best Poster Award to B-IT Alumna
[more]