Gil Segev

4.5k total citations
38 papers, 509 citations indexed

About

Gil Segev is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Gil Segev has authored 38 papers receiving a total of 509 indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Artificial Intelligence, 20 papers in Computational Theory and Mathematics and 7 papers in Computer Networks and Communications. Recurrent topics in Gil Segev's work include Cryptography and Data Security (34 papers), Complexity and Algorithms in Graphs (19 papers) and Cryptographic Implementations and Security (13 papers). Gil Segev is often cited by papers focused on Cryptography and Data Security (34 papers), Complexity and Algorithms in Graphs (19 papers) and Cryptographic Implementations and Security (13 papers). Gil Segev collaborates with scholars based in Israel, United States and Germany. Gil Segev's co-authors include Moni Naor, Gilad Asharov, Michael Zohner, Thomas Schneider, Benny Pinkas, Zvika Brakerski, Michael Schapira, Scott Shenker, Ilya Mironov and Ilan Komargodski and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Information Theory and Communications of the ACM.

In The Last Decade

Gil Segev

36 papers receiving 492 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Gil Segev Israel	13	444	156	114	96	80	38	509
Krzysztof Pietrzak Austria	8	299 0.7×	100 0.6×	84 0.7×	72 0.8×	78 1.0×	20	393
Nicolas Gama France	8	519 1.2×	164 1.1×	74 0.6×	153 1.6×	73 0.9×	12	581
Daniel Wichs United States	14	608 1.4×	197 1.3×	68 0.6×	205 2.1×	98 1.2×	31	651
Toshinori Araki Japan	7	331 0.7×	98 0.6×	98 0.9×	67 0.7×	47 0.6×	19	408
Nir Bitansky Israel	11	455 1.0×	178 1.1×	65 0.6×	215 2.2×	41 0.5×	23	508
Carmit Hazay Israel	15	688 1.5×	206 1.3×	103 0.9×	250 2.6×	101 1.3×	45	773
Lior Malka United States	5	434 1.0×	92 0.6×	52 0.5×	126 1.3×	81 1.0×	8	503
Viet Tung Hoang United States	7	374 0.8×	115 0.7×	44 0.4×	70 0.7×	42 0.5×	13	404
Mirosław Kutyłowski Poland	9	186 0.4×	106 0.7×	147 1.3×	76 0.8×	33 0.4×	81	340
Ariel Nof Israel	9	408 0.9×	118 0.8×	63 0.6×	129 1.3×	38 0.5×	13	448

Countries citing papers authored by Gil Segev

Since Specialization

Citations

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

Fields of papers citing papers by Gil Segev

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Gil Segev

This figure shows the co-authorship network connecting the top 25 collaborators of Gil Segev. A scholar is included among the top collaborators of Gil Segev 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 Gil Segev. Gil Segev 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

Segev, Gil, et al.. (2023). Non-malleable Vector Commitments via Local Equivocability. Journal of Cryptology. 36(4). 1 indexed citations

Segev, Gil. (2023). Technical Perspective: Finding Connections between One-Way Functions and Kolmogorov Complexity. Communications of the ACM. 66(5). 90–90. 1 indexed citations

Asharov, Gilad, et al.. (2021). Tight Tradeoffs in Searchable Symmetric Encryption. Journal of Cryptology. 34(2). 13 indexed citations

Ordentlich, Or, et al.. (2020). An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. 858–863. 1 indexed citations

Komargodski, Ilan & Gil Segev. (2019). From Minicrypt to Obfustopia via Private-Key Functional Encryption. Journal of Cryptology. 33(2). 406–458. 5 indexed citations

Brakerski, Zvika & Gil Segev. (2017). Function-Private Functional Encryption in the Private-Key Setting. Journal of Cryptology. 31(1). 202–225. 11 indexed citations

Rosen, Alon, et al.. (2017). Can PPAD Hardness be Based on Standard Cryptographic Assumptions?. Lecture notes in computer science. 34(1). 747–776. 1 indexed citations

Komargodski, Ilan, Gil Segev, & Eylon Yogev. (2017). Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. Journal of Cryptology. 31(1). 60–100. 5 indexed citations

Asharov, Gilad & Gil Segev. (2017). On Constructing One-Way Permutations from Indistinguishability Obfuscation. Journal of Cryptology. 31(3). 698–736. 3 indexed citations

10.

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

11.

Asharov, Gilad, et al.. (2016). Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. 1101–1114. 46 indexed citations

12.

Pinkas, Benny, Thomas Schneider, Gil Segev, & Michael Zohner. (2015). Phasing: Private Set Intersection using Permutation-based Hashing.. TUbilio (Technical University of Darmstadt). 2015. 515–530. 82 indexed citations

13.

Cohen, Gil, Ran Raz, & Gil Segev. (2011). Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification.. Electronic colloquium on computational complexity. 18. 96. 1 indexed citations

14.

Mironov, Ilya, Moni Naor, & Gil Segev. (2011). Sketching in Adversarial Environments. SIAM Journal on Computing. 40(6). 1845–1870. 14 indexed citations

15.

Moran, Tal, Moni Naor, & Gil Segev. (2009). . Theory of Computing. 5(1). 43–67. 2 indexed citations

16.

Segev, Danny & Gil Segev. (2008). Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing. Algorithmica. 56(4). 529–549. 3 indexed citations

17.

Mironov, Ilya, Moni Naor, & Gil Segev. (2008). Sketching in adversarial environments. 651–660. 5 indexed citations

18.

Naor, Moni, Gil Segev, & Adam Smith. (2008). Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. IEEE Transactions on Information Theory. 54(6). 2408–2425. 6 indexed citations

19.

Haitner, Iftach, Jonathan J. Hoch, Omer Reingold, & Gil Segev. (2007). Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. 669–679. 22 indexed citations

20.

Haitner, Iftach, Jonathan J. Hoch, Omer Reingold, & Gil Segev. (2007). Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.

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