| 2013 | ||
|---|---|---|
| j6 | Flavio D. Garcia, Eric R. Verheul, Bart Jacobs: Cell-based privacy-friendly roadpricing. Computers & Mathematics with Applications 65(5): 774-785 (2013) | |
| 2011 | ||
| c15 | ||
| c14 | Gerhard de Koning Gans, Eric R. Verheul: Best Effort and Practice Activation Codes. TrustBus 2011: 98-112 | |
| i1 | Gerhard de Koning Gans, Eric R. Verheul: Best Effort and Practice Activation Codes. CoRR abs/1101.0698 (2011) | |
| 2008 | ||
| c13 | Marc Sel, Stefaan Seys, Eric R. Verheul: The security of mass transport ticketing systems. ISSE 2008: 347-356 | |
| c12 | Steven D. Galbraith, Eric R. Verheul: An Analysis of the Vector Decomposition Problem. Public Key Cryptography 2008: 308-327 | |
| 2007 | ||
| c11 | ||
| 2004 | ||
| j5 | Eric R. Verheul: Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems. J. Cryptology 17(4): 277-296 (2004) | |
| 2002 | ||
| c10 | ||
| 2001 | ||
| j4 | Arjen K. Lenstra, Eric R. Verheul: Selecting Cryptographic Key Sizes. J. Cryptology 14(4): 255-293 (2001) | |
| c9 | Eric R. Verheul: Self-Blindable Credential Certificates from the Weil Pairing. ASIACRYPT 2001: 533-551 | |
| c8 | Eric R. Verheul: Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems. EUROCRYPT 2001: 195-210 | |
| c7 | Arjen K. Lenstra, Eric R. Verheul: Fast Irreducibility and Subgroup Membership Testing in XTR. Public Key Cryptography 2001: 73-86 | |
| 2000 | ||
| j3 | Arjen K. Lenstra, Eric R. Verheul: Selecting Cryptographic Key Sizes. Datenschutz und Datensicherheit 24(3) (2000) | |
| c6 | ||
| c5 | ||
| c4 | Eric R. Verheul: Certificates of Recoverability with Scale Recovery Agent Security. Public Key Cryptography 2000: 258-275 | |
| c3 | Arjen K. Lenstra, Eric R. Verheul: Selecting Cryptographic Key Sizes. Public Key Cryptography 2000: 446-465 | |
| 1999 | ||
| c2 | Andries E. Brouwer, Ruud Pellikaan, Eric R. Verheul: Doing More with Fewer Bits. ASIACRYPT 1999: 321-332 | |
| 1997 | ||
| j2 | 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) | |
| j1 | 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) | |
| c1 | Eric R. Verheul, Henk C. A. van Tilborg: Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals. EUROCRYPT 1997: 119-133 | |
Colors in the list of coauthors
Last update Wed May 22 12:24:57 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page