Eric R. Verheul

2.5k total citations
15 papers, 822 citations indexed

About

Eric R. Verheul is a scholar working on Artificial Intelligence, Information Systems and Computer Vision and Pattern Recognition. According to data from OpenAlex, Eric R. Verheul has authored 15 papers receiving a total of 822 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Artificial Intelligence, 5 papers in Information Systems and 4 papers in Computer Vision and Pattern Recognition. Recurrent topics in Eric R. Verheul's work include Cryptography and Data Security (9 papers), Coding theory and cryptography (6 papers) and Cryptography and Residue Arithmetic (4 papers). Eric R. Verheul is often cited by papers focused on Cryptography and Data Security (9 papers), Coding theory and cryptography (6 papers) and Cryptography and Residue Arithmetic (4 papers). Eric R. Verheul collaborates with scholars based in Netherlands, United States and Germany. Eric R. Verheul's co-authors include Arjen K. Lenstra, Henk C. A. van Tilborg, Flavio D. Garcia, H-J Bandelt, M. van de Vel, Bart Jacobs, Bert‐Jaap Koops and H. van Tilborg and has published in prestigious journals such as Computers & Mathematics with Applications, Lecture notes in computer science and Journal of Cryptology.

In The Last Decade

Eric R. Verheul

13 papers receiving 698 citations

Peers

Eric R. Verheul

AI

CVPR

IS

CNC

EEE

Paulo S. L. M. Barreto Brazil

Antoine Joux France

Kaisa Nyberg Finland

J.-J. Quisquater Belgium

Sung‐Ming Yen Taiwan

Serge Vaudenay Switzerland

Weidong Kou China

Atsuko Miyaji Japan

Ron Steinfeld Australia

Christof Paar Germany

Paulo S. L. M. Barreto Brazil

Eric R. Verheul

560 ×1.1

AI

271 ×0.8

CVPR

339 ×1.3

IS

329 ×1.7

CNC

110 ×0.9

EEE

Citations per year, relative to Eric R. Verheul Eric R. Verheul (= 1×) peers Paulo S. L. M. Barreto

Countries citing papers authored by Eric R. Verheul

Since Specialization

Citations

This map shows the geographic impact of Eric R. Verheul's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Eric R. Verheul with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Eric R. Verheul more than expected).

Fields of papers citing papers by Eric R. Verheul

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Eric R. Verheul. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Eric R. Verheul. The network helps show where Eric R. Verheul may publish in the future.

Co-authorship network of co-authors of Eric R. Verheul

This figure shows the co-authorship network connecting the top 25 collaborators of Eric R. Verheul. A scholar is included among the top collaborators of Eric R. Verheul based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Eric R. Verheul. Eric R. Verheul is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

15 of 15 papers shown

1.

Verheul, Eric R., et al.. (2019). IFAL: Issue First Activate Later Certificates for V2X. Data Archiving and Networked Services (DANS). 279–293. 23 indexed citations

2.

Verheul, Eric R., et al.. (2017). Polymorphic Encryption and Pseudonymisation in Identity Management and Medical Research. Radboud Repository (Radboud University). 18. 168–172. 3 indexed citations

3.

Garcia, Flavio D., Eric R. Verheul, & Bart Jacobs. (2012). Cell-based privacy-friendly roadpricing. Computers & Mathematics with Applications. 65(5). 774–785. 8 indexed citations

4.

Lenstra, Arjen K. & Eric R. Verheul. (2012). An overview of the XTR public key system. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 151–180. 3 indexed citations

5.

Garcia, Flavio D., et al.. (2012). Cell-Based Roadpricing. Lecture notes in computer science. 106–122. 2 indexed citations

6.

Verheul, Eric R.. (2004). Evidence that XTR Is More Secure than SupersingularElliptic Curve Cryptosystems. Journal of Cryptology. 17(4). 277–296. 50 indexed citations

7.

Lenstra, Arjen K. & Eric R. Verheul. (2001). Selecting Cryptographic Key Sizes. Journal of Cryptology. 14(4). 255–293. 434 indexed citations

8.

Lenstra, Arjen K. & Eric R. Verheul. (2000). Selecting Cryptographic Key Sizes.. TU/e Research Portal. 24.

9.

Verheul, Eric R. & Henk C. A. van Tilborg. (1997). A construction of a k out of n visual secret sharing scheme. Data Archiving and Networked Services (DANS). 1 indexed citations

10.

Verheul, Eric R. & Henk C. A. van Tilborg. (1997). Cryptanalysis of 'Less Short' RSA Secret Exponents. Applicable Algebra in Engineering Communication and Computing. 8(5). 425–435. 37 indexed citations

11.

Verheul, Eric R. & Henk C. A. van Tilborg. (1997). Constructions and Properties of k out of n Visual Secret Sharing Schemes. Designs Codes and Cryptography. 11(2). 179–196. 222 indexed citations

12.

Verheul, Eric R., Bert‐Jaap Koops, & H. van Tilborg. (1997). Binding cryptography — A fraud-detectible alternative to Key-Escrow proposals. Computer Law & Security Report. 13(1). 3–14. 4 indexed citations

13.

Verheul, Eric R.. (1993). Multimedians in metric and normed spaces. Data Archiving and Networked Services (DANS). 91. 1–136. 16 indexed citations

14.

Bandelt, H-J, M. van de Vel, & Eric R. Verheul. (1993). Modular Interval Spaces. Mathematische Nachrichten. 163(1). 177–201. 19 indexed citations

15.

Verheul, Eric R.. (1991). Elementary proofs concerning results about functions on the n-sphere. Topology and its Applications. 40(2). 101–116.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact