Gilad Asharov

Department of Computer Science


Email:
firstname.lastname@biu.ac.il
Office:
Building 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.
You can read about my research and the problems I deal with in the following interview.

Short Bio:
I joined Bar-Ilan's faculty in 2019 after spending four years in NY (IBM TJ Watson Center, Cornell Tech, and JPM AI Research). I finished my Ph.D. in 2015 at Bar-Ilan University, where I was fortunate to have Yehuda Lindell as my advisor.




Publications


You can find here links to my records at:

DBLP Google Scholar



  Conference
  Journal
  Thesis
  Book chapter

2023
  1. FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM

    with Ilan Komargodski and Yehuda Michelson
      ACM CCS 2023
    [ePrint,code]
    Distinguished Paper Award

  2. Secure Statistical Analysis on Multiple Datasets: Join and Group-By

    with Koki Hamada, Ryo Kikuchi, Ariel Nof, Benny Pinkas and Junichi Tomida
      ACM CCS 2023

  3. Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time

    with Ittai Abraham, Shravani Patil, Arpita Patra
      EUROCRYPT 2023
    [ePrint]

  4. Prime Match: A Privacy Preserving Inventory Matching System

    with Antigoni Polychroniadou, Benjamin Diamond, Tucker Balch, Hans Buehler, Richard Hua, Greg Gimler, Suwen Gu, Manuela Veloso
      USENIX 2023
    [ePrint]

2022
  1. Asymptotically Free Broadcast in Constant Expected Time via Packed VSS

    with Ittai Abraham, Shravani Patil, Arpita Patra
      TCC 2022
    [ePrint, video]

  2. Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters

    with Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Katsumi Takahashi, Junichi Tomida
      ACM CCS 2022
    [ePrint]

  3. Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security

    with Ittai Abraham
      PODC 2022
    [ePrint]

  4. Static vs. Adaptive in Perfect MPC: A Separation and the Adaptive Security of BGW

    with Ran Cohen and Oren Shochat
      ITC 2022: Information Theoretic Cryptography
    [ePrint, video]

  5. A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss

    with Elaine Shi and Ke Wu
      EUROCRYPT 2022
    [ePrint]

  6. Optimal Oblivious Parallel RAM

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

2021
  1. Efficient Perfectly Secure Computation with Optimal Resilience

    with Ittai Abraham and Avishay Yanai
      TCC 2021
      Journal of Cryptology (2022)
    [ePrint, video]

  2. Oblivious RAM with Worst-Case Logarithmic Overhead

    with Ilan Komargodski, Wei-Kai Lin, and Elaine Shi
      CRYPTO 2021
      Journal of Cryptology (2023)
    [ePrint, video]

  3. Towards Accountability in CRS Generation

    with Prabhanjan Ananth, Hila Dahari and Vipul Goyal
      EUROCRYPT 2021
    [ePrint]

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

    with Wei-Kai Lin and Elaine Shi
      SODA 2021
     SIAM Journal of Computing (2022)
    [arXiv, video]

  5. Privacy-Preserving Portfolio Pricing

    with Tucker Balch, and Antigoni Polychroniadou
      ACM ICAIF 2021
    [paper]

2020
  1. Oblivious Parallel Tight Compaction

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

  2. OptORAMa: Optimal Oblivious RAM

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

  3. Privacy-Preserving Dark Pools

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

  4. Bucket Oblivious Sort: An Extremely Simple Oblivious Sort

    with T-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren and Elaine Shi
      SOSA@SODA 2020
    [arXiv, video]

2019
  1. Locality Preserving Oblivious RAM

    with T-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren and Elaine Shi
     EUROCRYPT 2019
     Journal Of Cryptology (2022)
    [ePrint]

  2. Blind Certificate Authorities

    with Liang Wang, Rafael Pass, Thomas Ristenpart and abhi shelat
      S&P 2019
    [ePrint]

    3. On Perfect Correctness without Derandomization

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

2018
  1. On the Complexity of Compressing Obfuscation

    with Naomi Ephraim, Ilan Komargodski and Rafael Pass
      CRYPTO 2018 
      Journal Of Cryptology (2022) 
    [ePrint]

  2. Tight Tradeoffs in Searchable Symmetric Encryption

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

  3. Privacy-Preserving Search of Similar Patients in Genomic Data

    with Shai Halevi, Yehuda Lindell and Tal Rabin
      PETS 2018: Proceedings of Privacy Enhanced Technologies 
    also in "Real World Crypto", 2017
    [ePrint, video]

2017
  1. Privacy-Preserving Interdomain Routing at Internet scale

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

  2. Secure Centrality Computation Over Multiple Networks

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

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

    with Moni Naor, Gil Segev and Ido Shahaf
      STOC 2016 
      SIAM Journal of Computing
    [ePrint, slides]

  2. On Constructing One-Way Permutations from Indistinguishability Obfuscation

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

2015
  1. Limits on the Power of Indistinguishability Obfuscation and Functional Encryption

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

  2. 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]

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

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

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

2014
  1. Towards Characterizing Complete Fairness in Secure Two-Party Computation

      TCC 2014 
    [ePrint, slides,video]

2013
  1. 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]

  2. Fair and Efficient Secure Multiparty Computation with Reputation Systems

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

  3. 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
  1. Calling Out Cheaters: Covert Security with Public Verifiability

    with Claudio Orlandi,
      ASIACRYPT 2012 
    [ePrint, slides]

  2. 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
  1. 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]

  2. Perfectly-Secure Multiplication for any t < n/3

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

  3. Towards a Game Theoretic View of Secure Computation

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

2009
  1. Utility Dependence in Correct and Fair Rational Secret Sharing

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

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


Students


Current:

Past:

Professional Activities


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

Tutorials




Videos


Some of my talks have been filmed and can be found online:

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:

Past:



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.