Login
Talks & Seminars
An efficient, provably secure Digital signature scheme
Prof. C. Pandu Rangan, I.I.T. Madras (Currently Visiting Professor at I.I.T. Bombay)
Date & Time: January 27, 2016 17:15
Venue: F. C. Kohli Auditorium, 1st floor, Department of Computer Science and Engineering, Kanwal Rekhi (KReSIT) Building
Abstract:
Digital signatures are among fundamental primitives of cryptology. Much like signatures on papers, digital signatures too have signing and verification mechanisms but unforgeability is a key challenge for the designers of signature schemes. Formally proving that a scheme is unforgeable is very subtle. several techniques have evolved in the past few years. The reduction technique is a powerful tool to formally establish the security properties of a crypto system. For signature schemes, the reduction must be "tight" as there is a close relation between the size of the parameters used in the implementation and the complexity of reduction. This talk presents a novel signature scheme that enjoys a tight reduction and this allows us to use even smaller parameter values to achieve higher degree of security. Besides, our scheme is quite useful in designing aggregate schemes and ID based schemes.
Speaker Profile:
Prof. C. Pandu Rangan has been teaching courses on algorithms, cryptography, and Discrete mathematics for the past 33 years at IIT, madras, CSE dept. He has coauthored over 200 research articles with over 174 students of IIT( Btech,Mtech, MS, DD, PhD} and 20+ interns who visited IIT, Madras for research experience. Nowadays, he does some academics whenever his grand children , Viyan and Adhya, allow him to do!!
List of Talks

Webmail

Username:
Password:
Faculty CSE IT
Forgot Password
    [+] Sitemap     Feedback