Cryptography and Computer Security

Identity-based cryptography and many recent cryptographic protocols which are enabled by bilinear pairings are very interesting. They are important new developments in cryptography. Here is a set of slide presentation (co-authored with my HP colleague Keith Harrison, with the help of Dr Steven Galbraith of Mathematics Department, Royal Holloway, University of London) on the properties and efficient computations of bilinear pairings

• Divisors, Bilinear Pairings and Pairing Enabled Cryptographic Applications

The following is a book chapter I've written, which provides more explanatory descriptions on the definition and computation of bilinear pairings

• Elliptic Curves and Bilinear Pairings

This chapter will be in a new book Cryptographic Protocols which I co-author with Markus Jakobsson, to be published by Addison-Wesley in this year.

Provable Security

Working in industry, I have a strong inclination toward real-world applications of cryptography and the theory of information security. Therefore I follow closely the state of affairs of formally provable security for cryptographic systems and protocols. Here are three sets of slide presentations on these topics

• Formal Reductionist Provable Security for Public-key Cryptosystems

• Formal Reductionist Provable Security for Digital Signatures

• Formal Reductionist Provable Security for Authenticated Session-key Exchange Protocols (Key Agreement using Statically Keyed Authenticators) (Joint work with Colin Boyd and Kenny Paterson)