Eric R. Verheul

According to our database1, Eric R. Verheul authored at least 29 papers between 1997 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
SECDSA: Mobile signing and authentication under classical "sole control".
IACR Cryptol. ePrint Arch., 2021

2019
IFAL: Issue First Activate Later Certificates for V2X.
Proceedings of the IEEE European Symposium on Security and Privacy, 2019

2017
An efficient self-blindable attribute-based credential scheme.
IACR Cryptol. ePrint Arch., 2017

Remote Document Encryption - encrypting data for e-passport holders.
CoRR, 2017

2016
Activate Later Certificates for V2X - Combining ITS efficiency with privacy.
IACR Cryptol. ePrint Arch., 2016

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

Polymorphic Encryption and Pseudonymisation for Personalised Healthcare.
IACR Cryptol. ePrint Arch., 2016

The Self-blindable U-Prove Scheme from FC'14 Is Forgeable (Short Paper).
Proceedings of the Financial Cryptography and Data Security, 2016

2015
The self-blindable U-Prove scheme by Hanzlik and Kluczniak is forgeable.
IACR Cryptol. ePrint Arch., 2015

Privacy protection in electronic education based on polymorphic pseudonymization.
IACR Cryptol. ePrint Arch., 2015

2013
Cell-based privacy-friendly roadpricing.
Comput. Math. Appl., 2013

2011
Best Effort and Practice Activation Codes.
Proceedings of the Trust, Privacy and Security in Digital Business, 2011

Cell-Based Roadpricing.
Proceedings of the Public Key Infrastructures, Services and Applications, 2011

2008
An Analysis of the Vector Decomposition Problem.
Proceedings of the Public Key Cryptography, 2008

The security of mass transport ticketing systems.
Proceedings of the ISSE 2008, 2008

2007
Selecting Secure Passwords.
Proceedings of the Topics in Cryptology, 2007

2004
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems.
J. Cryptol., 2004

2002
Looking beyond XTR.
Proceedings of the Advances in Cryptology, 2002

2001
Selecting Cryptographic Key Sizes.
J. Cryptol., 2001

Fast Irreducibility and Subgroup Membership Testing in XTR.
Proceedings of the Public Key Cryptography, 2001

Self-Blindable Credential Certificates from the Weil Pairing.
Proceedings of the Advances in Cryptology, 2001

2000
Certificates of Recoverability with Scale Recovery Agent Security.
Proceedings of the Public Key Cryptography, 2000

The XTR Public Key System.
Proceedings of the Advances in Cryptology, 2000

Key Improvements to XTR.
Proceedings of the Advances in Cryptology, 2000

1999
Doing More with Fewer Bits.
Proceedings of the Advances in Cryptology, 1999

1997
Constructions and Properties of k out of n Visual Secret Sharing Schemes.
Des. Codes Cryptogr., 1997

Binding cryptography - A fraud-detectible alternative to Key-Escrow proposals.
Comput. Law Secur. Rev., 1997

Cryptanalysis of 'Less Short' RSA Secret Exponents.
Appl. Algebra Eng. Commun. Comput., 1997

Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals.
Proceedings of the Advances in Cryptology, 1997


  Loading...