Benny Applebaum

3.0k total citations
35 papers, 359 citations indexed

About

Benny Applebaum is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Benny Applebaum has authored 35 papers receiving a total of 359 indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Artificial Intelligence, 22 papers in Computational Theory and Mathematics and 10 papers in Computer Vision and Pattern Recognition. Recurrent topics in Benny Applebaum's work include Cryptography and Data Security (28 papers), Complexity and Algorithms in Graphs (16 papers) and Coding theory and cryptography (14 papers). Benny Applebaum is often cited by papers focused on Cryptography and Data Security (28 papers), Complexity and Algorithms in Graphs (16 papers) and Coding theory and cryptography (14 papers). Benny Applebaum collaborates with scholars based in Israel, United States and Hong Kong. Benny Applebaum's co-authors include Yuval Ishai, Eyal Kushilevitz, Boaz Barak, Avi Wigderson, David Xiao, Danny Harnik, Andrej Bogdanov, Alon Rosen, Ronen Shaltiel and Christina Brzuska and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Journal of Cryptology.

In The Last Decade

Benny Applebaum

35 papers receiving 331 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Benny Applebaum Israel	10	317	212	44	32	27	35	359
V. Arvind India	11	236 0.7×	305 1.4×	27 0.6×	48 1.5×	35 1.3×	86	398
Mikael Goldmann Sweden	11	313 1.0×	312 1.5×	41 0.9×	74 2.3×	91 3.4×	19	463
Stathis Zachos Greece	8	241 0.8×	299 1.4×	12 0.3×	32 1.0×	44 1.6×	17	369
Anand Louis United States	7	97 0.3×	66 0.3×	37 0.8×	24 0.8×	15 0.6×	15	197
N. V. Vinodchandran United States	10	197 0.6×	201 0.9×	83 1.9×	69 2.2×	15 0.6×	54	371
M. Alekhnovich United States	9	239 0.8×	242 1.1×	12 0.3×	76 2.4×	48 1.8×	13	330
Paul F. Christiano United States	5	116 0.4×	79 0.4×	24 0.5×	42 1.3×	21 0.8×	8	210
Matthias Krause Germany	10	174 0.5×	202 1.0×	99 2.3×	31 1.0×	48 1.8×	20	318
Aleksandar Nikolov United States	9	107 0.3×	70 0.3×	37 0.8×	40 1.3×	7 0.3×	26	203
Anindya De United States	9	177 0.6×	95 0.4×	23 0.5×	25 0.8×	32 1.2×	34	252

Countries citing papers authored by Benny Applebaum

Since Specialization

Citations

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

Fields of papers citing papers by Benny Applebaum

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Benny Applebaum

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

Applebaum, Benny, et al.. (2025). The Meta-complexity of Secret Sharing. 965–976. 1 indexed citations

Applebaum, Benny & Prashant Nalini Vasudevan. (2021). Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. Journal of Cryptology. 34(2). 1169. 2 indexed citations

Applebaum, Benny, Zvika Brakerski, Sanjam Garg, Yuval Ishai, & Akshayaram Srinivasan. (2020). Separating Two-Round Secure Computation From Oblivious Transfer. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Applebaum, Benny, et al.. (2020). On the Power of Amortization in Secret Sharing. 12(4). 1–21. 6 indexed citations

Applebaum, Benny, et al.. (2019). Sampling Graphs without Forbidden Subgraphs and Almost-Explicit Unbalanced Expanders.. 26. 11. 1 indexed citations

Applebaum, Benny, et al.. (2017). Arithmetic Cryptography. Journal of the ACM. 64(2). 1–74. 3 indexed citations

Applebaum, Benny, et al.. (2017). Conditional Disclosure of Secrets and d-Uniform Secret Sharing with Constant Information Rate.. IACR Cryptology ePrint Archive. 2018. 1. 1 indexed citations

Applebaum, Benny, Yuval Ishai, & Eyal Kushilevitz. (2016). Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings. Journal of Cryptology. 31(1). 1–22. 1 indexed citations

Applebaum, Benny & Shachar Lovett. (2016). Algebraic Attacks against Random Local Functions and Their Countermeasures. SIAM Journal on Computing. 47(1). 1087–1100. 1 indexed citations

10.

Applebaum, Benny. (2013). Cryptography in Constant Parallel Time. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 7 indexed citations

11.

Applebaum, Benny, Andrej Bogdanov, & Alon Rosen. (2011). A Dichotomy for Local Small-Bias Generators.. IACR Cryptology ePrint Archive. 18. 126. 1 indexed citations

12.

Applebaum, Benny, Yuval Ishai, & Eyal Kushilevitz. (2011). How to Garble Arithmetic Circuits. 120–129. 17 indexed citations

13.

Applebaum, Benny, Yuval Ishai, & Eyal Kushilevitz. (2010). Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature. 1–19. 9 indexed citations

14.

Applebaum, Benny, Danny Harnik, & Yuval Ishai. (2010). Semantic Security Under Related-Key Attacks and Applications.. IACR Cryptology ePrint Archive. 2010. 45–60. 14 indexed citations

15.

Applebaum, Benny, Boaz Barak, & Avi Wigderson. (2010). Public-key cryptography from different assumptions. 171–180. 62 indexed citations

16.

Applebaum, Benny, Yuval Ishai, & Eyal Kushilevitz. (2009). Cryptography with Constant Input Locality. Journal of Cryptology. 22(4). 429–469. 14 indexed citations

17.

Applebaum, Benny, Yuval Ishai, & Eyal Kushilevitz. (2008). On Pseudorandom Generators with Linear Stretch in NC0. Computational Complexity. 17(1). 38–69. 20 indexed citations

18.

Applebaum, Benny, Yuval Ishai, & Eyal Kushilevitz. (2006). Cryptography in $NC^0$. SIAM Journal on Computing. 36(4). 845–888. 78 indexed citations

19.

Applebaum, Benny, Yuval Ishai, & Eyal Kushilevitz. (2005). Computationally Private Randomizing Polynomials and Their Applications. 260–274. 1 indexed citations

20.

Applebaum, Benny, Yuval Ishai, & Eyal Kushilevitz. (2004). Cryptography in NC⁰. 166–175. 14 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