Gilad Asharov's Homepage

Gilad Asharov

Department of Computer Science

Email:

firstname.lastname@biu.ac.il

Office:

Building 503, office 103

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 (English) and this video (Hebrew).

Short Bio:

I joined Bar-Ilan's faculty in 2019 after spending four years in NY (IBM TJ Watson Center, Cornell Tech, and JP Morgan AI Research), and a year at the Hebrew University. I completed my Ph.D. studies in 2015 at Bar-Ilan University.

Publications

You can find here links to my records at:

orcid

Conference

Journal

Thesis

Book chapter

2025	Simple is COOL: Graded Dispersal and its Applications for Byzantine Fault Tolerance with Ittai Abraham and Anirudh Chandramouli ITCS 2025 [ePrint, video]
2024	Asynchronous Agreement on a Core Set in Constant Expected Time and More Efficient Asynchronous VSS and MPC with Ittai Abraham, Arpita Patra, Gilad Stern TCC 2024 [ePrint] NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness with Prabhanjan Ananth, Vipul Goyal, Hadar Kaner, Pratik Soni, and Brent Waters SCN 2024 [ePrint] Perfect (Parallel) Broadcast in Constant Expected Rounds via Statistical VSS with Anirudh Chandramouli EUROCRYPT 2024 [ePrint] Perfect Asynchronous MPC with Linear Communication Overhead with Ittai Abraham, Shravani Patil, and Arpita Patra EUROCRYPT 2024 [ePrint]
2023	FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM with Ilan Komargodski and Yehuda Michelson ACM CCS 2023 [ePrint,code] Distinguished Paper Award 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 [ePrint] Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time with Ittai Abraham, Shravani Patil, Arpita Patra EUROCRYPT 2023 [ePrint] 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	Asymptotically Free Broadcast in Constant Expected Time via Packed VSS with Ittai Abraham, Shravani Patil, Arpita Patra TCC 2022 [ePrint, video] 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] Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security with Ittai Abraham PODC 2022 [ePrint] 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] A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss with Elaine Shi and Ke Wu EUROCRYPT 2022 [ePrint] Optimal Oblivious Parallel RAM with Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, and Elaine Shi SODA 2022 [ePrint, video]
2021	Efficient Perfectly Secure Computation with Optimal Resilience with Ittai Abraham and Avishay Yanai TCC 2021 Journal of Cryptology (2022) [ePrint, video] Oblivious RAM with Worst-Case Logarithmic Overhead with Ilan Komargodski, Wei-Kai Lin, and Elaine Shi CRYPTO 2021 Journal of Cryptology (2023) [ePrint, video] Towards Accountability in CRS Generation with Prabhanjan Ananth, Hila Dahari and Vipul Goyal EUROCRYPT 2021 [ePrint] 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] Privacy-Preserving Portfolio Pricing with Tucker Balch, and Antigoni Polychroniadou ACM ICAIF 2021 [paper]
2020	Oblivious Parallel Tight Compaction with Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, and Elaine Shi ITC 2020: Information Theoretic Cryptography [ePrint] 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] Privacy-Preserving Dark Pools with Tucker Balch, Antigoni Polychroniadou and Manuela Veloso AAMAS 2020 (extended abstract) [PDF] 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	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] Blind Certificate Authorities with Liang Wang, Rafael Pass, Thomas Ristenpart and abhi shelat 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 Journal Of Cryptology (2022) [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 PETS 2018: Proceedings of Privacy Enhanced Technologies also in "Real World Crypto", 2017 [ePrint, video]
2017	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] 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 SIAM Journal of Computing [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]

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:

Anirudh Chandramouli (Ph.D.)

Past:

Yehuda Michelson (M.Sc., 2023)
Hadar Kaner (M.Sc., 2022)
Oren Shochat (M.Sc., 2022)

Professional Activities

I co-organized:

Privacy-Preserving Machine Learning Workshop 2024, as an affiliated event of CRYPTO 2024.
Privacy-Preserving Machine Learning Workshop 2023, as an affiliated event of CRYPTO 2023.
The 13th Bar-Ilan Winter School: Blockchain Technologies.
Privacy-Preserving Machine Learning Workshop 2022, as an affiliated event of CRYPTO 2022.
Privacy-Preserving Machine Learning Workshop 2021, as an affiliated event of CRYPTO 2021. [video]
Privacy-Preserving Machine Learning Workshop 2020, as an affiliated event of CRYPTO 2020. [video]
Privacy-Preserving Machine Learning Workshop 2019, as an affiliated event of CRYPTO 2019.

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

Tutorials

Oblivious Computation (ORAM):
As part of the The 12th Bar-Ilan Winter School (2022) -- Advances in Secure Computation
- Part I: Introduction to ORAM, Lower Bounds and Tree Based ORAMs
- Part II: Oblivious Sorts, Oblivious Compaction, and Sorting Circuits
- Part III: Hierarchical Framework and OptORAMa
Secret Sharing, Verifiable Secret Sharing, and the BGW Protocol:
As part of the The 10th Bar-Ilan Winter School (2020) -- Information Theoretic Cryptography
- Part I: Threshold Secret Sharing - an introduction to secret sharing.
- Part II: Verifiable Secret Sharing.
- Part III: Secure Computation: The BGW Protocol

Videos

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

Optimal Oblivious Parallel RAM, invited speaker at TPMPC 2020 - Theory and Practice of Multi-Party computation Workshop.
OptORAMa: Optimal Oblivious RAM, as part of virtual Eurocrypt 2020, the online session can be found here.
The 10th BIU Winter School on Cryptography: Information Theoretic Cryptography.
Oblivious Computation with Data Locality, invited speaker at TPMPC 2018 - Theory and Practice of Multi-Party Computation, 2018

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:

(89-120) Data Structures
(89-656) Introduction to Cryptography
(89-657) Secure Computation

Past:

(89-197) Discrete Math 2
(89-458) Seminar - Advances in Cryptography

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.

Email:

Office:

Brief Biography and Research Interest

Short Bio:

Publications

2025

Simple is COOL: Graded Dispersal and its Applications for Byzantine Fault Tolerance

2024

Asynchronous Agreement on a Core Set in Constant Expected Time and More Efficient Asynchronous VSS and MPC

NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness

Perfect (Parallel) Broadcast in Constant Expected Rounds via Statistical VSS

Perfect Asynchronous MPC with Linear Communication Overhead

2023

FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM

Distinguished Paper Award

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

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

Prime Match: A Privacy Preserving Inventory Matching System

2022

Asymptotically Free Broadcast in Constant Expected Time via Packed VSS

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

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

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

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

Optimal Oblivious Parallel RAM

2021

Efficient Perfectly Secure Computation with Optimal Resilience

Oblivious RAM with Worst-Case Logarithmic Overhead

Towards Accountability in CRS Generation

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

Privacy-Preserving Portfolio Pricing

2020

Oblivious Parallel Tight Compaction

OptORAMa: Optimal Oblivious RAM

Privacy-Preserving Dark Pools

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort

2019

Locality Preserving Oblivious RAM

Blind Certificate Authorities

On Perfect Correctness without Derandomization

2018

On the Complexity of Compressing Obfuscation

Tight Tradeoffs in Searchable Symmetric Encryption

Privacy-Preserving Search of Similar Patients in Genomic Data

2017

Privacy-Preserving Interdomain Routing at Internet scale

Secure Centrality Computation Over Multiple Networks

2016

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

On Constructing One-Way Permutations from Indistinguishability Obfuscation

2015

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries

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

Foundations of Secure Computation: Perfect Security and Fairness

2014

Towards Characterizing Complete Fairness in Secure Two-Party Computation

2013

More Efficient Oblivious Transfer and Extensions for Faster Secure Computation

Fair and Efficient Secure Multiparty Computation with Reputation Systems

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

2012

Calling Out Cheaters: Covert Security with Public Verifiability

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

2011

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

Perfectly-Secure Multiplication for any t < n/3

Towards a Game Theoretic View of Secure Computation

2009

Utility Dependence in Correct and Fair Rational Secret Sharing