Advisor: Prof. Yehuda Lindell

Email: asharog (at) cs.biu.ac.il
Cryptography Research Group
Department of Computer Science
Bar-Ilan University
Ramat Gan, 52900
Israel

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.

Publications

2013

• Gilad Asharov, Yehuda Lindell and Tal Rabin
  

  A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness

  
  TCC 2013 (to appear)
  [ePrint]
  
  

2012

• Gilad Asharov and Claudio Orlandi
  

  Calling Out Cheaters: Covert Security with Public Verifiability

  
  ASIACRYPT 2012, Springer-Verlag (LNCS 7658), pages 681-698, 2012.
  [ePrint]
  
  
• Gilad Asharov, Abhishek Jain, Adriana Lo'pez-Alt, Eran Tromer, Vinod Vaikuntanathan and Daniel Wichs,
  

  Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE

  
  EUROCRYPT 2012, Springer-Verlag (LNCS 7237), pages 483-501, 2012.
  (Merge of [AJW] and [LTV])
  
  

2011

• Gilad Asharov and Yehuda Lindell,
  

  A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation

  
  [eccc]
  
  
• Gilad Asharov, Yehuda Lindell and Tal Rabin,
  

  Perfectly-Secure Multiplication for any t < n/3

  
  CRYPTO 2011, Springer-Verlag (LNCS 6841) pages 240-258, 2011.
  [PDF]
  
  
• Gilad Asharov, Ran Canetti and Carmit Hazay,
  

  Towards a Game Theoretic View of Secure Computation

  
  EUROCRYPT 2011, Springer-Verlag (LNCS 6632), pages 426-445, 2011.
  [ePrint]
  

2009

• Gilad Asharov and Yehuda Lindell,
  

  Utility Dependence in Correct and Fair Rational Secret Sharing

  
  CRYPTO 2009, Springer-Verlag (LNCS 5677), pages 559-576, 2009.
  Journal of Cryptology, Volume 24, Issue 1 (2011), pages: 157-202.
  [ePrint] [poster]
  
  

Teaching

• 2013:

  • Semester A: (89-320) Complexity
  • Semester B: (89-120) Data Structures

• 2012:

  • Semester B: (89-120) Data Structures

• 2011:

  • Semester B: (89-120) Data Structures

• 2010:

  • Semester A: (89-656) Introduction to Cryptography
  • Semester B: (89-120) Data Structures