Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals. - Eric R. Verheul; Henk C. A. van Tilborg (EUROCRYPT, 1997)

Cryptanalysis of 'Less Short' RSA Secret Exponents. - Eric R. Verheul; Henk C. A. van Tilborg (Appl. Algebra Eng. Commun. Comput., 1997)

Binding cryptography - A fraud-detectible alternative to Key-Escrow proposals. - Eric R. Verheul; Bert-Jaap Koops; Henk van Tilborg (Comput. Law Secur. Rev., 1997)

Constructions and Properties of k out of n Visual Secret Sharing Schemes. - Eric R. Verheul; Henk C. A. van Tilborg (Des. Codes Cryptogr., 1997)

Doing More with Fewer Bits. - Andries E. Brouwer; Ruud Pellikaan; Eric R. Verheul (ASIACRYPT, 1999)

Key Improvements to XTR. - Arjen K. Lenstra; Eric R. Verheul (ASIACRYPT, 2000)

The XTR Public Key System. - Arjen K. Lenstra; Eric R. Verheul (CRYPTO, 2000)

Certificates of Recoverability with Scale Recovery Agent Security. - Eric R. Verheul (Public Key Cryptography, 2000)

Self-Blindable Credential Certificates from the Weil Pairing. - Eric R. Verheul (ASIACRYPT, 2001)

Fast Irreducibility and Subgroup Membership Testing in XTR. - Arjen K. Lenstra; Eric R. Verheul (Public Key Cryptography, 2001)

Selecting Cryptographic Key Sizes. - Arjen K. Lenstra; Eric R. Verheul (J. Cryptol., 2001)

Looking beyond XTR. - Wieb Bosma; James Hutton; Eric R. Verheul (ASIACRYPT, 2002)

Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems. - Eric R. Verheul (J. Cryptol., 2004)

Selecting Secure Passwords. - Eric R. Verheul (CT-RSA, 2007)

The security of mass transport ticketing systems. - Marc Sel; Stefaan Seys; Eric R. Verheul (ISSE, 2008)

An Analysis of the Vector Decomposition Problem. - Steven D. Galbraith; Eric R. Verheul (Public Key Cryptography, 2008)

Cell-Based Roadpricing. - Flavio D. Garcia; Eric R. Verheul; Bart Jacobs 001 (EuroPKI, 2011)

Best Effort and Practice Activation Codes. - Gerhard de Koning Gans; Eric R. Verheul (TrustBus, 2011)

Cell-based privacy-friendly roadpricing. - Flavio D. Garcia; Eric R. Verheul; Bart Jacobs 001 (Comput. Math. Appl., 2013)

Privacy protection in electronic education based on polymorphic pseudonymization. - Eric R. Verheul (IACR Cryptol. ePrint Arch., 2015)

The self-blindable U-Prove scheme by Hanzlik and Kluczniak is forgeable. - Eric R. Verheul; Sietse Ringers; Jaap-Henk Hoepman (IACR Cryptol. ePrint Arch., 2015)

The Self-blindable U-Prove Scheme from FC'14 Is Forgeable (Short Paper). - Eric R. Verheul; Sietse Ringers; Jaap-Henk Hoepman (Financial Cryptography, 2016)

Polymorphic Encryption and Pseudonymisation for Personalised Healthcare. - Eric R. Verheul; Bart Jacobs 001; Carlo Meijer; Mireille Hildebrandt; Joeri de Ruiter (IACR Cryptol. ePrint Arch., 2016)

Practical backward unlinkable revocation in FIDO, German e-ID, Idemix and U-Prove. - Eric R. Verheul (IACR Cryptol. ePrint Arch., 2016)

Activate Later Certificates for V2X - Combining ITS efficiency with privacy. - Eric R. Verheul (IACR Cryptol. ePrint Arch., 2016)

Remote Document Encryption - encrypting data for e-passport holders. - Eric R. Verheul (CoRR, 2017)

An efficient self-blindable attribute-based credential scheme. - Sietse Ringers; Eric R. Verheul; Jaap-Henk Hoepman (IACR Cryptol. ePrint Arch., 2017)

IFAL: Issue First Activate Later Certificates for V2X. - Eric R. Verheul; Christopher Hicks; Flavio D. Garcia (EuroS&P, 2019)

SECDSA: Mobile signing and authentication under classical "sole control". - Eric R. Verheul (IACR Cryptol. ePrint Arch., 2021)

Attestation Proof of Association - provability that attestation keys are bound to the same hardware and person. - Eric R. Verheul (IACR Cryptol. ePrint Arch., 2024)