Ran Canetti

34.3k citations
246 papers · 23.8k · 12 hit papers · h-index 69

Impact in

    • Cryptography and Data Security
    • Cryptographic Implementations and Security
    • Privacy-Preserving Technologies in Data
    • Security and Verification in Computing
    • Advanced Authentication Protocols Security
    • Security in Wireless Sensor Networks

Papers in

    • Cryptography and Data Security 205
    • Security and Verification in Computing 6
    • Logic, programming, and type systems 4
    • Advanced Authentication Protocols Security 31
    • Optimization and Search Problems 4
    • Security in Wireless Sensor Networks 4

Ran Canetti

235 papers receiving 22.4k citations

Ran Canetti's Hit Papers

From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again 2012 · 365 citations
3650+10+20Years since publication5001k1.5k2k

Peers

Ran Canetti
Comparison fields: 5 of 69
  • Artificial Intelligence 18.5k
  • Computer Networks and Communications 6.2k
  • Information Systems 1.8k
  • Computational Theory and Mathematics 479
  • Hardware and Architecture 191
Replace Hugo Krawczyk with:
Hugo Krawczyk United States
Jonathan I. Katz United States
Alfred Menezes Canada
Moti M. Yung United States
Nigel Paul Smart United Kingdom
Shai Halevi United States
Craig Gentry United States
Ivan Damgård Denmark
Mihir Bellare Y United States
Jean-Jacques Quisquater Belgium
Ran Canetti relative to Hugo Krawczyk United States Hugo Krawczyk's profile →
Citations per field
00.5×2×2.6×
Hugo Krawczyk · 1×
Citations per year

Countries citing papers authored by Ran Canetti

Since Specialization
Citations

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).

Fields of papers citing papers by Ran Canetti

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authors

The 25 scholars most cited alongside Ran Canetti, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Ran Canetti Line = papers co-authored together Ran Canetti links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 246 papers — load more, or switch the sort, to bring in the rest.

#Work
1
Universally composable security: a new paradigm for cryptographic protocols
Hit paper breakdown →
20012473
2
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
Hit paper breakdown →
20011288
3
Keying Hash Functions for Message Authentication
Hit paper breakdown →
19961153
4
Security and Composition of Multiparty Cryptographic Protocols
Hit paper breakdown →
20001104
5
Efficient authentication and signing of multicast streams over lossy channels
Hit paper breakdown →
2002726
6
The random oracle methodology, revisited
Hit paper breakdown →
2004725
7
Chosen-Ciphertext Security from Identity-Based Encryption
Hit paper breakdown →
2004697
8
Universally Composable Notions of Key Exchange and Secure Channels
Hit paper breakdown →
2002596
9
A Forward-Secure Public-Key Encryption Scheme
Hit paper breakdown →
2003577
10 1998566
11 1999556
12
Universally composable two-party and multi-party secure computation
Hit paper breakdown →
2002552
13
Efficient and Secure Source Authentication for Multicast.
2001480
14 2001456
15
Chosen-ciphertext secure proxy re-encryption
Hit paper breakdown →
2007445
16 1996441
17
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
Hit paper breakdown →
2012365
18 2006302
19 1998299
20 1997280

About Ran Canetti

Ran Canetti is a scholar working on Artificial Intelligence, Computer Networks and Communications, Computational Theory and Mathematics, Information Systems and Algebra and Number Theory, having authored 246 papers that have together received 23.8k indexed citations. Recurring topics across this work include Cryptography and Data Security (205 papers), Advanced Authentication Protocols Security (31 papers), Formal Methods in Verification (9 papers), Security and Verification in Computing (6 papers), Complexity and Algorithms in Graphs (5 papers), Optimization and Search Problems (4 papers), Logic, programming, and type systems (4 papers) and Security in Wireless Sensor Networks (4 papers). The work is most often cited by research in Artificial Intelligence (18.5k citations), Computer Networks and Communications (6.2k citations), Information Systems (1.8k citations), Computational Theory and Mathematics (479 citations) and Hardware and Architecture (191 citations). Ran Canetti has collaborated with scholars based in United States, Israel and Canada. Frequent co-authors include Hugo Krawczyk, Shai Halevi, Oded Goldreich, Mihir Bellare Y, Jonathan I. Katz, Dawn Xiaodong Song, J. D. Tygar, Adrian Perrig, Yehuda Lindell and Nir Bitansky. Their work appears in journals such as Journal of Cryptology, Lecture notes in computer science, SIAM Journal on Computing, Journal of the ACM and Israel Journal of Mathematics.

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.

Explore authors with similar magnitude of impact