New Tools in Cryptography
Date and Time
Monday, November 25, 2002 - 4:00pm to 5:30pm
Computer Science Small Auditorium (Room 105)
Dan Boneh, from Stanford
Over the past three years we have seen a number of exciting new cryptographic constructions based on certain bilinear maps. In this talk we will survey some of these new constructions and their applications. For example, bilinear maps give rise to a new digital signature scheme with remarkable properties: it enables aggregation of many signatures which can be used to reduce communication in secure routing protocols and shrink certificate chains. Bilinear maps have also been used to construct the first practical public key encryption scheme where public keys can be arbitrary strings. In this talk we will survey some of the cryptographic applications of bilinear maps and describe several open problems in this area. The talk will be self contained.