Alon Rosen                          

Telephone: +972 9 960 2827
Address: The Interdisciplinary Center, P.O.Box 167,   

                 Kanfei Nesharim St., Herzliya 46150, Israel

I am a faculty member in the School of Computer Science at the Herzliya Interdisciplinary Center.

Before that I spent two years as a postdoc in the Cryptography Group of MIT's Computer Science and AI Lab, and two years as a postdoc in the Center for Research on Computation and Society at Harvard's department of Electrical Engineering and Computer Science.

I did my Ph.D. at the Weizmann Institute of Science, under the supervision of Oded Goldreich and Moni Naor. I graduated in 2003.

My main fields of interest are Cryptography and Computational Complexity.

• Moni Naor, Omer Reingold and Alon Rosen. Pseudo Random Functions and Factoring. In SICOMP, 2002. Preliminary version in STOC00. Postscript.
  
  
• Alon Rosen. A Note on the Round-Complexity of Concurrent Zero-Knowledge.
  In Crypto00. Postscript.
  
  
• Ran Canetti, Joe Kilian, Erez Petrank and Alon Rosen. Black-Box Concurrent Zero-Knowledge Requires (almost) Logarithmically Many Rounds. In SICOMP, 2002. Preliminary version in STOC01. Postscript.
  
  
• Manoj Prabhakaran, Alon Rosen and Amit Sahai. Concurrent Zero-Knowledge with Logarithmic Round Complexity. In FOCS02. Postscript.
  
  
• Rafael Pass and Alon Rosen. Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. In FOCS03. Postscript.
  
  
• Yan Zong Ding, Danny Harnik, Ronen Shaltiel and Alon Rosen. Constant-Round Oblivious Transfer in the Bounded-Storage Model. In TCC04. Postscript.
  
  
• Alon Rosen. A Note on Constant Round Zero Knowledge Proofs for NP. In TCC04. Postscript.
  
  
• Danny Harnik, Moni Naor, Omer Reingold and Alon Rosen. Completeness in Two-Party Secure Computation - A Computational View. In STOC04. Postscript.
  
  
• Rafael Pass and Alon Rosen. New and Improved Constructions of Non-Malleable Cryptographic Protocols. In STOC05. Invited to SICOMP special issue of selected papers from STOC05. Pdf.
  
  
• Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold and Alon Rosen. On Robust Combiners for Oblivious Transfer and other Primitives. In Eurocrypt05. Postscript.
  
  
• Rafael Pass and Alon Rosen. Concurrent Non-Malleable Commitments. In FOCS05. Invited to SICOMP special issue of selected papers from FOCS05. Postscript.
  
  
• Chris Peikert and Alon Rosen. Efficient Collision-Resistant Hashing From Worst-Case Assumptions on Cyclic Lattices. In TCC06. Postscript.
  
  
• Silvio Micali, Rafael Pass and Alon Rosen. Input-Indistinguishable Computation. In FOCS06. Pdf.
  
  
• Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert and Alon Rosen. Provably Secure FFT Hashing. In 2nd NIST Cryptographic Hash Function Workshop, 2006. Pdf.
  
  
• Chris Peikert and Alon Rosen. Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. In STOC07. Pdf.
  
  
• Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert and Alon Rosen. SWIFFT: A modest Proposal for FFT Hashing. In FSE 2008. Pdf.
  
  
• Alon Rosen and Gil Segev. Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption. Manuscript, 2008. Pdf.
  
  
• Shien Jin Ong, David Parkes, Alon Rosen and Salil Vadhan. Fairness with an Honest Minority and a Rational Majority. To appear in TCC 2009. pdf. An older version. An even older version.
  
  
• Alon Rosen and Gil Segev. Chosen Ciphertext Security via Correlated Products. To appear in TCC 2009. Pdf.
  
  
• Iftach Haitner, Alon Rosen and Ronen Shaltiel. On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. To appear in TCC 2009.
  
  
• Yuriy Arbitman, Gil Dogon, Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert and Alon Rosen. SWIFFTX: A Proposal for the SHA-3 Standard. Pdf.