Alon Rosen

Alon Rosen                           

E-Mail:

Address: Bocconi University, 3-E2-12,    

                   Via Roentgen 1,

                 20136 Milan, Italy

                                                                                 


Academic Profile

I am a professor in the Department of Computing Sciences at Bocconi University.

My Ph.D. is from the Weizmann Institute of Science. I spent two years as a postdoc in the Cryptography Group of MIT's Computer Science and AI Lab, two years as a postdoc in the Center for Research on Computation and Society at Harvard's department of Electrical Engineering and Computer Science and fourteen years at Reichman University (on leave).

My main fields of interest are Cryptography and Computational Complexity.

I am a founder of the FACT center and of the CIFRA institute.

 
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.
EUROCRYPT 2015. April 26-30, 2015, Sofia, Bulgaria.
TCC 2016-B. November 1-3, 2016, Beijing, China.
FSTTCS 2017. December 11-15, 2017, Kanpur, India.
EUROCRYPT 2018. April 29-May 3, 2018, Tel Aviv, Israel.
ICALP 2018. July 9-13, 2018, Prague, Czech Republic.
TCC 2018. November 12-14, 2018, Goa, India.
TCC 2019. December 1-4, 2019, Nürnberg, Germany, progam co-chair.
CRYPTO 2020. August 16-20, 2020, Santa Barbara, CA.
TCC 2020. November 15-19, 2020, Virtual.
TCC 2021. November 8-11, 2021, Raleigh, NC.
TCC 2022. November 7-10, 2022, Chicago, IL.
STOC 2023. June 17-23, 2023, Orlando, FL.
CRYPTO 2024. August 17-22, 2024, Santa Barbara, CA.
TCC 2024. December 2-6, 2024, Milan, Italy.
EUROCRYPT 2025. May 4-8, 2025, Madrid, Spain.

 
Books and Book Chapters

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

  • Andrej Bogdanov and Alon Rosen. Pseudorandom Functions: Three Decades Later.
    Tutorials on the Foundations of Cryptography. Springer-Verlag, 2017.

  • Dennis Hofheinz and Alon Rosen (editors). Theory of Cryptography.
    17th International Conference, TCC 2019, Proceedings, Parts I and II. Springer, 2019.


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 (Test of Time Award, 2017). 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. Invited to JofC special issue of selected papers from 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. Invited to JofC special issue of selected papers from 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. Pdf.

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

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

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

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

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

  • Nir Bitansky, Ran Canetti, Henry Cohn, Shafi Goldwasser, Yael Tauman Kalai, Omer Paneth and Alon Rosen. The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator. In CRYPTO 2014. Pdf.

  • Hai Brenner, Lubos Gaspar, Gaetan Leurent, Alon Rosen and Francois-Xavier Standaert. FPGA implementations of SPRING (And their Countermeasures against Side-Channel Attacks). In CHES 2014.

  • Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen and Eylon Yogev. One-Way Functions and (Im)perfect Obfuscation. In FOCS 2014. Pdf.

  • Vipul Goyal, Silas Richelson, Alon Rosen and Margarita Vald. An Algebraic Approach to Non-Malleability. In FOCS 2014. Pdf.

  • Siyao Guo, Tal Malkin, Igor C. Oliveira and Alon Rosen. The Power of Negations in Cryptography. In TCC 2015. Pdf.

  • Giulia Alberini, Tal Moran and Alon Rosen Public Verification of Private Effort. In TCC 2015. Pdf.

  • Brett Hemenway, Rafail Ostrovsky and Alon Rosen Non-Committing Encryption from Phi-Hiding. In TCC 2015. Pdf.

  • Nir Bitansky, Omer Paneth and Alon Rosen. On the Cryptographic Hardness of Finding a Nash Equilibrium. In FOCS 2015. Pdf.

  • Hai Brenner, Vipul Goyal, Silas Richelson, Alon Rosen and Margarita Vald. Fast Non-Malleable Commitments. In CCS 2015.

  • Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson and Alon Rosen. On the Hardness of Learning with Rounding over Small Modulus. In TCC 2016-A. Pdf.

  • Brett Hemenway, Rafail Ostrovsky, Silas Richelson and Alon Rosen. Adaptive Security with Quasi-Optimal Rate. In TCC 2016-A.

  • Siyao Guo, Pavel Hubacek, Alon Rosen and Margarita Vald. Rational Sumchecks. In TCC 2016-A. Pdf.

  • Marshall Ball, Alon Rosen, Manuel Sabin and Prashant Nalini Vasudevan. Average-Case Fine-Grained Hardness. In STOC 2017. Pdf.

  • Shweta Agrawal and Alon Rosen. Functional Encryption for Bounded Collusions, Revisited. In TCC 2017. Pdf.

  • Alon Rosen, Gil Segev and Ido Shahaf. Can PPAD Hardness be Based on Standard Cryptographic Assumptions? In TCC 2017. Pdf.

  • Pavel Hubacek, Alon Rosen and Margarita Vald. An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge. In EUROCRYPT 2018. Pdf.

  • Marshall Ball, Alon Rosen, Manuel Sabin and Prashant Nalini Vasudevan. Proofs of Work from Worst-Case Assumptions. In CRYPTO 2018. Pdf.

  • Elette Boyle, Saleet Klein, Alon Rosen and Gil Segev. Securing Abe's Mix-net Against Malicious Verifiers via Witness Indistinguishability. In SCN 2018. Pdf.

  • Arka Rai Choudhuri, Pavel Hubacek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen and Guy N. Rothblum. Finding a Nash Equilibrium is No Easier than Breaking Fiat-Shamir. In STOC 2019. Pdf.

  • Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, and Prashant Vasudevan. Cryptography from Information Loss. In ITCS 2020. Pdf.

  • Siyao Guo, Pritish Kamath, Alon Rosen, and Katerina Sotiraki. Limits on the Efficiency of (Ring) LWE based Non-Interactive Key Exchange. In PKC 2020. Invited to JofC special issue of selected papers from PKC 2020. Pdf.

  • Alon Rosen. Fine-Grained Cryptography: A New Frontier? Invited talk at EUROCRYPT 2020. Pdf.

  • Shweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod Prabhakaran, and Alon Rosen. Cryptography from One-Way Communication: On Completeness of Finite Channels. In ASIACRYPT 2020.

  • Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, and Alon Rosen. Non-interactive Composition of Sigma-Protocols via Share-then-Hash. In ASIACRYPT 2020. Pdf.

  • Alexander Block, Justin Holmgren, Alon Rosen, Ron Rothblum, and Pratik Soni. Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. In TCC 2020. Pdf.

  • Shweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod Prabhakaran, and Alon Rosen. Secure Computation from One-Way Noisy Communication, or: Anti-Correlation via Anti-Concentration. In CRYPTO 2021.

  • Alexander Block, Justin Holmgren, Alon Rosen, Ron Rothblum, and Pratik Soni. Time- and Space-Efficient Arguments from Groups of Unknown Order. In CRYPTO 2021. Pdf.

  • Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, and Alon Rosen. Acyclicity Programming for Sigma-Protocols. In TCC 2021. Pdf.

  • Andrej Bogdanov, Miguel Cueto Noval. Charlotte Hoffman, and Alon Rosen. Public-Key Encryption from Homogeneous CLWE. In TCC 2022. Invited to JofC special issue of selected papers from TCC 2022. Pdf.

  • Romain Bourneuf, Lukáš Folwarczný, Pavel Hubáček, Alon Rosen, and Nikolaj Schwartzbach . PPP-Completeness and Extremal Combinatorics. In ITCS 2023. Pdf.

  • Prahladh Harsha, Daniel Mitropolsky, and Alon Rosen. Downward Self-Reducibility in TFNP. In ITCS 2023. Pdf.

  • Andrej Bogdanov, and Alon Rosen. Nondeterministic Interactive Refutations for Nearest Boolean Vector. In ICALP 2023. Pdf.

  • Andrej Bogdanov, Pravesh Kothari, and Alon Rosen. Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method. In TCC 2023. Pdf.

  • Masayuki Abe, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen, Zehua Shang, and Mehdi Tibouchi. CDS Composition of Multi-Round Protocols. In CRYPTO 2024.

  • Tamer Mour, Alon Rosen, and Ron Rothblum. Locally Testable Tree Codes. Pdf.

  • Andrej Bogdanov, Chris Jones, Alon Rosen, and Ilias Zadik. Low-degree Security of the Planted Random Subgraph Problem.


Ph.D. Thesis

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