Gilad Asharov

Department of Computer Science


Email:
firstname.lastname@biu.ac.il
Office:
Bulding 206 (Nano), office 537


biu-cyber-logo
none



Brief Biography and Research Interest


I am a faculty member at the department of Computer Science (senior lecturer, aka, assistant professor), and a member of the Bar-Ilan Center for Research in Applied Cryptography and Cyber Security. My research interest is in the field of cryptography with a focus on secure multiparty computation.

Short Bio:

In 2019, I was a Research Lead (Vice-President) at the AI Research group at J.P. Morgan (NY). In 2017-2018, I was a Simons Foundation Junior fellow at Cornell Tech (NY), hosted by Rafael Pass. In 2016, I was a post-doctoral researcher at the Cryptography Group, IBM TJ Watson Research Center (NY), and in 2015, I was an I-CORE postdoc fellow in the Hebrew University of Jerusalem, hosted by Gil Segev.
I finished my PhD in 2015, in Bar-Ilan university, where I was fortunate to have Yehuda Lindell as my advisor.

You can read about my research and the problems I deal with in the following interview.

My research is currently supported by the European Union's Horizon 2020 Framework Program (h2020) via Marie Sklodowska-Curie individual-fellowship (MSCA-IF) and by the Israel Science Foundation (ISF).




Publications


You can find here links to my records at:

DBLP Google Scholar



  Conference
  Journal
  Thesis
  Book chapter

2021
  • Optimal Oblivious Parallel RAM

    with Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, and Elaine Shi
    [ePrint, video]

  • Sorting Short Keys in Circuits of Size o(n log n)

    with Wei-Kai Lin and Elaine Shi
      ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021
    [arXiv]

2020
  • Oblivious Parallel Tight Compaction

    with Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, and Elaine Shi
      Information Theoretic Cryptography (ITC) 2020
    [ePrint]

  • OptORAMa: Optimal Oblivious RAM

    with Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, and Elaine Shi
      EUROCRYPT 2020
    [ePrint, video]

  • Privacy-Preserving Dark Pools

    with Tucker Balch, Antigoni Polychroniadou and Manuela Veloso
      AAMAS 2020
    [extended abstract]

  • Bucket Oblivious Sort: An Extremely Simple Oblivious Sort

    with T-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren and Elaine Shi
      Symposium on Simplicity in Algorithms (SOSA@SODA) 2020
    [arXiv]

2019
  • Locality Preserving Oblivious RAM

    with T-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren and Elaine Shi
     EUROCRYPT 2019
    [ePrint]

  • Blind Certificate Authorities

    with Liang Wang, Rafael Pass, Thomas Ristenpart and abhi shelat
      IEEE Symposium on Security & Privacy (S&P) 2019
    [ePrint]

  • On Perfect Correctness without Derandomization

    with Naomi Ephraim, Ilan Komargodski and Rafael Pass
    [ePrint]

2018
  • On the Complexity of Compressing Obfuscation

    with Naomi Ephraim, Ilan Komargodski and Rafael Pass
      CRYPTO 2018 
    [ePrint]

  • Tight Tradeoffs in Searchable Symmetric Encryption

    with Gil Segev and Ido Shahaf
      CRYPTO 2018 
      Journal Of Cryptology 
    [ePrint]

  • Privacy-Preserving Search of Similar Patients in Genomic Data

    with Shai Halevi, Yehuda Lindell and Tal Rabin
      Proceedings of Privacy Enhanced Technologies (PETS) 2018 
    [ePrint, video]

2017
  • Privacy-Preserving Interdomain Routing at Internet scale

    with Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, and Michael Zohner
      Proceedings of Privacy Enhanced Technologies (PETS) 2017 
    [ePrint]

  • Secure Centrality Computation Over Multiple Networks

    with Francesco Bonchi, David Garcia Soriano and Tamir Tassa
      WWW 2017 
    [PDF]

2016
  • Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations

    with Moni Naor, Gil Segev and Ido Shahaf
      STOC 2016 
    [ePrint, slides]

  • On Constructing One-Way Permutations from Indistinguishability Obfuscation

    with Gil Segev
      TCC 2016-A 
      Journal of Cryptology (2018) 
    [ePrint, slides, video]

2015
  • Limits on the Power of Indistinguishability Obfuscation and Functional Encryption

    with Gil Segev,
      FOCS 2015 
      SIAM Journal of Computing (2016) 
    [ePrint, slides, video]

  • More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries

    with Yehuda Lindell, Thomas Schneider and Michael Zohner,
      EUROCRYPT 2015 
      Journal of Cryptology (2017. combined with the CCS13 paper and available in ePrint)
    [ePrint, slides, video, code]

  • Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions

    with Amos Beimel, Nikolaos Makriyannis and Eran Omri,
      TCC 2015 
    [ePrint]
  • Foundations of Secure Computation: Perfect Security and Fairness

     Ph.D. Dissertation, Bar-Ilan University, 2015
    [PDF, hebrew intro]

2014
  • Towards Characterizing Complete Fairness in Secure Two-Party Computation

      TCC 2014 
    [ePrint, slides,video]

2013
  • More Efficient Oblivious Transfer and Extensions for Faster Secure Computation

    with Yehuda Lindell, Thomas Schneider and Michael Zohner,
      ACM CCS 2013 
      Journal of Cryptology (2017. Combined with the EUROCRYPT'15 paper and available in ePrint)
    [ePrint, slides, code]

  • Fair and Efficient Secure Multiparty Computation with Reputation Systems

    with Yehuda Lindell and Hila Zarosim,
      ASIACRYPT 2013 
    [ePrint, slides]

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

    with Yehuda Lindell and Tal Rabin,
      TCC 2013 
    [ePrint, slides]

2012
  • Calling Out Cheaters: Covert Security with Public Verifiability

    with Claudio Orlandi,
      ASIACRYPT 2012 
    [ePrint, slides]

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

    with Abhishek Jain, Adriana Lo'pez-Alt, Eran Tromer, Vinod Vaikuntanathan and Daniel Wichs,
      EUROCRYPT 2012 
    [ePrint, slides, video]

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

    with Yehuda Lindell,
      A book chapter (an abbreviated version, invited): Secure Multi-Party Computation
      Journal of Cryptology (2017)
    [ePrint]

  • Perfectly-Secure Multiplication for any t < n/3

    with Yehuda Lindell and Tal Rabin,
      CRYPTO 2011 
    [PDF, video]

  • Towards a Game Theoretic View of Secure Computation

    with Ran Canetti and Carmit Hazay,
      EUROCRYPT 2011 
      Journal of Cryptology (2016)
    [ePrint]

2009
  • Utility Dependence in Correct and Fair Rational Secret Sharing

    with Yehuda Lindell,
      CRYPTO 2009 
      Journal of Cryptology (2011)
    [ePrint, bibtex]

Competitions

2017
  • 1st Place:
    iDash Genomic Data Privacy and Security Protection Competition

    Track 1: De-duplication for Global Alliance for Genomics and Health (GA4GH)
    (with: Fabrice Benhamouda, Chitchanok Chuengsatiansup, Benny Pinkas, and Tal Rabin)
    iDash 2017

2016
  • 1st Place:
    iDash Genomic Data Privacy and Security Protection Competition

    Track 2: Privacy-Preserving Search of Similar Cancer Patients in Genomic Data
    (with: Shai Halevi, Shalev Keren, Meital Levy, Yehuda Lindell, and Tal Rabin)
    iDash 2016


Professional Activities


I co-organized:
I served as a program committee member in the following conferences:

Videos


Some of my talks have been filmed and can be found online (most of the talks are also given in the publication section above):

Teaching


I am organizing the Cyber Center Colloquium this year. Please join our mailing list and contact me if you are interested in giving a talk.

Current:

Introduction to Cryptography (89-656)



I was a teaching assistant in the following courses (given in the Department of Computer Science, Bar-Ilan University):
Data Structures (89-120): 2014, 2013, 2012, 2011, 2010,
Complexity (89-320): 2013,
Introduction to Cryptography (89-656): 2010.