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.
The Knowledge Complexity of Interactive Proof Systems
19891.3k citationsShafi Goldwasser, Silvio Micali et al.SIAM Journal on Computingprofile →
Author Peers
Peers are selected by citation overlap in the author's most active subfields.
citations ·
hero ref
Countries citing papers authored by Charles Rackoff
Since
Specialization
Citations
This map shows the geographic impact of Charles Rackoff'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 Charles Rackoff with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Charles Rackoff more than expected).
This network shows the impact of papers produced by Charles Rackoff. 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 Charles Rackoff. The network helps show where Charles Rackoff may publish in the future.
Co-authorship network of co-authors of Charles Rackoff
This figure shows the co-authorship network connecting the top 25 collaborators of Charles Rackoff.
A scholar is included among the top collaborators of Charles Rackoff 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 Charles Rackoff. Charles Rackoff 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.
Rackoff, Charles, et al.. (2012). How powerful are the DDH hard groups. IACR Cryptology ePrint Archive. 19. 167.1 indexed citations
Ostrovsky, Rafail, Charles Rackoff, & Adam Smith. (2003). Efficient Consistency Proofs on a Committed Database. DSpace@MIT (Massachusetts Institute of Technology).4 indexed citations
8.
Borodin, Allan, Morten Nielsen, & Charles Rackoff. (2002). Incremental) priority algorithms. Symposium on Discrete Algorithms. 752–761.9 indexed citations
Rackoff, Charles. (1992). Some definitions, protocols and proofs about secure authentication. Conference of the Centre for Advanced Studies on Collaborative Research. 361–374.1 indexed citations
13.
Rackoff, Charles. (1990). A basic theory of public and private cryptosystems (invited talk). 249–255.
14.
Goldwasser, Shafi, Silvio Micali, & Charles Rackoff. (1989). The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing. 18(1). 186–208.1337 indexed citations breakdown →
15.
Luby, Michael & Charles Rackoff. (1989). A study of password security. Journal of Cryptology. 1(3). 151–158.11 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.