2008 |
17 | EE | Steven D. Galbraith,
Eric R. Verheul:
An Analysis of the Vector Decomposition Problem.
Public Key Cryptography 2008: 308-327 |
2007 |
16 | EE | Eric R. Verheul:
Selecting Secure Passwords.
CT-RSA 2007: 49-66 |
2004 |
15 | EE | Eric R. Verheul:
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems.
J. Cryptology 17(4): 277-296 (2004) |
2002 |
14 | EE | Wieb Bosma,
James Hutton,
Eric R. Verheul:
Looking beyond XTR.
ASIACRYPT 2002: 46-63 |
2001 |
13 | EE | Eric R. Verheul:
Self-Blindable Credential Certificates from the Weil Pairing.
ASIACRYPT 2001: 533-551 |
12 | EE | Eric R. Verheul:
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems.
EUROCRYPT 2001: 195-210 |
11 | EE | Arjen K. Lenstra,
Eric R. Verheul:
Fast Irreducibility and Subgroup Membership Testing in XTR.
Public Key Cryptography 2001: 73-86 |
10 | EE | Arjen K. Lenstra,
Eric R. Verheul:
Selecting Cryptographic Key Sizes.
J. Cryptology 14(4): 255-293 (2001) |
2000 |
9 | EE | Arjen K. Lenstra,
Eric R. Verheul:
Key Improvements to XTR.
ASIACRYPT 2000: 220-233 |
8 | EE | Arjen K. Lenstra,
Eric R. Verheul:
The XTR Public Key System.
CRYPTO 2000: 1-19 |
7 | | Eric R. Verheul:
Certificates of Recoverability with Scale Recovery Agent Security.
Public Key Cryptography 2000: 258-275 |
6 | | Arjen K. Lenstra,
Eric R. Verheul:
Selecting Cryptographic Key Sizes.
Public Key Cryptography 2000: 446-465 |
5 | | Arjen K. Lenstra,
Eric R. Verheul:
Selecting Cryptographic Key Sizes.
Datenschutz und Datensicherheit 24(3): (2000) |
1999 |
4 | | Andries E. Brouwer,
Ruud Pellikaan,
Eric R. Verheul:
Doing More with Fewer Bits.
ASIACRYPT 1999: 321-332 |
1997 |
3 | EE | Eric R. Verheul,
Henk C. A. van Tilborg:
Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals.
EUROCRYPT 1997: 119-133 |
2 | EE | Eric R. Verheul,
Henk C. A. van Tilborg:
Cryptanalysis of `Less Short' RSA Secret Exponents.
Appl. Algebra Eng. Commun. Comput. 8(5): 425-435 (1997) |
1 | | Eric R. Verheul,
Henk C. A. van Tilborg:
Constructions and Properties of k out of n Visual Secret Sharing Schemes.
Des. Codes Cryptography 11(2): 179-196 (1997) |