Gilad Asharov

发表

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

Eran Omri, Amos Beimel, Gilad Asharov, 2015, TCC.

Privacy-Preserving Interdomain Routing at Internet Scale ( Full Version ) ?

S. Shenker, Michael Schapira, T. Schneider, 2017 .

Privacy-preserving portfolio pricing

Gilad Asharov, T. Balch, Antigoni Polychroniadou, 2021, ICAIF.

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

Gilad Asharov, Ran Cohen, Oren Shochat, 2022, ITC.

On Perfect Correctness without Derandomization

Ilan Komargodski, Rafael Pass, Gilad Asharov, 2019, IACR Cryptol. ePrint Arch..

Asymptotically Free Broadcast in Constant Expected Time via Packed VSS

Ittai Abraham, Gilad Asharov, A. Patra, 2022, IACR Cryptol. ePrint Arch..

The BGW Protocol for Perfectly-Secure Multiparty Computation

Yehuda Lindell, Gilad Asharov, Yehuda Lindell, 2013, Secure Multi-Party Computation.

Locality-Preserving Oblivious RAM

E. Shi, Kartik Nayak, R. Pass, 2022, Journal of Cryptology.

Efficient Perfectly Secure Computation with Optimal Resilience

Ittai Abraham, Gilad Asharov, Avishay Yanai, 2022, Journal of Cryptology.

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

Elaine Shi, Gilad Asharov, E. Shi, 2021, IACR Cryptol. ePrint Arch..

Privacy-Preserving Dark Pools

Manuela Veloso, Antigoni Polychroniadou, Gilad Asharov, 2020, AAMAS.

Privacy-Preserving Interdomain Routing at Internet Scale

Scott Shenker, Gil Segev, Michael Zohner, 2017, Proc. Priv. Enhancing Technol..

Towards Characterizing Complete Fairness in Secure Two-Party Computation

Gilad Asharov, Gilad Asharov, 2014, IACR Cryptol. ePrint Arch..

Foundations of Secure Computation: Perfect Security and Fairness

Gilad Asharov, Gilad Asharov, 2014 .

Secure Centrality Computation Over Multiple Networks

Tamir Tassa, Francesco Bonchi, Gilad Asharov, 2017, WWW.

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

Yehuda Lindell, Gilad Asharov, Yehuda Lindell, 2015, Journal of Cryptology.

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

Vinod Vaikuntanathan, Daniel Wichs, Eran Tromer, 2012, EUROCRYPT.

More efficient oblivious transfer and extensions for faster secure computation

Yehuda Lindell, Michael Zohner, Gilad Asharov, 2013, CCS.

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

Elaine Shi, Gilad Asharov, Wei-Kai Lin, 2020, SODA.

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries

Yehuda Lindell, Michael Zohner, Gilad Asharov, 2015, IACR Cryptol. ePrint Arch..

On the Complexity of Compressing Obfuscation

Ilan Komargodski, Rafael Pass, Gilad Asharov, 2018, Journal of Cryptology.

On Constructing One-Way Permutations from Indistinguishability Obfuscation

Gil Segev, Gilad Asharov, Gilad Asharov, 2016, Journal of Cryptology.

More Efficient Oblivious Transfer Extensions

Yehuda Lindell, Michael Zohner, Gilad Asharov, 2017, Journal of Cryptology.

Calling out Cheaters: Covert Security With Public Verifiability

Gilad Asharov, Claudio Orlandi, Gilad Asharov, 2012, IACR Cryptol. ePrint Arch..

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort pdf

Kartik Nayak, Ling Ren, Elaine Shi, 2020, SOSA.

Oblivious Computation with Data Locality

Kartik Nayak, Elaine Shi, Rafael Pass, 2017, IACR Cryptol. ePrint Arch..

Tight Tradeoffs in Searchable Symmetric Encryption

Gil Segev, Gilad Asharov, Ido Shahaf, 2018, IACR Cryptol. ePrint Arch..

Optimal Oblivious Parallel RAM

Elaine Shi, Ilan Komargodski, Gilad Asharov, 2022, IACR Cryptol. ePrint Arch..

OptORAMa: Optimal Oblivious RAM

Kartik Nayak, Elaine Shi, Ilan Komargodski, 2020, IACR Cryptol. ePrint Arch..

Oblivious Parallel Tight Compaction

Elaine Shi, Ilan Komargodski, Gilad Asharov, 2020, IACR Cryptol. ePrint Arch..

More Efficient Oblivious Transfer Extensions

Yehuda Lindell, T. Schneider, Gilad Asharov, 2016, Journal of Cryptology.

Towards Accountability in CRS Generation

Vipul Goyal, Gilad Asharov, Prabhanjan Vijendra Ananth, 2021, EUROCRYPT.

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

Benny Pinkas, Gilad Asharov, Ariel Nof, 2022, CCS.

Fair and Efficient Secure Multiparty Computation with Reputation Systems

Yehuda Lindell, Gilad Asharov, Hila Zarosim, 2013, IACR Cryptol. ePrint Arch..

Towards a Game Theoretic View of Secure Computation

Ran Canetti, Carmit Hazay, Gilad Asharov, 2011 .

Utility Dependence in Correct and Fair Rational Secret Sharing

Yehuda Lindell, Gilad Asharov, Yehuda Lindell, 2009, CRYPTO.

Toward a Game Theoretic View of Secure Computation

Ran Canetti, Carmit Hazay, Gilad Asharov, 2011, Journal of Cryptology.

Utility Dependence in Correct and Fair Rational Secret Sharing

Yehuda Lindell, Gilad Asharov, Yehuda Lindell, 2009, Journal of Cryptology.

Tight Tradeoffs in Searchable Symmetric Encryption

Gil Segev, Gilad Asharov, Ido Shahaf, 2021, Journal of Cryptology.

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

Ittai Abraham, Gilad Asharov, A. Patra, 2023, IACR Cryptol. ePrint Arch..

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

Ittai Abraham, Gilad Asharov, 2022, IACR Cryptol. ePrint Arch..

Privacy-Preserving Search of Similar Patients in Genomic Data

Yehuda Lindell, Shai Halevi, Tal Rabin, 2018, IACR Cryptol. ePrint Arch..

Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations

M. Naor, Gilad Asharov, G. Segev, 2016, STOC.

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption

Gil Segev, Gilad Asharov, Gilad Asharov, 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

Prime Match: A Privacy-Preserving Inventory Matching System

Benjamin E. Diamond, Gilad Asharov, T. Balch, 2023, IACR Cryptol. ePrint Arch..

Blind Certificate Authorities

Abhi Shelat, Rafael Pass, Thomas Ristenpart, 2019, 2019 IEEE Symposium on Security and Privacy (SP).