Alon Rosen

Cited by

	All	Since 2016
Citations	4114	2019
h-index	33	26
i10-index	52	46

460

230

115

345

20012002200320042005200620072008200920102011201220132014201520162017201820192020202119 23 50 30 50 67 82 129 167 188 182 251 234 286 282 361 348 404 440 458 7

Co-authors

Chris PeikertAssociate Professor, Computer Science and Engineering, University of MichiganVerified email at alum.mit.edu
Ran CanettiProfessor of Computer Science, Boston UniversityVerified email at bu.edu
Gil SegevAssociate Professor of Computer Science, Hebrew UniversityVerified email at cs.stanford.edu
Siyao GUONYU ShanghaiVerified email at nyu.edu
Andrej BogdanovChinese University of Hong KongVerified email at cse.cuhk.edu.hk
Nir BitanskyTel Aviv UniversityVerified email at tau.ac.il
Omer PanethMITVerified email at mit.edu
Moni NaorProfessor of Computer Science, Weizmann Institute of ScienceVerified email at weizmann.ac.il
Danny HarnikIBM Research - HaifaVerified email at il.ibm.com
Erez PetrankProfessor of Computer Science, Technion - Israel Institute of TechnologyVerified email at cs.technion.ac.il
Daniele MicciancioProfessor of computer science, UCSDVerified email at eng.ucsd.edu
Manoj PrabhakaranComputer Science and Engineering, IIT BombayVerified email at cse.iitb.ac.in
Omer ReingoldStanford UniversityVerified email at stanford.edu
Vadim LyubashevskyIBM Research - ZurichVerified email at zurich.ibm.com
Pavel HubáčekCharles UniversityVerified email at iuuk.mff.cuni.cz
Marshall BallUniversity of WashingtonVerified email at cs.columbia.edu
Prashant Nalini VasudevanUniversity of California BerkeleyVerified email at berkeley.edu
Abhishek BanerjeeGeorgia Institute of TechnologyVerified email at cc.gatech.edu
Manuel SabinUC BerkeleyVerified email at berkeley.edu
Ronen ShaltielProfessor of Computer Science, University of HaifaVerified email at cs.haifa.ac.il

Alon Rosen

Professor of Computer Science, IDC Herzliya

Verified email at idc.ac.il - 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	328	2012
Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices C Peikert, A Rosen Theory of Cryptography Conference, 145-166, 2006	278	2006
SWIFFT: A modest proposal for FFT hashing V Lyubashevsky, D Micciancio, C Peikert, A Rosen Fast Software Encryption, 54-72, 2008	268	2008
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	227*	2001
Concurrent zero knowledge with logarithmic round-complexity M Prabhakaran, A Rosen, A Sahai Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE …, 2002	215	2002
Chosen-ciphertext security via correlated products A Rosen, G Segev Theory of Cryptography Conference, 419-436, 2009	180	2009
New and improved constructions of nonmalleable cryptographic protocols R Pass, A Rosen SIAM Journal on Computing 38 (2), 702-752, 2008	164	2008
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	160	2010
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	137*	2016
Concurrent nonmalleable commitments R Pass, A Rosen SIAM Journal on Computing 37 (6), 1891-1925, 2008	137	2008
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	120	2005
RIPPLE authentication for network coding Y Li, H Yao, M Chen, S Jaggi, A Rosen 2010 Proceedings IEEE INFOCOM, 1-9, 2010	112	2010
Fairness with an honest minority and a rational majority SJ Ong, DC Parkes, A Rosen, S Vadhan Theory of Cryptography Conference, 36-53, 2009	112	2009
Constant-round oblivious transfer in the bounded storage model YZ Ding, D Harnik, A Rosen, R Shaltiel Theory of Cryptography, 446-472, 2004	99	2004
Proofs of work from worst-case assumptions M Ball, A Rosen, M Sabin, PN Vasudevan Annual International Cryptology Conference, 789-819, 2018	96*	2018
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, 2016	94	2016
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	93	2007
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	86	2015
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	86	2003
A note on the round-complexity of concurrent zero-knowledge A Rosen Annual International Cryptology Conference, 451-468, 2000	75	2000

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

Upload PDF

Follow this author

Cited by

Co-authors