Follow
Alon Rosen
Alon Rosen
Verified email at unibocconi.it - Homepage
Title
Cited by
Cited by
Year
Pseudorandom functions and lattices
A Banerjee, C Peikert, A Rosen
Advances in Cryptology–EUROCRYPT 2012: 31st Annual International Conference …, 2012
4872012
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
3472006
SWIFFT: A modest proposal for FFT hashing
V Lyubashevsky, D Micciancio, C Peikert, A Rosen
Fast Software Encryption, 54-72, 2008
3042008
Concurrent zero knowledge with logarithmic round-complexity
M Prabhakaran, A Rosen, A Sahai
Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE …, 2002
2402002
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
237*2001
Chosen-ciphertext security via correlated products
A Rosen, G Segev
Theory of Cryptography: 6th Theory of Cryptography Conference, TCC 2009, San …, 2009
1972009
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
1932005
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
1782010
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
177*2016
Concurrent nonmalleable commitments
R Pass, A Rosen
SIAM Journal on Computing 37 (6), 1891-1925, 2008
1682008
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
1402005
Proofs of Useful Work.
M Ball, A Rosen, M Sabin, PN Vasudevan
IACR Cryptol. ePrint Arch. 2017, 203, 2017
1302017
RIPPLE authentication for network coding
Y Li, H Yao, M Chen, S Jaggi, A Rosen
2010 Proceedings IEEE INFOCOM, 1-9, 2010
1272010
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
1252015
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
1212009
On the hardness of learning with rounding over small modulus
A Bogdanov, S Guo, D Masny, S Richelson, A Rosen
Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv …, 2015
1192015
Constant-round oblivious transfer in the bounded storage model
YZ Ding, D Harnik, A Rosen, R Shaltiel
Theory of Cryptography, 446-472, 2004
1132004
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
982007
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
932003
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
86*2014
The system can't perform the operation now. Try again later.
Articles 1–20