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.
Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation
2014414 citationsDavid M. Cash, Joseph Jaeger 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 Hugo Krawczyk'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 Hugo Krawczyk with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hugo Krawczyk more than expected).
This network shows the impact of papers produced by Hugo Krawczyk. 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 Hugo Krawczyk. The network helps show where Hugo Krawczyk may publish in the future.
Co-authorship network of co-authors of Hugo Krawczyk
This figure shows the co-authorship network connecting the top 25 collaborators of Hugo Krawczyk.
A scholar is included among the top collaborators of Hugo Krawczyk 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 Hugo Krawczyk. Hugo Krawczyk is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Cash, David M., Joseph Jaeger, Stanisław Jarecki, et al.. (2014). Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation.414 indexed citations breakdown →
6.
Barak, Boaz, et al.. (2011). 残余ハッシュ補助定理(Leftover Hash Lemma)の再考. Lecture notes in computer science. 6841. 1–20.2 indexed citations
Gennaro, Rosario, Stanisław Jarecki, Hugo Krawczyk, & Tal Rabin. (2001). Robust Threshold DSS Signatures. Information and Computation. 164(1). 54–84.76 indexed citations
12.
Gennaro, Rosario, Tal Rabin, & Hugo Krawczyk. (2000). RSA-Based Undeniable Signatures. Journal of Cryptology. 13(4). 397–416.32 indexed citations
13.
Halevi, Shai, et al.. (1999). UMAC: Fast and Secure Message Authentication.1 indexed citations
14.
Bellare, Mihir, Juan A. Garay, Ralf Hauser, et al.. (1999). Design, Implementation and Deployment of a Secure Account-Based Electronic Payment System.2 indexed citations
15.
Peng, Cheng, Juan A. Garay, Amir Herzberg, & Hugo Krawczyk. (1999). Security architecture for the internet protocol. Computer Standards & Interfaces. 20(6-7). 409–409.145 indexed citations
16.
Krawczyk, Hugo, Ran Canetti, & Pau-Chen Cheng. (1997). A revised encryption mode for ISAKMP/Oakley.1 indexed citations
Cheng, Pau-Chen, Juan A. Garay, Amir Herzberg, & Hugo Krawczyk. (1995). Design and implementation of modular key management protocol and IP secure tunnel on AIX. USENIX Security Symposium. 5–5.12 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.