Shai Halevi

24.1k total citations · 1 hit paper
59 papers, 2.7k citations indexed

About

Shai Halevi is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Information Systems. According to data from OpenAlex, Shai Halevi has authored 59 papers receiving a total of 2.7k indexed citations (citations by other indexed papers that have themselves been cited), including 43 papers in Artificial Intelligence, 17 papers in Computational Theory and Mathematics and 14 papers in Information Systems. Recurrent topics in Shai Halevi's work include Cryptography and Data Security (40 papers), Complexity and Algorithms in Graphs (17 papers) and Cryptographic Implementations and Security (13 papers). Shai Halevi is often cited by papers focused on Cryptography and Data Security (40 papers), Complexity and Algorithms in Graphs (17 papers) and Cryptographic Implementations and Security (13 papers). Shai Halevi collaborates with scholars based in United States, Israel and Mexico. Shai Halevi's co-authors include Ran Canetti, Oded Goldreich, Craig Gentry, Hugo Krawczyk, Alexandra Shulman‐Peleg, Benny Pinkas, Danny Harnik, Mariana Raykova, Sanjam Garg and Amit Sahai and has published in prestigious journals such as SHILAP Revista de lepidopterología, Communications of the ACM and Journal of the ACM.

In The Last Decade

Shai Halevi

59 papers receiving 2.4k citations

Hit Papers

align trajectories sort by overperformance

What are hit papers?

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.

Proofs of ownership in remote storage systems

2011 328 citations Shai Halevi et al. profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Shai Halevi United States	23	2.3k	1.2k	765	600	386	59	2.7k
Huaxiong Wang Singapore	24	1.5k 0.6×	858 0.7×	628 0.8×	309 0.5×	381 1.0×	144	2.0k
Guomin Yang Australia	32	2.6k 1.1×	2.0k 1.7×	1.1k 1.4×	411 0.7×	326 0.8×	130	3.3k
Yuh‐Min Tseng Taiwan	26	1.7k 0.7×	1.1k 0.9×	1.4k 1.9×	263 0.4×	307 0.8×	133	2.3k
Juan A. Garay United States	23	2.6k 1.1×	1.2k 1.0×	1.7k 2.2×	625 1.0×	502 1.3×	87	3.7k
Vinod Vaikuntanathan United States	24	4.4k 1.9×	1.5k 1.3×	510 0.7×	1.4k 2.3×	692 1.8×	70	4.8k
Hugo Krawczyk United States	27	2.1k 0.9×	1.2k 1.0×	1.4k 1.8×	431 0.7×	422 1.1×	61	2.9k
Sherman S. M. Chow Hong Kong	24	2.8k 1.2×	2.1k 1.8×	697 0.9×	344 0.6×	303 0.8×	100	3.3k
Christian Cachin Switzerland	29	1.2k 0.5×	1.1k 0.9×	1.4k 1.8×	149 0.2×	350 0.9×	79	2.4k
Chunxiang Xu China	28	2.2k 1.0×	1.9k 1.6×	664 0.9×	181 0.3×	304 0.8×	154	2.8k
Michael Naehrig United States	12	1.9k 0.8×	632 0.5×	226 0.3×	276 0.5×	385 1.0×	22	2.1k

Countries citing papers authored by Shai Halevi

Since Specialization

Citations

This map shows the geographic impact of Shai Halevi'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 Shai Halevi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Shai Halevi more than expected).

Fields of papers citing papers by Shai Halevi

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Shai Halevi. 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 Shai Halevi. The network helps show where Shai Halevi may publish in the future.

Co-authorship network of co-authors of Shai Halevi

This figure shows the co-authorship network connecting the top 25 collaborators of Shai Halevi. A scholar is included among the top collaborators of Shai Halevi 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 Shai Halevi. Shai Halevi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Yang, Yibin, Fabrice Benhamouda, Shai Halevi, Hugo Krawczyk, & Tal Rabin. (2025). Gold OPRF: Post-Quantum Oblivious Power-Residue PRF. 259–278. 1 indexed citations

2.

Akavia, Adi, et al.. (2024). Achievable CCA2 Relaxation for Homomorphic Encryption. Journal of Cryptology. 38(1). 1 indexed citations

3.

Halevi, Shai, Carmit Hazay, Antigoni Polychroniadou, & Muthuramakrishnan Venkitasubramaniam. (2021). Round-Optimal Secure Multi-party Computation. Journal of Cryptology. 34(3). 3 indexed citations

4.

Akavia, Adi, et al.. (2019). Setup-Free Secure Search on Encrypted Data: Faster and Post-Processing Free. SHILAP Revista de lepidopterología. 11 indexed citations

5.

Garg, Sanjam, Craig Gentry, Shai Halevi, et al.. (2016). Hiding secrets in software. Communications of the ACM. 59(5). 113–120. 6 indexed citations

6.

Garg, Sanjam, Craig Gentry, Shai Halevi, et al.. (2013). Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits. 40–49. 262 indexed citations

7.

Gentry, Craig, Shai Halevi, Chris Peikert, & Nigel P. Smart. (2012). Security and Cryptography for Networks - SCN 2012. Springer US. 2 indexed citations

8.

Halevi, Tzipora, Nitesh Saxena, & Shai Halevi. (2011). Tree-based HB protocols for privacy-preserving authentication of RFID tags. Journal of Computer Security. 19(2). 343–363. 8 indexed citations

9.

Chari, Suresh T., Shai Halevi, & Wietse Venema. (2010). Where Do You Want to Go Today? Escalating Privileges by Pathname Manipulation.. Network and Distributed System Security Symposium. 17 indexed citations

10.

Halevi, Shai & Yael Tauman Kalai. (2010). Smooth Projective Hashing and Two-Message Oblivious Transfer. Journal of Cryptology. 25(1). 158–193. 18 indexed citations

11.

Halevi, Shai. (2009). Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology. 23 indexed citations

12.

Coppersmith, Don, Jean-Sébastien Coron, Shai Halevi, et al.. (2007). Cryptanalysis of ISO/IEC 9796-1. Journal of Cryptology. 21(1). 27–51. 2 indexed citations

13.

Boneh, Dan, et al.. (2006). Chosen ciphertext secure public key threshold encryption without random oracles. 2 indexed citations

14.

Halevi, Shai, et al.. (2006). Theory of Cryptography. Lecture notes in computer science. 12 indexed citations

15.

Halevi, Shai & Phillip Rogaway. (2003). A Tweakable Enciphering Mode.. Lecture notes in computer science. 2003. 148–499. 10 indexed citations

16.

Gál, Anna, Shai Halevi, R.J. Lipton, & Erez Petrank. (2003). Computing from partial solutions. 34–45. 9 indexed citations

17.

Dodis, Yevgeniy, Shai Halevi, & Tal Rabin. (2000). A Cryptographic Solution to a Game Theoretic Problem. 9 indexed citations

18.

Halevi, Shai, et al.. (1999). UMAC: Fast and Secure Message Authentication. 1 indexed citations

19.

Goldreich, Oded, Shafi Goldwasser, & Shai Halevi. (1996). Collision-Free Hashing from Lattice Problems. IACR Cryptology ePrint Archive. 1996. 9. 30 indexed citations

20.

Goldreich, Oded, et al.. (1996). Public-Key Cryptosystems from Lattice Reduction Problems. DSpace@MIT (Massachusetts Institute of Technology). 1996. 16. 18 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.

Explore authors with similar magnitude of impact