Gilad Asharov
Gilad Asharov
Department of Computer Science, Bar-Ilan University
Verified email at - Homepage
Cited by
Cited by
More efficient oblivious transfer and extensions for faster secure computation
G Asharov, Y Lindell, T Schneider, M Zohner
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications …, 2013
Multiparty computation with low communication, computation and interaction via threshold FHE
G Asharov, A Jain, A López-Alt, E Tromer, V Vaikuntanathan, D Wichs
Annual International Conference on the Theory and Applications of …, 2012
A full proof of the BGW protocol for perfectly secure multiparty computation
G Asharov, Y Lindell
Journal of Cryptology 30 (1), 58-151, 2017
Utility dependence in correct and fair rational secret sharing
G Asharov, Y Lindell
Journal of Cryptology 24 (1), 157-202, 2011
More efficient oblivious transfer extensions with security for malicious adversaries
G Asharov, Y Lindell, T Schneider, M Zohner
Advances in Cryptology--EUROCRYPT 2015: 34th Annual International Conference …, 2015
Towards a game theoretic view of secure computation
G Asharov, R Canetti, C Hazay
Advances in Cryptology–EUROCRYPT 2011: 30th Annual International Conference …, 2011
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
G Asharov, M Naor, G Segev, I Shahaf
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
OptORAMa: Optimal Oblivious RAM
G Asharov, I Komargodski, W Lin, K Nayak, E Peserico, E Shi
Advances in Cryptology–EUROCRYPT 202039th Annual International Conference on …, 2020
Limits on the power of indistinguishability obfuscation and functional encryption
G Asharov, G Segev
SIAM Journal on Computing 45 (6), 2117-2176, 2016
Privacy-preserving search of similar patients in genomic data
G Asharov, S Halevi, Y Lindell, T Rabin
Proceedings on Privacy Enhancing Technologies 2018 (4), 104-124, 2017
More efficient oblivious transfer extensions
G Asharov, Y Lindell, T Schneider, M Zohner
Journal of Cryptology 30, 805-858, 2017
Calling out cheaters: Covert security with public verifiability
G Asharov, C Orlandi
Advances in Cryptology–ASIACRYPT 2012: 18th International Conference on the …, 2012
Complete characterization of fairness in secure two-party computation of boolean functions
G Asharov, A Beimel, N Makriyannis, E Omri
Cryptology ePrint Archive, 2014
Towards characterizing complete fairness in secure two-party computation
G Asharov
Theory of Cryptography: 11th Theory of Cryptography Conference, TCC 2014 …, 2014
Privacy-preserving interdomain routing at internet scale
G Asharov, D Demmler, M Schapira, T Schneider, G Segev, S Shenker, ...
Cryptology ePrint Archive, 2017
Tight tradeoffs in searchable symmetric encryption
G Asharov, G Segev, I Shahaf
Journal of Cryptology 34, 1-37, 2021
Fair and efficient secure multiparty computation with reputation systems
G Asharov, Y Lindell, H Zarosim
Advances in Cryptology-ASIACRYPT 2013: 19th International Conference on the …, 2013
On constructing one-way permutations from indistinguishability obfuscation
G Asharov, G Segev
Journal of Cryptology 31, 698-736, 2018
A full characterization of functions that imply fair coin tossing and ramifications to fairness
G Asharov, Y Lindell, T Rabin
Theory of Cryptography: 10th Theory of Cryptography Conference, TCC 2013 …, 2013
Perfectly-Secure Multiplication for Any t < n/3
G Asharov, Y Lindell, T Rabin
Advances in Cryptology–CRYPTO 2011: 31st Annual Cryptology Conference, Santa …, 2011
The system can't perform the operation now. Try again later.
Articles 1–20