Hila Zarosim

PhD in Computer Science
Bar Ilan University
Dissertation Topic: The Complexity of Interactive Cryptographic Protocols. 

Journals:

• Yehuda Lindell, Hila Zarosim. 2011. Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. J. Cryptology 24(4): 761-799.

Articles in Conferences' Proceedings

• Yehuda Lindell, Eran Omri and Hila Zarosim: Completeness for Symmetric Two-Party Functionalities - Revisited.  In Xiaoyun Wang, Kazue Sako Editors. Lecture Notes in Computer Science 7658. Proceeding of Advances in Cryptology - ASIACRYPT 2012 - 18th International Conference on the Theory and Application of Cryptology and Information Security. December 2-6;  Beijing. China: Springer 2012. P. 116-133

• Yehuda Lindell and Hila Zarosim: Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. Proceedings of the 6th Annual Theory of Cryptography Conference (TCC). March 15-16; San Francisco. USA: Springer (LNCS 5444) 2009. P 183-201

• D. Avrahami-Zilberbrand, G. A. Kaminka and H. Zarosim. Fast and complete plan recognition: Allowing for duration, interleaved execution, and lossy observations. Proceedings of the IJCAI Workshop on Modeling Others from Observations (MOO-05). 2005.