Easy decisions: applications of pairings in cryptography

    One of the most exciting new areas of elliptic curve
    cryptography is the use of the Weil and Tate pairings
    to construct cryptosystems.  This talk will describe
    some of these applications.  In particular, we discuss
    how pairings make some decision Diffie-Hellman problems 
    easy.  The talk will also present some new results
    about "distortion maps".