Gilad Asharov

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