Gilad Asharov

2.1k total citations
23 papers, 444 citations indexed

About

Gilad Asharov is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Information Systems. According to data from OpenAlex, Gilad Asharov has authored 23 papers receiving a total of 444 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Artificial Intelligence, 17 papers in Computational Theory and Mathematics and 5 papers in Information Systems. Recurrent topics in Gilad Asharov's work include Cryptography and Data Security (23 papers), Complexity and Algorithms in Graphs (17 papers) and Privacy-Preserving Technologies in Data (11 papers). Gilad Asharov is often cited by papers focused on Cryptography and Data Security (23 papers), Complexity and Algorithms in Graphs (17 papers) and Privacy-Preserving Technologies in Data (11 papers). Gilad Asharov collaborates with scholars based in Israel, United States and Italy. Gilad Asharov's co-authors include Yehuda Lindell, Michael Zohner, Thomas Schneider, Gil Segev, Moni Naor, Shai Halevi, Tal Rabin, Daniel Demmler, Michael Schapira and Scott Shenker and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Gilad Asharov

20 papers receiving 427 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Gilad Asharov Israel 10 417 132 104 57 51 23 444
Gil Segev Israel 13 444 1.1× 156 1.2× 96 0.9× 114 2.0× 80 1.6× 38 509
Toshinori Araki Japan 7 331 0.8× 98 0.7× 67 0.6× 98 1.7× 47 0.9× 19 408
Viet Tung Hoang United States 7 374 0.9× 115 0.9× 70 0.7× 44 0.8× 42 0.8× 13 404
Nir Bitansky Israel 11 455 1.1× 178 1.3× 215 2.1× 65 1.1× 41 0.8× 23 508
Sha Ma China 10 463 1.1× 144 1.1× 240 2.3× 73 1.3× 48 0.9× 28 511
Shangqi Lai Australia 7 343 0.8× 57 0.4× 126 1.2× 73 1.3× 74 1.5× 22 385
Lior Malka United States 5 434 1.0× 92 0.7× 126 1.2× 52 0.9× 81 1.6× 8 503
Ni Trieu United States 8 356 0.9× 101 0.8× 74 0.7× 44 0.8× 23 0.5× 19 394
Mariya Georgieva Switzerland 4 463 1.1× 125 0.9× 139 1.3× 61 1.1× 71 1.4× 5 510

Countries citing papers authored by Gilad Asharov

Since Specialization
Citations

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

Fields of papers citing papers by Gilad Asharov

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Gilad Asharov

This figure shows the co-authorship network connecting the top 25 collaborators of Gilad Asharov. A scholar is included among the top collaborators of Gilad Asharov 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 Gilad Asharov. Gilad Asharov 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.
Asharov, Gilad, et al.. (2023). FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM. 3313–3327. 1 indexed citations
2.
Asharov, Gilad, T-H. Hubert Chan, Kartik Nayak, et al.. (2022). Locality-Preserving Oblivious RAM. Journal of Cryptology. 35(2).
3.
Asharov, Gilad, Koki Hamada, Dai Ikarashi, et al.. (2022). Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters. Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. 125–138. 10 indexed citations
4.
5.
Abraham, Ittai, Gilad Asharov, & Avishay Yanai. (2022). Efficient Perfectly Secure Computation with Optimal Resilience. Journal of Cryptology. 35(4).
6.
Asharov, Gilad, et al.. (2021). Tight Tradeoffs in Searchable Symmetric Encryption. Journal of Cryptology. 34(2). 13 indexed citations
7.
Asharov, Gilad, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, & Elaine Shi. (2020). Oblivious Parallel Tight Compaction. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
8.
Asharov, Gilad, et al.. (2020). Privacy-Preserving Dark Pools. Adaptive Agents and Multi-Agents Systems. 1747–1749. 3 indexed citations
9.
Asharov, Gilad, Shai Halevi, Yehuda Lindell, & Tal Rabin. (2018). Privacy-Preserving Search of Similar Patients in Genomic Data. SHILAP Revista de lepidopterología. 2018(4). 104–124. 40 indexed citations
10.
Asharov, Gilad & Gil Segev. (2017). On Constructing One-Way Permutations from Indistinguishability Obfuscation. Journal of Cryptology. 31(3). 698–736. 3 indexed citations
11.
Asharov, Gilad, Daniel Demmler, Michael Schapira, et al.. (2017). Privacy-Preserving Interdomain Routing at Internet Scale. SHILAP Revista de lepidopterología. 2017(3). 147–167. 25 indexed citations
12.
Asharov, Gilad & Gil Segev. (2016). Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. SIAM Journal on Computing. 45(6). 2117–2176. 5 indexed citations
13.
Asharov, Gilad, Yehuda Lindell, Thomas Schneider, & Michael Zohner. (2016). More Efficient Oblivious Transfer Extensions. Journal of Cryptology. 30(3). 805–858. 23 indexed citations
14.
15.
Asharov, Gilad, Ran Canetti, & Carmit Hazay. (2015). Toward a Game Theoretic View of Secure Computation. Journal of Cryptology. 29(4). 879–926. 2 indexed citations
16.
Asharov, Gilad & Yehuda Lindell. (2015). A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation. Journal of Cryptology. 30(1). 58–151. 30 indexed citations
17.
Asharov, Gilad & Gil Segev. (2015). Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. 191–209. 8 indexed citations
18.
Asharov, Gilad, Yehuda Lindell, Thomas Schneider, & Michael Zohner. (2013). More efficient oblivious transfer and extensions for faster secure computation. TUbilio (Technical University of Darmstadt). 535–548. 188 indexed citations
19.
Asharov, Gilad & Yehuda Lindell. (2011). A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation.. IACR Cryptology ePrint Archive. 18. 136. 10 indexed citations
20.
Asharov, Gilad & Yehuda Lindell. (2010). Utility Dependence in Correct and Fair Rational Secret Sharing. Journal of Cryptology. 24(1). 157–202. 21 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

Breakdown of academic impact, for papers by Gil Segev Breakdown of academic impact, for papers by Toshinori Araki Breakdown of academic impact, for papers by Viet Tung Hoang Breakdown of academic impact, for papers by Nir Bitansky Breakdown of academic impact, for papers by Sha Ma Breakdown of academic impact, for papers by Shangqi Lai Breakdown of academic impact, for papers by Lior Malka Breakdown of academic impact, for papers by Ni Trieu Breakdown of academic impact, for papers by Mariya Georgieva
Rankless by CCL
2026