Alon Rosen                          

E-Mail:

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

                 Kanfei Nesharim St., Herzliya 46150, Israel

                                                                                 


Academic Profile

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.

New: I am happy to announce the opening of the FACT center.

 
Conferences (PC Member)

TCC 2005. February 10-12, 2005, Cambridge, MA.
EUROCRYPT 2007. May 20-24, 2007, Barcelona, Spain.
CRYPTO 2008. August 17-21, 2008, Santa Barbara, CA.
EVT/WOTE 2009. August 10-14, 2009, Montreal, Canada.
TCC 2010. February 9-11, 2010, Zurich, Switzerland.
PKC 2010. May 26-28, 2010, Paris, France.
PKC 2012. May 21-23, 2012, Darmstadt, Germany.
SCN 2012. Sep 5-7, 2012, Amalfi, Italy.
TCC 2013. March -11, 2013, Tokyo, Japan.
ASIACRYPT 2014. December 7-11, 2014, Kaohsiung, Taiwan.

 
Books

Alon Rosen. Concurrent Zero-Knowledge.
Series on Information Security and Cryptography. Springer-Verlag, 2006.

 
Publications

  • 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.

  • Shien Jin Ong, David Parkes, Alon Rosen and Salil Vadhan. Fairness with an Honest Minority and a Rational Majority. In TCC 2009. pdf. An older version. An even older version.

  • Alon Rosen and Gil Segev. Chosen Ciphertext Security via Correlated Products. In TCC 2009. Pdf.

  • Iftach Haitner, Alon Rosen and Ronen Shaltiel. On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. 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.

  • Yaping Li, Hongyi Yao, Minghua Chen, Sidarth Jaggi, and Alon Rosen. RIPPLE Authentication for Network Coding. In INFOCOM 2010.

  • David Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, and Gil Segev. More Constructions of Lossy and Correlation-Secure Trapdoor Functions. In PKC 2010. Pdf. An older version.

  • Ronen Gradwohl, Noam Livne, and Alon Rosen. Sequential Rationality in Cryptographic Protocols. In FOCS 2010. Pdf.

  • Alon Rosen and abhi shelat. Optmistic Concurrent Zero-Knowledge. In ASIACRYPT 2010. Pdf.

  • Andrej Bogdanov and Alon Rosen. Input Locality and Hardness Amplification. In TCC 2011. Pdf.

  • Abhishek Bhanerjee, Chris Peikert and Alon Rosen. Pseudorandom Functions and Lattices. In EUROCRYPT 2012. Pdf.

  • Krzysztof Pietrzak, Alon Rosen and Gil Segev. Lossy Functions Do Not Amplify Well. In TCC 2012. Pdf.

  • Benny Applebaum, Andrej Bogdanov and Alon Rosen. A Dichotomy for Local Small-Bias Generators. In TCC 2012. Pdf.

  • Pavel Hubacek, Jesper Buus Nielsen and Alon Rosen Limits on the Power of Cryptographic Cheap Talk. In CRYPTO 2013 .

  • Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath and Alon Rosen. Candidate Weak Pseudorandom Functions in AC0 o MOD2. In ITCS 2014 .

  • Siyao Guo, Pavel Hubacek, Alon Rosen and Margarita Vald. Rational Arguments: Single Round Delegation with Sublinear Verification. In ITCS 2014 .

  • Shashank Agrawal, Prabhanjan Ananth, Vipul Goyal, Manoj Prabhakharan and Alon Rosen. Lower Bounds in the Hardware Token Model. In TCC 2014 .

  • Abhishek Banerjee, Hai Brenner, Gaan Leurent, Chris Peikert and Alon Rosen. SPRING: Fast Pseudorandom Functions from Rounded Ring Products. In FSE 2014 .

  • Nir Bitansky, Ran Canetti, Omer Paneth and Alon Rosen, On the Existence of Extractable One-Way Functions. In STOC 2014 .

  • Giulia Alberini, Tal Moran and Alon Rosen. Verifiable Anonymous Polling. Manuscript, 2014.


Ph.D. Thesis

The Round-Complexity of Black-Box Concurrent Zero-Knowledge.
Weizmann Institute of Science, 2003. Postscript.