Gilad Asharov
Gilad Asharov
Department of Computer Science, Bar-Ilan University
Verifierad e-postadress på biu.ac.il - Startsida
Titel
Citeras av
Citeras av
År
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
2952013
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
2942012
A full proof of the BGW protocol for perfectly secure multiparty computation
G Asharov, Y Lindell
Journal of Cryptology 30 (1), 58-151, 2017
1162017
Utility dependence in correct and fair rational secret sharing
G Asharov, Y Lindell
Journal of Cryptology 24 (1), 157-202, 2011
982011
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
872015
Towards a game theoretic view of secure computation
G Asharov, R Canetti, C Hazay
Annual International Conference on the Theory and Applications of …, 2011
872011
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
692016
Limits on the power of indistinguishability obfuscation and functional encryption
G Asharov, G Segev
SIAM Journal on Computing 45 (6), 2117-2176, 2016
532016
Towards characterizing complete fairness in secure two-party computation
G Asharov
Theory of Cryptography Conference, 291-316, 2014
382014
OptORAMa: Optimal Oblivious RAM
G Asharov, I Komargodski, WK Lin, K Nayak, E Peserico, E Shi
Advanced in Cryptography - Eurocrypt, 2020
342020
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
342015
More efficient oblivious transfer extensions
G Asharov, Y Lindell, T Schneider, M Zohner
Journal of Cryptology 30 (3), 805-858, 2017
312017
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, 2018
302018
Privacy-preserving interdomain routing at Internet scale
G Asharov, D Demmler, M Schapira, T Schneider, G Segev, S Shenker, ...
Proceedings on Privacy Enhancing Technologies 2017 (3), 147-167, 2017
272017
Calling out cheaters: Covert security with public verifiability
G Asharov, C Orlandi
International Conference on the Theory and Application of Cryptology and …, 2012
252012
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
212013
A full characterization of functions that imply fair coin tossing and ramifications to fairness
G Asharov, Y Lindell, T Rabin
Theory of Cryptography Conference, 243-262, 2013
202013
On constructing one-way permutations from indistinguishability obfuscation
G Asharov, G Segev
Journal of Cryptology 31 (3), 698-736, 2018
182018
Tight tradeoffs in searchable symmetric encryption
G Asharov, G Segev, I Shahaf
Annual International Cryptology Conference, 407-436, 2018
162018
Perfectly-Secure Multiplication for Any t < n/3
G Asharov, Y Lindell, T Rabin
Annual Cryptology Conference, 240-258, 2011
162011
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20