Fine-grained cryptography is concerned with adversaries that are only moderately more powerful than the honest parties. We will survey recent results in this relatively underdeveloped area of study and examine whether the time is ripe for further advances in it.
Alon Rosen is a full professor at the School of Computer Science at the Herzliya Interdisciplinary Center.
His areas of expertise are in theoretical computer science and cryptography. He has made contributions to the foundational and practical study of zero-knowledge protocols, as well as fast lattice-based cryptography, most notably in the context of collision resistant hashing and pseudo-random functions. In this context he co-introduced the ring-SIS problem and related SWIFFT hash function, as well as the Learning with Rounding problem. More recently he has been focusing on the study of the cryptographic hardness of finding a Nash equilibrium and on fine-grained cryptography.
Alon earned his PhD from the Weizmann Institute of Science (Israel) in 2003, and was a Postdoctoral Fellow at MIT (USA) in the years 2003-2005 and at Harvard University (USA) in the years 2005-2007. He is a faculty member at IDC since 2007.