Workshop II:

Provable Security of Cryptograhpic Protocols
C. Pandu Rangan
Speaker: C Pandu Rangan
Abstract:
One of the main objectives of cryptography is to enable a secjure communication between parties in an insecure environment. The initial days of the cryptology was rid with unscientific methods and adhoc approaches. Such improperly designed system were broken subsequently. This raised a fundamental question on formalising the notion of security. In this tutorial, starting from Shenons notion od perfect security, we trace the evolution of this area and discuss in detail the refinements of notions such as attack models, security goals etc and provide a formal framework todiscuss these concepts. We wil demonstrate both security proofs as well as the attacks on various encryption schemes unde various models. cryptlogy has further evolved to handle primitives such as digitl signature where authentication is a primary concern than confidentiality. real-life crypto systems have also evolved from simple two party secure communication to group cryptography where systems such as PKI based, ID-based and certificateless systems have come into existence and each of them hae thier own flavours of challenges and solutions. We will discuss the provable security of encryption and sgnature schemes under various systems mentioned above.
About the speaker:
Prof. C. Pandu Rangan completed his Ph.D. from the Indian Institute of Science, Bangalore, India. He is currently a Professor of Computer Science and Engineering at Indian Institute of Technology Madras. His areas of specialization include Theoretical Computer Science and Cryptography