Email: asharog (at) cs.biu.ac.il
Cryptography Research Group
Department of Computer Science
Bar-Ilan University Ramat Gan, 52900
I am a forth year Ph.D student in the
cryptography research group, Bar-Ilan university, under the supervision of Prof. Yehuda Lindell. My research interest is in the field of cryptography, with a focus on secure multiparty computation. I completed my M.Sc. degree at Bar-Ilan in 2009, under the supervision of Yehuda Lindell as well.
I spent Summer 2011 as an intern at the Cryptography Group at IBM Research T. J. Watson center, Hawthorne, NY.
You can find my Curriculum Vitae here.
Characterizing Complete Fairness in Secure Two-Party Computation
(to appear) TCC 2014
Gilad Asharov and Claudio Orlandi
Calling Out Cheaters: Covert Security with Public Verifiability
ASIACRYPT 2012, Springer-Verlag (LNCS 7658), pages 681-698, 2012.
Abhishek Jain, Adriana Lo'pez-Alt, Eran Tromer, Vinod Vaikuntanathan and Daniel Wichs,
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
, Springer-Verlag (LNCS 7237), pages 483-501, 2012. EUROCRYPT 2012
(Merge of [ AJW] and [ LTV])
Gilad Asharov and
A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation
An abbreviated version appears as a book chapter (invited) in Secure Multi-Party Computation
Yehuda Lindell and Tal Rabin,
Perfectly-Secure Multiplication for any t < n/3
, Springer-Verlag (LNCS 6841) pages 240-258, 2011. CRYPTO 2011
Ran Canetti and Carmit Hazay,
Towards a Game Theoretic View of Secure Computation
, Springer-Verlag (LNCS 6632), pages 426-445, 2011. EUROCRYPT 2011
Gilad Asharov and
Utility Dependence in Correct and Fair Rational Secret Sharing
, Springer-Verlag (LNCS 5677), pages 559-576, 2009. CRYPTO 2009
, Volume 24, Issue 1 (2011), pages: 157-202. Journal of Cryptology
[ ePrint] [ poster]
Please read the
Webpages for courses (in Hebrew):