Follow
Gilad Asharov
Gilad Asharov
Department of Computer Science, Bar-Ilan University
Verified email at biu.ac.il - Homepage
Title
Cited by
Cited by
Year
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
5342012
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
4902013
A full proof of the BGW protocol for perfectly secure multiparty computation
G Asharov, Y Lindell
Journal of Cryptology 30 (1), 58-151, 2017
1882017
OptORAMa: Optimal Oblivious RAM
G Asharov, I Komargodski, WK Lin, K Nayak, E Peserico, E Shi
Journal of the ACM 70 (1), 1-70, 2022
1382022
More efficient oblivious transfer extensions with security for malicious adversaries
G Asharov, Y Lindell, T Schneider, M Zohner
Annual International Conference on the Theory and Applications of …, 2015
1222015
Utility dependence in correct and fair rational secret sharing
G Asharov, Y Lindell
Journal of Cryptology 24 (1), 157-202, 2011
1212011
Toward a game theoretic view of secure computation
G Asharov, R Canetti, C Hazay
Journal of Cryptology 29 (4), 879-926, 2016
1192016
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
1162016
Limits on the power of indistinguishability obfuscation and functional encryption
G Asharov, G Segev
SIAM Journal on Computing 45 (6), 2117-2176, 2016
912016
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
822017
More efficient oblivious transfer extensions
G Asharov, Y Lindell, T Schneider, M Zohner
Journal of Cryptology 30, 805-858, 2017
712017
Calling out cheaters: Covert security with public verifiability
G Asharov, C Orlandi
International Conference on the Theory and Application of Cryptology and …, 2012
652012
Towards characterizing complete fairness in secure two-party computation
G Asharov
Theory of Cryptography Conference, 291-316, 2014
552014
Privacy-preserving interdomain routing at internet scale
G Asharov, D Demmler, M Schapira, T Schneider, G Segev, S Shenker, ...
Proceedings of Privacy Enhancing Technologies 2017, 147, 2017
522017
Complete characterization of fairness in secure two-party computation of boolean functions
G Asharov, A Beimel, N Makriyannis, E Omri
Theory of Cryptography Conference, 199-228, 2015
522015
Fair and efficient secure multiparty computation with reputation systems
G Asharov, Y Lindell, H Zarosim
International Conference on the Theory and Application of Cryptology and …, 2013
352013
Tight tradeoffs in searchable symmetric encryption
G Asharov, G Segev, I Shahaf
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
342018
Locality-preserving oblivious RAM
G Asharov, THH Chan, K Nayak, R Pass, L Ren, E Shi
Journal of Cryptology 35 (2), 6, 2022
33*2022
Bucket oblivious sort: An extremely simple oblivious sort
G Asharov, THH Chan, K Nayak, R Pass, L Ren, E Shi
Symposium on Simplicity in Algorithms, 8-14, 2020
322020
On constructing one-way permutations from indistinguishability obfuscation
G Asharov, G Segev
Journal of Cryptology 31, 698-736, 2018
302018
The system can't perform the operation now. Try again later.
Articles 1–20