Gilad Asharov

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 75

Top Venues

IACR Cryptol. ePrint Arch.

J. Cryptol.

CCS

SIAM J. Comput.

Publications

Gilad Asharov, Anirudh Chandramouli
Perfect (Parallel) Broadcast in Constant Expected Rounds via Statistical VSS. EUROCRYPT (5) (2024)
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
Perfect Asynchronous MPC with Linear Communication Overhead. EUROCRYPT (5) (2024)
Gilad Asharov, Anirudh Chandramouli
Perfect (Parallel) Broadcast in Constant Expected Rounds via Statistical VSS. IACR Cryptol. ePrint Arch. 2024 (2024)
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
Perfect Asynchronous MPC with Linear Communication Overhead. IACR Cryptol. ePrint Arch. 2024 (2024)
Prabhanjan Ananth, Gilad Asharov, Vipul Goyal, Hadar Kaner, Pratik Soni, Brent Waters
NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness. IACR Cryptol. ePrint Arch. 2024 (2024)
Gilad Asharov, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Junichi Tomida
Secure Statistical Analysis on Multiple Datasets: Join and Group-By. IACR Cryptol. ePrint Arch. 2024 (2024)
Antigoni Polychroniadou, Gilad Asharov, Benjamin E. Diamond, Tucker Balch, Hans Buehler, Richard Hua, Suwen Gu, Greg Gimler, Manuela Veloso
Prime Match: A Privacy-Preserving Inventory Matching System. IACR Cryptol. ePrint Arch. 2023 (2023)
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time. IACR Cryptol. ePrint Arch. 2023 (2023)
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time. EUROCRYPT (2) (2023)
Antigoni Polychroniadou, Gilad Asharov, Benjamin E. Diamond, Tucker Balch, Hans Buehler, Richard Hua, Suwen Gu, Greg Gimler, Manuela Veloso
Prime Match: A Privacy-Preserving Inventory Matching System. USENIX Security Symposium (2023)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi
Oblivious RAM with Worst-Case Logarithmic Overhead. J. Cryptol. 36 (2) (2023)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi
OptORAMa: Optimal Oblivious RAM. J. ACM 70 (1) (2023)
Ittai Abraham, Gilad Asharov, Arpita Patra, Gilad Stern
Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time. IACR Cryptol. ePrint Arch. 2023 (2023)
Gilad Asharov, Ilan Komargodski, Yehuda Michelson
FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM. CCS (2023)
Antigoni Polychroniadou, Gilad Asharov, Benjamin E. Diamond, Tucker Balch, Hans Buehler, Richard Hua, Suwen Gu, Greg Gimler, Manuela Veloso
Prime Match: A Privacy-Preserving Inventory Matching System. CoRR (2023)
Gilad Asharov, Ilan Komargodski, Yehuda Michelson
FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM. IACR Cryptol. ePrint Arch. 2023 (2023)
Gilad Asharov, Koki Hamada, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Junichi Tomida
Secure Statistical Analysis on Multiple Datasets: Join and Group-By. CCS (2023)
Ittai Abraham, Gilad Asharov, Avishay Yanai
Efficient Perfectly Secure Computation with Optimal Resilience. J. Cryptol. 35 (4) (2022)
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. IACR Cryptol. ePrint Arch. 2022 (2022)
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Locality-Preserving Oblivious RAM. J. Cryptol. 35 (2) (2022)
Gilad Asharov, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Katsumi Takahashi, Junichi Tomida
Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters. CCS (2022)
Gilad Asharov, Ran Cohen, Oren Shochat
Static vs. Adaptive Security in Perfect MPC: A Separation and the Adaptive Security of BGW. IACR Cryptol. ePrint Arch. 2022 (2022)
Gilad Asharov, Wei-Kai Lin, Elaine Shi
Sorting Short Keys in Circuits of Size ${o(n \log n)}$. SIAM J. Comput. 51 (3) (2022)
Gilad Asharov, Ilan Komargodski, Rafael Pass, Naomi Sirkin
On the Complexity of Compressing Obfuscation. J. Cryptol. 35 (3) (2022)
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. TCC (1) (2022)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi
Optimal Oblivious Parallel RAM. SODA (2022)
Gilad Asharov, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Katsumi Takahashi, Junichi Tomida
Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters. IACR Cryptol. ePrint Arch. 2022 (2022)
Ke Wu, Gilad Asharov, Elaine Shi
A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss. EUROCRYPT (1) (2022)
Ittai Abraham, Gilad Asharov
Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security. IACR Cryptol. ePrint Arch. 2022 (2022)
Ittai Abraham, Gilad Asharov
Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security. PODC (2022)
Gilad Asharov, Ran Cohen, Oren Shochat
Static vs. Adaptive Security in Perfect MPC: A Separation and the Adaptive Security of BGW. ITC (2022)
Prabhanjan Ananth, Gilad Asharov, Hila Dahari, Vipul Goyal
Towards Accountability in CRS Generation. IACR Cryptol. ePrint Arch. 2021 (2021)
Ittai Abraham, Gilad Asharov, Avishay Yanai
Efficient Perfectly Secure Computation with Optimal Resilience. IACR Cryptol. ePrint Arch. 2021 (2021)
Prabhanjan Ananth, Gilad Asharov, Hila Dahari, Vipul Goyal
Towards Accountability in CRS Generation. EUROCRYPT (3) (2021)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi
Oblivious RAM with Worst-Case Logarithmic Overhead. IACR Cryptol. ePrint Arch. 2021 (2021)
Gilad Asharov, Wei-Kai Lin, Elaine Shi
). SODA (2021)
Gilad Asharov, Tucker Balch, Antigoni Polychroniadou
Privacy-preserving portfolio pricing. ICAIF (2021)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi
Oblivious RAM with Worst-Case Logarithmic Overhead. CRYPTO (4) (2021)
Ittai Abraham, Gilad Asharov, Avishay Yanai
Efficient Perfectly Secure Computation with Optimal Resilience. TCC (2) (2021)
Ke Wu, Gilad Asharov, Elaine Shi
A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss. IACR Cryptol. ePrint Arch. 2021 (2021)
Gilad Asharov, Gil Segev, Ido Shahaf
Tight Tradeoffs in Searchable Symmetric Encryption. J. Cryptol. 34 (2) (2021)
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. SIAM J. Comput. 50 (5) (2021)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi
Oblivious Parallel Tight Compaction. ITC (2020)
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. CoRR (2020)
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. SOSA (2020)
Gilad Asharov, Wei-Kai Lin, Elaine Shi
Sorting Short Keys in Circuits of Size o(n log n). CoRR (2020)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi
Oblivious Parallel Tight Compaction. IACR Cryptol. ePrint Arch. 2020 (2020)
Gilad Asharov, Tucker Hybinette Balch, Antigoni Polychroniadou, Manuela Veloso
Privacy-Preserving Dark Pools. AAMAS (2020)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi
Optimal Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. 2020 (2020)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi
OptORAMa: Optimal Oblivious RAM. EUROCRYPT (2) (2020)
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Locality-Preserving Oblivious RAM. EUROCRYPT (2) (2019)
Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass
On Perfect Correctness without Derandomization. IACR Cryptol. ePrint Arch. 2019 (2019)
Liang Wang, Gilad Asharov, Rafael Pass, Thomas Ristenpart, Abhi Shelat
Blind Certificate Authorities. IEEE Symposium on Security and Privacy (2019)
Liang Wang, Gilad Asharov, Rafael Pass, Thomas Ristenpart, Abhi Shelat
Blind Certificate Authorities. IACR Cryptol. ePrint Arch. 2018 (2018)
Gilad Asharov, Gil Segev, Ido Shahaf
Tight Tradeoffs in Searchable Symmetric Encryption. CRYPTO (1) (2018)
Gilad Asharov, Shai Halevi, Yehuda Lindell, Tal Rabin
Privacy-Preserving Search of Similar Patients in Genomic Data. Proc. Priv. Enhancing Technol. 2018 (4) (2018)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Elaine Shi
OptORAMa: Optimal Oblivious RAM. IACR Cryptol. ePrint Arch. 2018 (2018)
Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass
On the Complexity of Compressing Obfuscation. IACR Cryptol. ePrint Arch. 2018 (2018)
Gilad Asharov, Gil Segev, Ido Shahaf
Tight Tradeoffs in Searchable Symmetric Encryption. IACR Cryptol. ePrint Arch. 2018 (2018)
Gilad Asharov, Gil Segev
On Constructing One-Way Permutations from Indistinguishability Obfuscation. J. Cryptol. 31 (3) (2018)
Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass
On the Complexity of Compressing Obfuscation. CRYPTO (3) (2018)
Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, Michael Zohner
Privacy-Preserving Interdomain Routing at Internet Scale. Proc. Priv. Enhancing Technol. 2017 (3) (2017)
Gilad Asharov, Francesco Bonchi, David García-Soriano, Tamir Tassa
Secure Centrality Computation Over Multiple Networks. WWW (2017)
Gilad Asharov, Yehuda Lindell
A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation. J. Cryptol. 30 (1) (2017)
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
More Efficient Oblivious Transfer Extensions. J. Cryptol. 30 (3) (2017)
Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, Michael Zohner
Privacy-Preserving Interdomain Routing at Internet Scale. IACR Cryptol. ePrint Arch. 2017 (2017)
Gilad Asharov, Shai Halevi, Yehuda Lindell, Tal Rabin
Privacy-Preserving Search of Similar Patients in Genomic Data. IACR Cryptol. ePrint Arch. 2017 (2017)
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Oblivious Computation with Data Locality. IACR Cryptol. ePrint Arch. 2017 (2017)
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
More Efficient Oblivious Transfer Extensions. IACR Cryptol. ePrint Arch. 2016 (2016)
Gilad Asharov, Ran Canetti, Carmit Hazay
Toward a Game Theoretic View of Secure Computation. J. Cryptol. 29 (4) (2016)
Gilad Asharov, Gil Segev
On Constructing One-Way Permutations from Indistinguishability Obfuscation. TCC (A2) (2016)
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. STOC (2016)
Gilad Asharov, Alon Rosen, Gil Segev
Indistinguishability Obfuscation Does Not Reduce to Structured Languages. Electron. Colloquium Comput. Complex. 23 (2016)
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. IACR Cryptol. ePrint Arch. 2016 (2016)
Gilad Asharov, Gil Segev
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. SIAM J. Comput. 45 (6) (2016)
Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. TCC (1) (2015)
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries. IACR Cryptol. ePrint Arch. 2015 (2015)
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries. EUROCRYPT (1) (2015)
Gilad Asharov, Gil Segev
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. FOCS (2015)
Gilad Asharov, Gil Segev
On Constructing One-Way Permutations from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2015 (2015)
Gilad Asharov, Gil Segev
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. IACR Cryptol. ePrint Arch. 2015 (2015)
Gilad Asharov
Towards Characterizing Complete Fairness in Secure Two-Party Computation. TCC (2014)
Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. IACR Cryptol. ePrint Arch. 2014 (2014)
Gilad Asharov
Towards Characterizing Complete Fairness in Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2014 (2014)
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
More Efficient Oblivious Transfer and Extensions for Faster Secure Computation. IACR Cryptol. ePrint Arch. 2013 (2013)
Gilad Asharov, Yehuda Lindell, Hila Zarosim
Fair and Efficient Secure Multiparty Computation with Reputation Systems. ASIACRYPT (2) (2013)
Gilad Asharov, Yehuda Lindell, Tal Rabin
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness. TCC (2013)
Gilad Asharov, Yehuda Lindell, Hila Zarosim
Fair and Efficient Secure Multiparty Computation with Reputation Systems. IACR Cryptol. ePrint Arch. 2013 (2013)
Gilad Asharov, Yehuda Lindell, Tal Rabin
Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness. IACR Cryptol. ePrint Arch. 2013 (2013)
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
More efficient oblivious transfer and extensions for faster secure computation. CCS (2013)
Gilad Asharov, Claudio Orlandi
Calling out Cheaters: Covert Security With Public Verifiability. IACR Cryptol. ePrint Arch. 2012 (2012)
Gilad Asharov, Abhishek Jain, Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan, Daniel Wichs
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE. EUROCRYPT (2012)
Gilad Asharov, Claudio Orlandi
Calling Out Cheaters: Covert Security with Public Verifiability. ASIACRYPT (2012)
Gilad Asharov, Ran Canetti, Carmit Hazay
Towards a Game Theoretic View of Secure Computation. EUROCRYPT (2011)
Gilad Asharov, Yehuda Lindell
A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2011 (2011)
Gilad Asharov, Ran Canetti, Carmit Hazay
Towards a Game Theoretic View of Secure Computation. IACR Cryptol. ePrint Arch. 2011 (2011)
Gilad Asharov, Abhishek Jain, Daniel Wichs
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE. IACR Cryptol. ePrint Arch. 2011 (2011)
Gilad Asharov, Yehuda Lindell
A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. Electron. Colloquium Comput. Complex. 18 (2011)
Gilad Asharov, Yehuda Lindell, Tal Rabin
/3. CRYPTO (2011)
Gilad Asharov, Yehuda Lindell
Utility Dependence in Correct and Fair Rational Secret Sharing. J. Cryptol. 24 (1) (2011)

Gilad Asharov.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Gilad Asharov