ד"ר גלעד אשרוב

ד"ר
ד"ר גלעד אשרוב
טלפון: 
פקס: 
משרד: 
שעות קבלה: 

פירסומים

Publications in refereed conferences:

 

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

Bucket sort: A Simple Oblivious Sort,

In SOSA @ SODA 2020, to appear

 

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

Locality-Preserving Oblivious RAM.

In EUROCRYPT 2019, pages: 214-243

 

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

Blind Certificate Authorities.

In IEEE Symposium on Security and Privacy 2019, pages: 1015-1032

 

Gilad Asharov, Gil Segev and Ido Shahaf:

Tight Tradeoffs in Searchable Symmetric Encryption.

In CRYPTO 2018, pages: 407-436

 

Gilad Asharov, Naomi Ephraim, Ilan Komargodski and Rafael Pass:

On the Complexity of Compressing Obfuscation.

In CRYPTO 2018, pages: 753-783

 

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

Secure Centrality Computation Over Multiple Networks.

In WWW 2017, pages: 957-966

 

Gilad Asharov, Moni Naor, Gil Segev and Ido Shahaf:

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

In STOC 2016, pages: 1101-1114

 

Gilad Asharov and Gil Segev:

On Constructing One-Way Permutations from Indistinguishability Obfuscation.

In TCC 2016, pages: 512-541

 

 

Gilad Asharov, Yehuda Lindell, Thomas Schneider and Michael Zohner:

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries.

In EUROCRYPT 2015, pages: 673-701

 

Gilad Asharov and Gil Segev:

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption.

In FOCS 2015, pages: 191-209

 

Gilad Asharov, Amos Beimel, Nikolaos Makriyannis and Eran Omri:

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

In TCC 2015, pages: 199-228

 

Gilad Asharov:

Towards Characterizing Complete Fairness in Secure Two-Party Computation.

In TCC 2014, pages: 291-316

 

Gilad Asharov, Yehuda Lindell and Hila Zarosim:

Fair and Efficient Secure Multiparty Computation with Reputation Systems.

In ASIACRYPT 2013, pages: 201-220

 

Gilad Asharov, Yehuda Lindell, Thomas Schneider and Michael Zohner:

More efficient oblivious transfer and extensions for faster secure computation.

In ACM Conference on Computer and Communications Security 2013, pages: 535-548

 

Gilad Asharov, Yehuda Lindell and Tal Rabin:

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

In TCC 2013, pages: 243-262

 

Gilad Asharov and Claudio Orlandi:

Calling Out Cheaters: Covert Security with Public Verifiability.

In ASIACRYPT 2012, pages: 681-698

 

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

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

In EUROCRYPT 2012, pages: 483-501

 

Gilad Asharov, Yehuda Lindell and Tal Rabin:

Perfectly-Secure Multiplication for Any

In CRYPTO 2011, pages: 240-258

 

Gilad Asharov, Ran Canetti and Carmit Hazay:

Towards a Game Theoretic View of Secure Computation.

In EUROCRYPT 2011, pages: 426-445

 

Gilad Asharov and Yehuda Lindell:

Utility Dependence in Correct and Fair Rational Secret Sharing.

In CRYPTO 2009, pages: 559-576

 

 

Publications in Journals:

 

Gilad Asharov and Gil Segev:

On Constructing One-Way Permutations from Indistinguishability Obfuscation.

In J. Cryptology 31(3), 2018, pages: 698-736

 

Gilad Asharov, Shai Halevi, Yehuda Lindell and Tal Rabin:

Privacy-Preserving Search of Similar Patients in Genomic Data.

In PoPETs 2018 (4), pages: 104-124

 

Gilad Asharov and Yehuda Lindell:

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

In J. Cryptology 30 (1),  2017, pages: 58-151

 

Gilad Asharov, Yehuda Lindell, Thomas Schneider and Michael Zohner:

More Efficient Oblivious Transfer Extensions.

In J. Cryptology 30 (3), 2017, pages: 805-858

 

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

Privacy-Preserving Interdomain Routing at Internet Scale.

In PoPETs 2017 (3), 2017 pages: 147-167

 

Gilad Asharov, Ran Canetti and Carmit Hazay:

Toward a Game Theoretic View of Secure Computation.

In J. Cryptology 29 (4), 2016, pages: 879-926

 

Gilad Asharov and Gil Segev:

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption.

In SIAM J. Comput. 45 (6), 2016, pages: 2117-2176

 

Gilad Asharov and Yehuda Lindell:

Utility Dependence in Correct and Fair Rational Secret Sharing.

In J. Cryptology 24 (1), 2011, pages: 157-202

 

 

 

Manuscripts:

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

OptORAMa: Optimal Oblivious RAM.

In IACR Cryptology ePrint Archive 2018/892

 

 

Gilad Asharov, Naomi Ephraim, Ilan Komargodski and Rafael Pass:

On Perfect Correctness without Derandomization.

In IACR Cryptology ePrint Archive 2019/1025

 

 

Book Chapter:

Gilad Asharov and Yehuda Lindell:

The BGW Protocol for Perfectly-Secure Multiparty Computation,

Secure Multi-Party Computation, IOS Press 2013, pages: 120-167

 

תחומי מחקר

קריפטוגרפיה, פרטיות ואבטחת תקשרות

Cryptography, privacy and security