Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Secure Multiparty Computation and Secret Sharing
2015285 citationsRonald Cramer, Ivan Damgård et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Ronald Cramer'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 Ronald Cramer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ronald Cramer more than expected).
This network shows the impact of papers produced by Ronald Cramer. 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 Ronald Cramer. The network helps show where Ronald Cramer may publish in the future.
Co-authorship network of co-authors of Ronald Cramer
This figure shows the co-authorship network connecting the top 25 collaborators of Ronald Cramer.
A scholar is included among the top collaborators of Ronald Cramer 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 Ronald Cramer. Ronald Cramer is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Cascudo, Ignacio, et al.. (2015). Squares of Random Linear Codes. IEEE Transactions on Information Theory. 61(3). 1159–1173.27 indexed citations
4.
Cascudo, Ignacio, Ronald Cramer, & Chaoping Xing. (2012). Bounds on the Threshold Gap in Secret Sharing and its Applications. IACR Cryptology ePrint Archive.3 indexed citations
5.
Cramer, Ronald. (2008). Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography.1 indexed citations
6.
Catalano, Dario, Ronald Cramer, Ivan Damgård, et al.. (2005). Contemporary Cryptology (Advanced Courses in Mathematics - CRM Barcelona).6 indexed citations
7.
Cramer, Ronald. (2005). Advances in Cryptology - EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, ... (Lecture Notes in Computer Science). Springer eBooks.2 indexed citations
Cramer, Ronald & Torben Pryds Pedersen. (1995). Efficient and provable security amplifications. Data Archiving and Networked Services (DANS). 1–9.
14.
Cramer, Ronald, Matthew Franklin, Berry Schoenmakers, & Moti Yung. (1995). Multi-authority secret-ballot elections with linear work. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 9571. 1–12.3 indexed citations
Bosselaers, Antoon, Ronald Cramer, Stig F. Mjølsnes, et al.. (1994). The ESPRIT project CAFE - High security digital payment systems. Lecture notes in computer science. 875. 217–230.4 indexed citations
17.
Cramer, Ronald & Torben Pryds Pedersen. (1994). Improved Privacy in Wallets with Observers (Extended Abstract).3 indexed citations
18.
Cramer, Ronald, et al.. (1994). Proofs of partial knowledge and simplified design of witness hiding protocols. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 8(2). 1–127.32 indexed citations
19.
Cramer, Ronald, et al.. (1986). Language: Skills And Use. Medical Entomology and Zoology.1 indexed citations
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.