Gilad Asharov

Post-Doctoral Researcher

Cornell Tech

2 W Loop Rd, Roosevelt Island
New York, NY 10044

asharov (at)

  [  Brief Biography  |   Publications   |   Professional Activities  |   Videos  |   Teaching  ]

Brief Biography and Research Interest

I recently joined Cornell Tech as a post-doctoral researcher, hosted by Prof. Rafael Pass.
I am a Simons Junior Fellow, as part of the Simons Society of Fellows.

Research Interest:

My research interest is in the field of cryptography. I focus on secure multiparty computation, ranging from its theoretical foundations to real-world applications. I am also interested in some other cryptographic primitives and their interplay (e.g., obfuscation, functional encryption, oblivious RAM, etc.).

Short Bio:

In 2016, I was a post-doctoral researcher at the Cryptography Group, IBM TJ Watson Research Center.
In 2015, I was a post-doctoral researcher in the The Hebrew University of Jerusalem, hosted by Dr. Gil Segev. I was supported by the Israeli Center of Research Excellence (I-CORE) Program, as an I-CORE postdoc fellow.

I finished my PhD in 2015, in the cryptography research group, Bar-Ilan university, where I was fortunate to have Prof. Yehuda Lindell as my advisor.
I spent Summer 2011 as an intern at the Cryptography Group at IBM TJ Watson Research Center.

You can find here links to my records at:

DBLP Google Scholar

In Submission

  • Oblivious Computation with Data Locality

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

  • Privacy-Preserving Search of Similar Patients in Genomic Data

    with Shai Halevi, Yehuda Lindell and Tal Rabin
    Our solution won the 1st place in the iDash Privacy & Security Workshop

    [ePrint, bibtex, slides]



  • 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 2017 
    [ePrint, bibtex, slides]

  • Secure Centrality Computation Over Multiple Networks

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


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

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

  • On Constructing One-Way Permutations from Indistinguishability Obfuscation

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


  • Limits on the Power of Indistinguishability Obfuscation and Functional Encryption

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

  • 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, bibtex, slides, code]

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

    with Amos Beimel, Nikolaos Makriyannis and Eran Omri,
    TCC 2015 
    [ePrint, bibtex, slides]


  • Towards Characterizing Complete Fairness in Secure Two-Party Computation

    TCC 2014 
    [ePrint, bibtex, slides]


  • 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, bibtex, slides, code]

  • Fair and Efficient Secure Multiparty Computation with Reputation Systems

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

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

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


  • Calling Out Cheaters: Covert Security with Public Verifiability

    with Claudio Orlandi,
    ASIACRYPT 2012 
    [ePrint, bibtex, 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, bibtex, slides]


  • 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, bibtex, slides]

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

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

  • Towards a Game Theoretic View of Secure Computation

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


  • Utility Dependence in Correct and Fair Rational Secret Sharing

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

Ph.D. Thesis

Professional Activities

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


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


I used to be 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.