Year |
Citation |
Score |
2017 |
Bogdanov A, Rosen A. Pseudorandom Functions: Three Decades Later Electronic Colloquium On Computational Complexity. 2017: 79-158. DOI: 10.1007/978-3-319-57048-8_3 |
0.542 |
|
2016 |
Bitansky N, Canetti R, Paneth O, Rosen A. On the Existence of Extractable One-Way Functions Siam Journal On Computing. 45: 1910-1952. DOI: 10.1137/140975048 |
0.621 |
|
2015 |
Applebaum B, Bogdanov A, Rosen A. A Dichotomy for Local Small-Bias Generators Journal of Cryptology. DOI: 10.1007/S00145-015-9202-8 |
0.329 |
|
2013 |
Bogdanov A, Rosen A. Input Locality and Hardness Amplification Journal of Cryptology. 26: 144-171. DOI: 10.1007/S00145-011-9117-Y |
0.44 |
|
2013 |
Freeman DM, Goldreich O, Kiltz E, Rosen A, Segev G. More constructions of lossy and correlation-secure trapdoor functions Journal of Cryptology. 26: 39-74. DOI: 10.1007/S00145-011-9112-3 |
0.667 |
|
2013 |
Pass R, Rosen A, Tseng WLD. Public-coin parallel zero-knowledge for NP Journal of Cryptology. 26: 1-10. DOI: 10.1007/S00145-011-9110-5 |
0.396 |
|
2010 |
Rosen A, Segev G. Chosen-ciphertext security via correlated products Siam Journal On Computing. 39: 3058-3088. DOI: 10.1137/100782929 |
0.649 |
|
2007 |
Ding YZ, Harnik D, Rosen A, Shaltiel R. Constant-Round Oblivious Transfer in the Bounded Storage Model Journal of Cryptology. 20: 165-202. DOI: 10.1007/S00145-006-0438-1 |
0.406 |
|
2006 |
Harnik D, Naor M, Reingold O, Rosen A. Completeness in two-party secure computation: A computational view Journal of Cryptology. 19: 521-552. DOI: 10.1007/S00145-006-0346-4 |
0.664 |
|
2005 |
Pass R, Rosen A. New and improved constructions of non-malleable cryptographic protocols Proceedings of the Annual Acm Symposium On Theory of Computing. 533-542. DOI: 10.1137/060671553 |
0.458 |
|
2005 |
Pass R, Rosen A. Concurrent non-malleable commitments Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2005: 563-572. DOI: 10.1137/060661880 |
0.441 |
|
2003 |
Canetti R, Kilian J, Petrank E, Rosen A. Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds Siam Journal On Computing. 32: 1-47. DOI: 10.1137/S0097539701392949 |
0.608 |
|
2002 |
Naor M, Reingold O, Rosen A. Pseudorandom functions and factoring Siam Journal On Computing. 31: 1383-1404. DOI: 10.1137/S0097539701389257 |
0.659 |
|
Show low-probability matches. |