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 spread spectrum watermarking for multimedia
19973.6k citationsJoe Kilian, Frank Thomson Leighton 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 Joe Kilian'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 Joe Kilian with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joe Kilian more than expected).
This network shows the impact of papers produced by Joe Kilian. 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 Joe Kilian. The network helps show where Joe Kilian may publish in the future.
Co-authorship network of co-authors of Joe Kilian
This figure shows the co-authorship network connecting the top 25 collaborators of Joe Kilian.
A scholar is included among the top collaborators of Joe Kilian 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 Joe Kilian. Joe Kilian is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Kilian, Joe. (2005). Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12. 2005, Proceedings (Lecture Notes in Computer Science). Springer eBooks.2 indexed citations
Kilian, Joe & Frank Thomson Leighton. (1995). Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract). 208–221.6 indexed citations
10.
Sako, Kazue & Joe Kilian. (1995). Receipt-free mix-type voting scheme - A practical solution to the implementation of a voting booth-. Lecture notes in computer science. 921. 393–403.130 indexed citations
11.
Kilian, Joe, Shlomo Kipnis, & Charles E. Leiserson. (1994). The organization of permutation architectures with bused interconnections. IEEE Computer Society Press eBooks. 190–202.5 indexed citations
Abadi, Martı́n, Joan Feigenbaum, & Joe Kilian. (1989). On hiding information from an oracle. Journal of Computer and System Sciences. 39(1). 21–50.100 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.