From Bilinear to Multilinear Pairing-based Cryptography

Speaker:	Professor Ming-Deh HUANG
		Computer Science Department
		University of Southern California

Title: 		"From Bilinear to Multilinear Pairing-based Cryptography"

Date:		Wednesday, June 17, 2009

Time:		11:00am -12 noon

Venue: 		Room 2404 (via lifts 17/18), HKUST

Abstract:

Elliptic curve cryptosystems are a new generation of discrete-log based
cryptosystems, where the role of the multiplicative group over a finite
field in a classical discrete-log based system is replaced by the group of
rational points of an elliptic curve over a finite field. While the
deployment of such systems is gaining speed and popularity, an equally
interesting development is pairing-based cryptography, where bilinear
pairings on elliptic curves -- the Weil and Tate pairings -- are applied
as a powerful tool in solving cryptographic problems. Multilinear
extensions of these pairings will broaden the scope of pairing-based
cryptography even more, with many interesting consequences. We will
discuss the prospect and challenges of such extensions.


********************************
Biography:

Ming-Deh HUANG (BA in EECS, 1978, National Taiwan University, Ph.D. in CS,
1984, Princeton University) is a Professor of Computer Science Department
at the University of Southern California. His research interests are
primarily in computational complexity, algorithmic number theory, and
cryptography.  He is an associate editor of JCSS and has served on the
programming committees of STOC, COCOON and ANTS (which he initiated with
Len Adleman in 1994).