פרופ' אלון רוזן

בית ספר אפי ארזי למדעי המחשב Ph.D., מכון ויצמן למדע

  • פרופ' אלון רוזן עבד שנתיים כחוקר פוסט-דוקטורט במעבדות מדעי המחשב ובינה מלאכותית ב-MIT ושנתיים נוספות של פוסט-דוקטורט שימש כחוקר במחלקה להנדסת חשמל באוניברסיטת הרווארד. הצטרף למרכז הבינתחומי בשנת 2007. מחקריו עוסקים בנושאים שונים בתאוריה של מדעי המחשב, בפרט קריפטוגרפיה וסיבוכיות חישובית.

  • Moni Naor, Omer Reingold and Alon Rosen. Pseudo Random Functions and Factoring. In SICOMP, 2002. Preliminary version in STOC00.


    Alon Rosen. A Note on the Round-Complexity of Concurrent Zero-Knowledge.
    In Crypto00


    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


    Manoj Prabhakaran, Alon Rosen and Amit Sahai. Concurrent Zero-Knowledge with Logarithmic Round Complexity. In FOCS02.


    Rafael Pass and Alon Rosen. Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. In FOCS03.


    Yan Zong Ding, Danny Harnik, Ronen Shaltiel and Alon Rosen. Constant-Round Oblivious Transfer in the Bounded-Storage Model. In TCC04


    Alon Rosen. A Note on Constant Round Zero Knowledge Proofs for NP. In TCC04.


    Danny Harnik, Moni Naor, Omer Reingold and Alon Rosen. Completeness in Two-Party Secure Computation - A Computational View. In STOC04.


    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.


    Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold and Alon Rosen. On Robust Combiners for Oblivious Transfer and other Primitives. In Eurocrypt05.


    Rafael Pass and Alon Rosen. Concurrent Non-Malleable Commitments. In FOCS05. Invited to SICOMP special issue of selected papers from FOCS05.


    Chris Peikert and Alon Rosen. Efficient Collision-Resistant Hashing From Worst-Case Assumptions on Cyclic Lattices. In TCC06


    Silvio Micali, Rafael Pass and Alon Rosen. Input-Indistinguishable Computation. In FOCS06


    Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert and Alon Rosen. Provably Secure FFT Hashing. In 2nd NIST Cryptographic Hash Function Workshop, 2006.


    Chris Peikert and Alon Rosen. Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. In STOC07.


    Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert and Alon Rosen. SWIFFT: A modest Proposal for FFT Hashing. In FSE 2008.


    Shien Jin Ong, David Parkes, Alon Rosen and Salil Vadhan. Fairness with an Honest Minority and a Rational Majority. In TCC 2009.


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


    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.


    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.


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


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


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