2026 Alon Rosen: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	39	9784	9503	291	289	109	6274

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Computer Science

9784

9503

291

289

109

6274

Overview

Alon Rosen is a researcher affiliated with Bocconi University in Italy, specializing in computer science with a focus on cryptography and theoretical computer science. Their body of work encompasses various aspects of cryptography, algorithms, and complexity theory.

Their publication record includes papers in notable academic venues. Some recent works are:

Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange, 2021, Journal of Cryptology
Cryptography from Information Loss, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?, 2021, Lecture notes in computer science
One-Way Functions and (Im)perfect Obfuscation, 2022, SIAM Journal on Computing
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads, 2020, Lecture notes in computer science

Their frequent coauthors include:

Andrej Bogdanov
Ron D. Rothblum
Masayuki Abe
Miyako Ohkubo
Alexander R. Block

Alon Rosen's research has been published primarily in the following venues:

Lecture notes in computer science
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
arXiv (Cornell University)
SIAM Journal on Computing
Journal of Cryptology

The main field of study for Rosen is Computer Science. Within that domain, they have contributed to various subfields, including:

Artificial Intelligence
Computational Theory and Mathematics
Computer Networks and Communications
Computer Vision and Pattern Recognition
Information Systems

The core topics of their research work include:

Cryptography and Data Security
Complexity and Algorithms in Graphs
Cryptographic Implementations and Security
Chaos-based Image/Signal Encryption
Graph theory and CDMA systems
Machine Learning and Algorithms
Semigroups and automata theory

Best Publications

Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices

Chris Peikert;Alon Rosen

680
Citations
Pseudorandom functions and lattices

Abhishek Banerjee;Chris Peikert;Alon Rosen

553
Citations
SWIFFT: A Modest Proposal for FFT Hashing

Vadim Lyubashevsky;Daniele Micciancio;Chris Peikert;Alon Rosen

340
Citations
Concurrent zero knowledge with logarithmic round-complexity

M. Prabhakaran;A. Rosen;A. Sahai

238
Citations
Constant-Round Oblivious Transfer in the Bounded Storage Model

Yan Zong Ding;Danny Harnik;Alon Rosen;Ronen Shaltiel

225
Citations
New and improved constructions of non-malleable cryptographic protocols

Rafael Pass;Alon Rosen

221
Citations
Black-box concurrent zero-knowledge requires ilde {Ω} (logn) rounds

Ran Canetti;Joe Kilian;Erez Petrank;Alon Rosen

197
Citations
New and Improved Constructions of Nonmalleable Cryptographic Protocols

Rafael Pass;Alon Rosen

192
Citations
Concurrent non-malleable commitments

R. Pass;A. Rosen

181
Citations
On robust combiners for oblivious transfer and other primitives

Danny Harnik;Joe Kilian;Moni Naor;Omer Reingold

161
Citations
Concurrent Nonmalleable Commitments

Rafael Pass;Alon Rosen

160
Citations
Chosen-Ciphertext Security via Correlated Products

Alon Rosen;Gil Segev

157
Citations
On the existence of extractable one-way functions

Nir Bitansky;Ran Canetti;Omer Paneth;Alon Rosen

141
Citations
On the Cryptographic Hardness of Finding a Nash Equilibrium.

Nir Bitansky;Omer Paneth;Alon Rosen

139
Citations
On the Hardness of Learning with Rounding over Small Modulus

Andrej Bogdanov;Siyao Guo;Daniel Masny;Silas Richelson

139
Citations
A Note on the Round-Complexity of Concurrent Zero-Knowledge

Alon Rosen

139
Citations
RIPPLE Authentication for Network Coding

Yaping Li;Hongyi Yao;Minghua Chen;Sidharth Jaggi

129
Citations
Fairness with an Honest Minority and a Rational Majority

Shien Jin Ong;David C. Parkes;Alon Rosen;Salil Vadhan

127
Citations
Proofs of Useful Work.

Marshall Ball;Alon Rosen;Manuel Sabin;Prashant Nalini Vasudevan

108
Citations
More constructions of lossy and correlation-secure trapdoor functions

David Mandell Freeman;Oded Goldreich;Eike Kiltz;Alon Rosen

98
Citations
Chosen-Ciphertext Security via Correlated Products

Alon Rosen;Gil Segev

36
Citations

Frequent Co-Authors

Gil Segev Hebrew University of Jerusalem

Ran Canetti Boston University

Moni Naor Weizmann Institute of Science

Chris Peikert University of Michigan–Ann Arbor

Rafael Pass Cornell University

Omer Reingold Stanford University

Vipul Goyal Carnegie Mellon University

Manoj Prabhakaran Indian Institute of Technology Bombay

Elette Boyle Reichman University

Erez Petrank Technion – Israel Institute of Technology

External Links

Personal website of Alon Rosen Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring related online degrees opens up flexible and affordable ways to advance your Computer Science career. If you’re seeking a fast track to specialized roles, consider enrolling in one of the quickest cheapest masters degree programs in technology fields. These programs can help you upskill efficiently without long time commitments or heavy student debt.

Many professionals wonder, which master's degree is most in demand in usa for tech careers? Computer Science and data-related disciplines consistently rank among the top, offering strong career prospects and high earning potential.

For those starting their journey, an associate degree online in IT or related fields is a flexible entry point. It can help you land foundational roles or serve as a stepping stone to a bachelor's program.

Budget-conscious students can seek the most affordable online colleges offering recognized Computer Science degrees. This pathway lets you minimize expenses while maximizing your long-term career options in the tech industry.