Alon Rosen |
|
|---|---|
Author's Web Page  | |
| 17 papers and 1 book in database with 497 citations  H-number: 11 | |
Books |
|
 | 1. Alon Rosen, Concurrent Zero-Knowledge. Springer, 2006. ISBN 978-3-540-32938-1. Find this book on amazon.com , amazon.co.uk  , amazon.ca , amazon.de , amazon.fr , Google Books or Wikipedia.[  Cited
1 times
] |
Journal Papers |
|
| 1. Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel, Constant-Round Oblivious Transfer in the Bounded Storage Model, Journal of Cryptology,
Volume 20(2), pp. 165 - 202,
Springer, 2007. [ Cited
34 times
] | |
| 2. Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen, Completeness in Two-Party Secure Computation: A Computational View, Journal of Cryptology,
Volume 19(4), pp. 521 - 552,
Springer, 2006. [ Cited
7 times
] | |
Conference Papers |
|
| 1. Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan, Fairness with an Honest Minority and a Rational Majority, pp. 36 - 53, TCC 2009. [  Electronic
Edition][Cited
13 times
] | |
| 2. Iftach Haitner, Alon Rosen, Ronen Shaltiel, On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols, pp. 220 - 237, TCC 2009. [ Electronic
Edition][Cited
7 times
] | |
| 3. Alon Rosen, Gil Segev, Chosen-Ciphertext Security via Correlated Products, pp. 419 - 436, TCC 2009. [ Electronic
Edition][Cited
30 times
] | |
| 4. Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen, SWIFFT: A Modest Proposal for FFT Hashing, pp. 54 - 72, FSE 2008. [ Electronic
Edition][Cited
40 times
] | |
| 5. Chris Peikert, Alon Rosen, Lattices that admit logarithmic worst-case to average-case connection factors, pp. 478 - 487, STOC 2007. [ Electronic
Edition][Cited
22 times
] | |
| 6. Silvio Micali, Rafael Pass, Alon Rosen, Input-Indistinguishable Computation, pp. 367 - 378, FOCS 2006. [ Electronic
Edition][Cited
11 times
] | |
| 7. Chris Peikert, Alon Rosen, Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices, pp. 145 - 166, TCC 2006. [ Electronic
Edition][ IACR Online
Archive ][Cited
52 times
 ] | |
| 8. Rafael Pass, Alon Rosen, New and improved constructions of non-malleable cryptographic protocols, pp. 533 - 542, STOC 2005. [ Electronic
Edition][Cited
47 times
] | |
| 9. Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen, On Robust Combiners for Oblivious Transfer and Other Primitives, pp. 96 - 113, EUROCRYPT 2005. [ Electronic
Edition][IACR Online
Archive][Cited
42 times
] | |
| 10. Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen, Completeness in two-party secure computation: a computational view, pp. 252 - 261, STOC 2004. [ Electronic
Edition][Cited
8 times
] | |
| 11. Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel, Constant-Round Oblivious Transfer in the Bounded Storage Model, pp. 446 - 472, TCC 2004. [ Electronic
Edition][Cited
42 times
] | |
| 12. Alon Rosen, A Note on Constant-Round Zero-Knowledge Proofs for NP, pp. 191 - 202, TCC 2004. [ Electronic
Edition][Cited
11 times
] | |
| 13. Rafael Pass, Alon Rosen, Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds, pp. 404 - 404, FOCS 2003. [ Electronic
Edition][Cited
45 times
] | |
| 14. Manoj Prabhakaran, Alon Rosen, Amit Sahai, Concurrent Zero Knowledge with Logarithmic Round-Complexity, pp. 366 - 375, FOCS 2002. [ Electronic
Edition][Cited
84 times
] | |
| 15. Alon Rosen, A Note on the Round-Complexity of Concurrent Zero-Knowledge, pp. 451 - 468, CRYPTO 2000. [ Electronic
Edition][IACR Online
Archive][Cited
42 times
] | |
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals