Alon Rosen

Citado por

	Total	Desde 2019
Citas	6020	2652
Índice h	39	27
Índice i10	63	49

460

230

115

345

20012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202423 28 46 32 50 75 81 130 170 194 174 271 264 305 295 362 359 412 454 450 439 459 431 413

Acceso público

Ver todo

39 artículos

1 artículo

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Chris PeikertProfessor, Computer Science and Engineering, University of MichiganDirección de correo verificada de alum.mit.edu
Andrej BogdanovChinese University of Hong KongDirección de correo verificada de cse.cuhk.edu.hk
Rafael PassTel-Aviv University, Cornell TechDirección de correo verificada de cs.cornell.edu
Gil SegevProfessor of Computer Science, Hebrew UniversityDirección de correo verificada de cs.stanford.edu
Ran CanettiProfessor of Computer Science, Boston UniversityDirección de correo verificada de bu.edu
Moni NaorProfessor of Computer Science, Weizmann Institute of ScienceDirección de correo verificada de weizmann.ac.il
Siyao GUONYU ShanghaiDirección de correo verificada de nyu.edu
Nir BitanskyNew York University and Tel Aviv UniversityDirección de correo verificada de nyu.edu
Omer PanethMITDirección de correo verificada de mit.edu
Pavel HubáčekCzech Academy of Sciences and Charles UniversityDirección de correo verificada de iuuk.mff.cuni.cz
Silas RichelsonProfessor of Computer Science, UC RiversideDirección de correo verificada de cs.ucr.edu
Danny HarnikIBM ResearchDirección de correo verificada de il.ibm.com
Manoj PrabhakaranComputer Science and Engineering, IIT BombayDirección de correo verificada de cse.iitb.ac.in
Marshall BallNew York UniversityDirección de correo verificada de nyu.edu
Prashant Nalini VasudevanUniversity of California BerkeleyDirección de correo verificada de berkeley.edu
Omer ReingoldStanford UniversityDirección de correo verificada de stanford.edu
Vadim LyubashevskyIBM Research Europe, ZurichDirección de correo verificada de zurich.ibm.com
Erez PetrankViterbi Professor of Computer Science, Technion - Israel Institute of TechnologyDirección de correo verificada de cs.technion.ac.il
Abhishek BanerjeeGeorgia Institute of TechnologyDirección de correo verificada de cc.gatech.edu
Manuel SabinUC BerkeleyDirección de correo verificada de berkeley.edu

Seguir

Alon Rosen

Bocconi University

Dirección de correo verificada de unibocconi.it - Página principal

cryptography computational complexity


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
Pseudorandom functions and lattices A Banerjee, C Peikert, A Rosen Annual International Conference on the Theory and Applications of …, 2012	640	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	415	2006
SWIFFT: A modest proposal for FFT hashing V Lyubashevsky, D Micciancio, C Peikert, A Rosen Fast Software Encryption, 54-72, 2008	362	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	249	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	248*	2001
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	206	2005
Chosen-ciphertext security via correlated products A Rosen, G Segev Theory of Cryptography: 6th Theory of Cryptography Conference, TCC 2009, San …, 2009	205	2009
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	197*	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	182	2008
Proofs of Useful Work. M Ball, A Rosen, M Sabin, PN Vasudevan IACR Cryptol. ePrint Arch. 2017, 203, 2017	179	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	164	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	153	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	142	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	119	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	112	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	97*	2014

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores