Gilad Asharov

According to our database, Gilad Asharov authored at least 57 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

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

Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri

SIAM J. Comput., 2024

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

Gilad Asharov, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Junichi Tomida

IACR Cryptol. ePrint Arch., 2024

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

Gilad Asharov, Anirudh Chandramouli

IACR Cryptol. ePrint Arch., 2024

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

Prabhanjan Ananth, Gilad Asharov, Vipul Goyal, Hadar Kaner, Pratik Soni, Brent Waters

IACR Cryptol. ePrint Arch., 2024

Perfect Asynchronous MPC with Linear Communication Overhead.

Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra

IACR Cryptol. ePrint Arch., 2024

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

Ittai Abraham, Gilad Asharov, Anirudh Chandramouli

IACR Cryptol. ePrint Arch., 2024

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

Ittai Abraham, Gilad Asharov, Arpita Patra, Gilad Stern

Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

2023

Oblivious RAM with Worst-Case Logarithmic Overhead.

Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi

J. Cryptol., April, 2023

OptORAMa: Optimal Oblivious RAM.

Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi

J. ACM, February, 2023

Prime Match: A Privacy-Preserving Inventory Matching System.

Antigoni Polychroniadou, Gilad Asharov, Benjamin E. Diamond, Tucker Balch, Hans Buehler, Richard Hua, Suwen Gu, Greg Gimler, Manuela Veloso

IACR Cryptol. ePrint Arch., 2023

FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM.

Gilad Asharov, Ilan Komargodski, Yehuda Michelson

IACR Cryptol. ePrint Arch., 2023

Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time.

Ittai Abraham, Gilad Asharov, Arpita Patra, Gilad Stern

IACR Cryptol. ePrint Arch., 2023

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

Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra

IACR Cryptol. ePrint Arch., 2023

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

Gilad Asharov, Koki Hamada, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Junichi Tomida

Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022

Sorting Short Keys in Circuits of Size ${o(n \log n)}$.

Gilad Asharov, Wei-Kai Lin, Elaine Shi

SIAM J. Comput., 2022

On the Complexity of Compressing Obfuscation.

Gilad Asharov, Ilan Komargodski, Rafael Pass, Naomi Sirkin

J. Cryptol., 2022

Locality-Preserving Oblivious RAM.

Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi

J. Cryptol., 2022

Efficient Perfectly Secure Computation with Optimal Resilience.

Ittai Abraham, Gilad Asharov, Avishay Yanai

J. Cryptol., 2022

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

Gilad Asharov, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Katsumi Takahashi, Junichi Tomida

IACR Cryptol. ePrint Arch., 2022

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

Gilad Asharov, Ran Cohen, Oren Shochat

IACR Cryptol. ePrint Arch., 2022

Asymptotically Free Broadcast in Constant Expected Time via Packed VSS.

Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra

IACR Cryptol. ePrint Arch., 2022

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

Ittai Abraham, Gilad Asharov

IACR Cryptol. ePrint Arch., 2022

2021

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

Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf

SIAM J. Comput., 2021

Tight Tradeoffs in Searchable Symmetric Encryption.

Gilad Asharov, Gil Segev, Ido Shahaf

J. Cryptol., 2021

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

Ke Wu, Gilad Asharov, Elaine Shi

IACR Cryptol. ePrint Arch., 2021

Towards Accountability in CRS Generation.

Prabhanjan Ananth, Gilad Asharov, Hila Dahari, Vipul Goyal

IACR Cryptol. ePrint Arch., 2021

Sorting Short Keys in Circuits of Size <i>o</i>(<i>n</i> log <i>n</i>).

Gilad Asharov, Wei-Kai Lin, Elaine Shi

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Privacy-preserving portfolio pricing.

Gilad Asharov, Tucker Balch, Antigoni Polychroniadou

Proceedings of the ICAIF'21: 2nd ACM International Conference on AI in Finance, Virtual Event, November 3, 2021

2020

Optimal Oblivious Parallel RAM.

Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi

IACR Cryptol. ePrint Arch., 2020

Oblivious Parallel Tight Compaction.

Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi

IACR Cryptol. ePrint Arch., 2020

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort.

Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi

Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

Privacy-Preserving Dark Pools.

Gilad Asharov, Tucker Hybinette Balch, Antigoni Polychroniadou, Manuela Veloso

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

On Perfect Correctness without Derandomization.

Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass

IACR Cryptol. ePrint Arch., 2019

2018

Privacy-Preserving Search of Similar Patients in Genomic Data.

Gilad Asharov, Shai Halevi, Yehuda Lindell, Tal Rabin

Proc. Priv. Enhancing Technol., 2018

On Constructing One-Way Permutations from Indistinguishability Obfuscation.

Gilad Asharov, Gil Segev

J. Cryptol., 2018

Blind Certificate Authorities.

Liang Wang, Gilad Asharov, Rafael Pass, Thomas Ristenpart, Abhi Shelat

IACR Cryptol. ePrint Arch., 2018

OptORAMa: Optimal Oblivious RAM.

Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Elaine Shi

IACR Cryptol. ePrint Arch., 2018

2017

Privacy-Preserving Interdomain Routing at Internet Scale.

Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, Michael Zohner

Proc. Priv. Enhancing Technol., 2017

More Efficient Oblivious Transfer Extensions.

Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner

J. Cryptol., 2017

Oblivious Computation with Data Locality.

Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi

IACR Cryptol. ePrint Arch., 2017

Secure Centrality Computation Over Multiple Networks.

Gilad Asharov, Francesco Bonchi, David García-Soriano, Tamir Tassa

Proceedings of the 26th International Conference on World Wide Web, 2017

2016

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption.

Gilad Asharov, Gil Segev

SIAM J. Comput., 2016

Toward a Game Theoretic View of Secure Computation.

Gilad Asharov, Ran Canetti, Carmit Hazay

J. Cryptol., 2016

Indistinguishability Obfuscation Does Not Reduce to Structured Languages.

Gilad Asharov, Alon Rosen, Gil Segev

Electron. Colloquium Comput. Complex., 2016

2015

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries.

Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner

IACR Cryptol. ePrint Arch., 2015

2014

Towards Characterizing Complete Fairness in Secure Two-Party Computation.

Gilad Asharov

IACR Cryptol. ePrint Arch., 2014

2013

The BGW Protocol for Perfectly-Secure Multiparty Computation.

Gilad Asharov, Yehuda Lindell

Proceedings of the Secure Multi-Party Computation, 2013

Fair and Efficient Secure Multiparty Computation with Reputation Systems.

Gilad Asharov, Yehuda Lindell, Hila Zarosim

IACR Cryptol. ePrint Arch., 2013

More Efficient Oblivious Transfer and Extensions for Faster Secure Computation.

Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner

IACR Cryptol. ePrint Arch., 2013

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

Gilad Asharov, Yehuda Lindell, Tal Rabin

IACR Cryptol. ePrint Arch., 2013

2012

Calling out Cheaters: Covert Security With Public Verifiability.

Gilad Asharov, Claudio Orlandi

IACR Cryptol. ePrint Arch., 2012

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

Gilad Asharov, Abhishek Jain, Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan, Daniel Wichs

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

2011

Utility Dependence in Correct and Fair Rational Secret Sharing.

Gilad Asharov, Yehuda Lindell

J. Cryptol., 2011

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

Gilad Asharov, Abhishek Jain, Daniel Wichs

IACR Cryptol. ePrint Arch., 2011

Towards a Game Theoretic View of Secure Computation.

Gilad Asharov, Ran Canetti, Carmit Hazay

IACR Cryptol. ePrint Arch., 2011

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

Gilad Asharov, Yehuda Lindell

Electron. Colloquium Comput. Complex., 2011

Perfectly-Secure Multiplication for Any <i>t < n</i>/3.

Gilad Asharov, Yehuda Lindell, Tal Rabin

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011