| 1 | 2002 | Crypto | pc |
| year | title | booktitle | pages | |
|---|---|---|---|---|
| 1 | 2008 | An Analysis of the Vector Decomposition Problem | pkc | 308-327 |
| 2 | 2004 | Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems | jofc | 277-296 |
| 3 | 2002 | Looking beyond XTR | asiacrypt | online |
| 4 | 2001 | Self-Blindable Credential Certificates from the Weil Pairing | asiacrypt | 533-551 |
| 5 | 2001 | Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems | eurocrypt | 195-210 |
| 6 | 2001 | Fast Irreducibility and Subgroup Membership Testing in XTR | pkc | 73-86 |
| 7 | 2001 | Selecting Cryptographic Key Sizes | jofc | 255-293 |
| 8 | 2000 | The XTR Public Key System | crypto | 1-19 |
| 9 | 2000 | Key Improvements to XTR | asiacrypt | 220-233 |
| 10 | 2000 | Selecting Cryptographic Key Sizes | pkc | 446-465 |
| 11 | 2000 | Certificates of Recoverability with Scale Recovery Agent Security | pkc | 258-275 |
| 12 | 1999 | Doing More with Fewer Bits | asiacrypt | 321-332 |
| 13 | 1997 | Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals | eurocrypt | 119-133 |
Coauthors of Eric R. Verheul |