Seminar by Sanjit Chatterjee
On Cryptographic Protocols Employing Asymmetric Bilinear Pairings
Sanjit Chatterjee
Department of Combinatorics & Optimization, University of Waterloo
Date: Thursday, January 7, 2010
Time: 10:00 AM
Venue: CS102.
Abstract:
Bilinear pairing has turned out to be an extremely useful instrument in the cryptographer's toolbox. Many cryptographic primitives are realized for the first time using such a pairing. Ingenious applications include novel solution to the problem of identity-based encryption, three-party key agreement and short signatures to name a few. A bilinear pairing is usually defined over an elliptic curve group and may take different forms depending upon the underlying mathematical structure. In this talk we take a close look at the functionality, efficiency and security aspects of some well-known cryptographic protocols that are implemented in the setting of asymmetric bilinear pairing.