Alon Rosen

Cited by

	All	Since 2019
Citations	5903	2552
h-index	39	27
i10-index	61	47

460

230

115

345

20012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202423 28 46 32 50 75 81 130 170 194 174 271 263 301 295 360 359 406 454 446 434 451 438 327

Public access

View all

38 articles

2 articles

available

not available

Based on funding mandates

Co-authors

Chris PeikertProfessor, Computer Science and Engineering, University of MichiganVerified email at alum.mit.edu
Andrej BogdanovChinese University of Hong KongVerified email at cse.cuhk.edu.hk
Rafael PassTel-Aviv University, Cornell TechVerified email at cs.cornell.edu
Gil SegevProfessor of Computer Science, Hebrew UniversityVerified email at cs.stanford.edu
Ran CanettiProfessor of Computer Science, Boston UniversityVerified email at bu.edu
Moni NaorProfessor of Computer Science, Weizmann Institute of ScienceVerified email at weizmann.ac.il
Siyao GUONYU ShanghaiVerified email at nyu.edu
Nir BitanskyNew York UniversityVerified email at nyu.edu
Omer PanethMITVerified email at mit.edu
Pavel HubáčekCzech Academy of Sciences and Charles UniversityVerified email at iuuk.mff.cuni.cz
Silas RichelsonProfessor of Computer Science, UC RiversideVerified email at cs.ucr.edu
Danny HarnikIBM ResearchVerified email at il.ibm.com
Manoj PrabhakaranComputer Science and Engineering, IIT BombayVerified email at cse.iitb.ac.in
Marshall BallNew York UniversityVerified email at nyu.edu
Prashant Nalini VasudevanUniversity of California BerkeleyVerified email at berkeley.edu
Omer ReingoldStanford UniversityVerified email at stanford.edu
Erez PetrankViterbi Professor of Computer Science, Technion - Israel Institute of TechnologyVerified email at cs.technion.ac.il
Vadim LyubashevskyIBM Research Europe, ZurichVerified email at zurich.ibm.com
Abhishek BanerjeeGeorgia Institute of TechnologyVerified email at cc.gatech.edu
Manuel SabinUC BerkeleyVerified email at berkeley.edu

Alon Rosen

Bocconi University

Verified email at unibocconi.it - Homepage

cryptography computational complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Pseudorandom functions and lattices A Banerjee, C Peikert, A Rosen Annual International Conference on the Theory and Applications of …, 2012	625	2012
Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices C Peikert, A Rosen Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006 …, 2006	403	2006
SWIFFT: A modest proposal for FFT hashing V Lyubashevsky, D Micciancio, C Peikert, A Rosen Fast Software Encryption, 54-72, 2008	353	2008
Concurrent zero knowledge with logarithmic round-complexity M Prabhakaran, A Rosen, A Sahai Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE …, 2002	247	2002
Black-box concurrent zero-knowledge requires\ tilde {Ω}(log n) rounds R Canetti, J Kilian, E Petrank, A Rosen Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001	247*	2001
Chosen-ciphertext security via correlated products A Rosen, G Segev Theory of Cryptography: 6th Theory of Cryptography Conference, TCC 2009, San …, 2009	205	2009
New and improved constructions of non-malleable cryptographic protocols R Pass, A Rosen Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005	203	2005
On the existence of extractable one-way functions N Bitansky, R Canetti, O Paneth, A Rosen SIAM Journal on Computing 45 (5), 1910-1952, 2016	194*	2016
More constructions of lossy and correlation-secure trapdoor functions D Freeman, O Goldreich, E Kiltz, A Rosen, G Segev Public Key Cryptography–PKC 2010, 279-295, 2010	187	2010
Concurrent nonmalleable commitments R Pass, A Rosen SIAM Journal on Computing 37 (6), 1891-1925, 2008	180	2008
Proofs of Useful Work. M Ball, A Rosen, M Sabin, PN Vasudevan IACR Cryptol. ePrint Arch. 2017, 203, 2017	175	2017
On robust combiners for oblivious transfer and other primitives D Harnik, J Kilian, M Naor, O Reingold, A Rosen Advances in Cryptology–EUROCRYPT 2005, 559-559, 2005	160	2005
On the hardness of learning with rounding over small modulus A Bogdanov, S Guo, D Masny, S Richelson, A Rosen Theory of Cryptography Conference, 209-224, 2015	149	2015
On the cryptographic hardness of finding a Nash equilibrium N Bitansky, O Paneth, A Rosen 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1480-1498, 2015	138	2015
RIPPLE authentication for network coding Y Li, H Yao, M Chen, S Jaggi, A Rosen 2010 Proceedings IEEE INFOCOM, 1-9, 2010	132	2010
Fairness with an honest minority and a rational majority SJ Ong, DC Parkes, A Rosen, S Vadhan Theory of Cryptography: 6th Theory of Cryptography Conference, TCC 2009, San …, 2009	127	2009
Constant-round oblivious transfer in the bounded storage model YZ Ding, D Harnik, A Rosen, R Shaltiel Theory of Cryptography, 446-472, 2004	118	2004
Lattices that admit logarithmic worst-case to average-case connection factors C Peikert, A Rosen Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007	109	2007
Bounded-concurrent secure two-party computation in a constant number of rounds R Pass, A Rosen 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003	98	2003
One-way functions and (im) perfect obfuscation I Komargodski, T Moran, M Naor, R Pass, A Rosen, E Yogev 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 374-383, 2014	96*	2014

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors