default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric R. Verheul
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i9]Eric R. Verheul:
SECDSA: Mobile signing and authentication under classical "sole control". IACR Cryptol. ePrint Arch. 2021: 910 (2021)
2010 – 2019
- 2019
- [c18]Eric R. Verheul, Christopher Hicks, Flavio D. Garcia:
IFAL: Issue First Activate Later Certificates for V2X. EuroS&P 2019: 279-293 - 2017
- [c17]Sietse Ringers, Eric R. Verheul, Jaap-Henk Hoepman:
An Efficient Self-blindable Attribute-Based Credential Scheme. Financial Cryptography 2017: 3-20 - [i8]Eric R. Verheul:
Remote Document Encryption - encrypting data for e-passport holders. CoRR abs/1704.05647 (2017) - [i7]Sietse Ringers, Eric R. Verheul, Jaap-Henk Hoepman:
An efficient self-blindable attribute-based credential scheme. IACR Cryptol. ePrint Arch. 2017: 115 (2017) - 2016
- [c16]Eric R. Verheul, Sietse Ringers, Jaap-Henk Hoepman:
The Self-blindable U-Prove Scheme from FC'14 Is Forgeable (Short Paper). Financial Cryptography 2016: 339-345 - [i6]Eric R. Verheul:
Practical backward unlinkable revocation in FIDO, German e-ID, Idemix and U-Prove. IACR Cryptol. ePrint Arch. 2016: 217 (2016) - [i5]Eric R. Verheul, Bart Jacobs, Carlo Meijer, Mireille Hildebrandt, Joeri de Ruiter:
Polymorphic Encryption and Pseudonymisation for Personalised Healthcare. IACR Cryptol. ePrint Arch. 2016: 411 (2016) - [i4]Eric R. Verheul:
Activate Later Certificates for V2X - Combining ITS efficiency with privacy. IACR Cryptol. ePrint Arch. 2016: 1158 (2016) - 2015
- [i3]Eric R. Verheul, Sietse Ringers, Jaap-Henk Hoepman:
The self-blindable U-Prove scheme by Hanzlik and Kluczniak is forgeable. IACR Cryptol. ePrint Arch. 2015: 725 (2015) - [i2]Eric R. Verheul:
Privacy protection in electronic education based on polymorphic pseudonymization. IACR Cryptol. ePrint Arch. 2015: 1228 (2015) - 2013
- [j7]Flavio D. Garcia, Eric R. Verheul, Bart Jacobs:
Cell-based privacy-friendly roadpricing. Comput. Math. Appl. 65(5): 774-785 (2013) - 2011
- [c15]Flavio D. Garcia, Eric R. Verheul, Bart Jacobs:
Cell-Based Roadpricing. EuroPKI 2011: 106-122 - [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)
2000 – 2009
- 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]Eric R. Verheul:
Selecting Secure Passwords. CT-RSA 2007: 49-66 - 2004
- [j6]Eric R. Verheul:
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems. J. Cryptol. 17(4): 277-296 (2004) - 2002
- [c10]Wieb Bosma, James Hutton, Eric R. Verheul:
Looking beyond XTR. ASIACRYPT 2002: 46-63 - 2001
- [j5]Arjen K. Lenstra, Eric R. Verheul:
Selecting Cryptographic Key Sizes. J. Cryptol. 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
- [j4]Arjen K. Lenstra, Eric R. Verheul:
Selecting Cryptographic Key Sizes. Datenschutz und Datensicherheit 24(3) (2000) - [c6]Arjen K. Lenstra, Eric R. Verheul:
Key Improvements to XTR. ASIACRYPT 2000: 220-233 - [c5]Arjen K. Lenstra, Eric R. Verheul:
The XTR Public Key System. CRYPTO 2000: 1-19 - [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
1990 – 1999
- 1999
- [c2]Andries E. Brouwer, Ruud Pellikaan, Eric R. Verheul:
Doing More with Fewer Bits. ASIACRYPT 1999: 321-332 - 1997
- [j3]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) - [j2]Eric R. Verheul, Bert-Jaap Koops, Henk van Tilborg:
Binding cryptography - A fraud-detectible alternative to Key-Escrow proposals. Comput. Law Secur. Rev. 13(1): 3-14 (1997) - [j1]Eric R. Verheul, Henk C. A. van Tilborg:
Constructions and Properties of k out of n Visual Secret Sharing Schemes. Des. Codes Cryptogr. 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
