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.
Provable data possession at untrusted stores
20071.6k citationsGiuseppe Ateniese, Randal Burns et al.IRIS Research product catalog (Sapienza University of Rome)profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Zachary Peterson
Since
Specialization
Citations
This map shows the geographic impact of Zachary Peterson'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 Zachary Peterson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Zachary Peterson more than expected).
Fields of papers citing papers by Zachary Peterson
This network shows the impact of papers produced by Zachary Peterson. 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 Zachary Peterson. The network helps show where Zachary Peterson may publish in the future.
Co-authorship network of co-authors of Zachary Peterson
This figure shows the co-authorship network connecting the top 25 collaborators of Zachary Peterson.
A scholar is included among the top collaborators of Zachary Peterson 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 Zachary Peterson. Zachary Peterson 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.
Peterson, Zachary, et al.. (2018). Introducing privacy to undergraduate computing students. Journal of computing sciences in colleges. 33(4). 157–164.1 indexed citations
2.
Peterson, Zachary, et al.. (2018). Authenticity, Ethicality, and Motivation: A Formal Evaluation of a 10-week Computer Security Alternate Reality Game for {CS} Undergraduates. USENIX Security Symposium.4 indexed citations
Gondree, Mark, et al.. (2016). Talking about Talking about Cybersecurity Games.. Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School). 41.6 indexed citations
Gondree, Mark, et al.. (2015). This is not a game: early observations on using alternate reality games for teaching security concepts to first-year undergraduates. Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School). 1–1.17 indexed citations
7.
Gondree, Mark & Zachary Peterson. (2013). Valuing Security by Getting [d0x3d!] Experiences with a network security board game. Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School).14 indexed citations
Ateniese, Giuseppe, Randal Burns, Reza Curtmola, et al.. (2011). Remote data checking using provable data possession. ACM Transactions on Information and System Security. 14(1). 1–34.239 indexed citations
Peterson, Zachary, et al.. (2007). Design and implementation of verifiable audit trails for a versioning file system. IRIS Research product catalog (Sapienza University of Rome). 20–20.21 indexed citations
14.
Ateniese, Giuseppe, Randal Burns, Reza Curtmola, et al.. (2007). Provable data possession at untrusted stores. IRIS Research product catalog (Sapienza University of Rome). 598–609.1625 indexed citations breakdown →
Peterson, Zachary, et al.. (2002). Intra-file Security for a Distributed File System.3 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.