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.
How to time-stamp a digital document
1991720 citationsStuart Haber et al.Journal of Cryptologyprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Stuart Haber'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 Stuart Haber with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stuart Haber more than expected).
This network shows the impact of papers produced by Stuart Haber. 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 Stuart Haber. The network helps show where Stuart Haber may publish in the future.
Co-authorship network of co-authors of Stuart Haber
This figure shows the co-authorship network connecting the top 25 collaborators of Stuart Haber.
A scholar is included among the top collaborators of Stuart Haber 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 Stuart Haber. Stuart Haber is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Haber, Stuart, et al.. (2017). Improved Security for Non-Volatile Main Memory.3 indexed citations
2.
Awad, Amro, Pratyusa K. Manadhata, Stuart Haber, Yan Solihin, & William Horne. (2016). Silent Shredder. ACM SIGARCH Computer Architecture News. 44(2). 263–276.7 indexed citations
3.
Awad, Amro, Pratyusa K. Manadhata, Stuart Haber, Yan Solihin, & William Horne. (2016). Silent Shredder. ACM SIGPLAN Notices. 51(4). 263–276.8 indexed citations
4.
Awad, Amro, Pratyusa K. Manadhata, Stuart Haber, Yan Solihin, & William Horne. (2016). Silent Shredder. 263–276.61 indexed citations
5.
Awad, Amro, Pratyusa K. Manadhata, Stuart Haber, Yan Solihin, & William Horne. (2016). Silent Shredder. ACM SIGOPS Operating Systems Review. 50(2). 263–276.7 indexed citations
6.
Haber, Stuart, et al.. (2008). A content integrity service for digital repositories.
7.
Haber, Stuart. (2006). A Content Integrity Service For Long-Term Digital Archives.12 indexed citations
8.
Haber, Stuart, William Horne, Tomas Sander, & Danfeng Yao. (2006). Privacy-Preserving Verification of Aggregate Queries on Outsourced Databases.3 indexed citations
Alspector, J., et al.. (1991). A VLSI-efficient technique for generating multiple uncorrelated noise sources and its application to stochastic neural networks. 38. 109–123.
16.
Haber, Stuart, et al.. (1991). How to time-stamp a digital document. Journal of Cryptology. 3(2). 99–111.720 indexed citations breakdown →
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.