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.
Universally composable security: a new paradigm for cryptographic protocols
This map shows the geographic impact of Ran Canetti'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 Ran Canetti with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ran Canetti more than expected).
This network shows the impact of papers produced by Ran Canetti. 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 Ran Canetti. The network helps show where Ran Canetti may publish in the future.
Co-authorship network of co-authors of Ran Canetti
This figure shows the co-authorship network connecting the top 25 collaborators of Ran Canetti.
A scholar is included among the top collaborators of Ran Canetti 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 Ran Canetti. Ran Canetti 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.
Zhou, Liyi, Sebastian Steinhorst, Ran Canetti, et al.. (2023). SoK: Data Sovereignty. 122–143.12 indexed citations
Canetti, Ran, Ari Trachtenberg, & Mayank Varia. (2020). Anonymous Collocation Discovery:Taming the Coronavirus While Preserving Privacy. arXiv (Cornell University).2 indexed citations
4.
Canetti, Ran, Ling Cheung, Moses Liskov, et al.. (2017). Task-structured probabilistic I/O automata. Journal of Computer and System Sciences. 94. 63–97.2 indexed citations
5.
Canetti, Ran, Ben Riva, & Guy N. Rothblum. (2013). Refereed delegation of computation. Information and Computation. 226. 16–36.12 indexed citations
6.
Canetti, Ran, Ling Cheung, Nancy Lynch, & Olivier Pereira. (2007). On the Role of Scheduling in Simulation-Based Security. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 2007. 102.5 indexed citations
7.
Canetti, Ran, Ling Cheung, Dilsun Kaynar, et al.. (2005). Using Probabilistic I/O Automata to improve the analysis of cryptographic protocols. DIAL (Catholic University of Leuven). 63. 40–41.1 indexed citations
8.
Canetti, Ran & Marc Fischlin. (2001). Universally Composable Commitments (Extended Abstract). 19–40.
9.
Perrig, Adrian, Ran Canetti, Dawn Song, & J. D. Tygar. (2001). Efficient and Secure Source Authentication for Multicast.. Network and Distributed System Security Symposium.428 indexed citations
10.
Canetti, Ran. (2001). Universally composable security: a new paradigm for cryptographic protocols. 136–145.1139 indexed citations breakdown →
11.
Canetti, Ran. (2000). A unified framework for analyzing security of protocols. IACR Cryptology ePrint Archive. 8.16 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.