| Efficient secure two-party protocols: Techniques and constructions C Hazay, Y Lindell Springer Science & Business Media, 2010 | 404 | 2010 |
| Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries C Hazay, Y Lindell Theory of Cryptography: Fifth Theory of Cryptography Conference, TCC 2008 …, 2008 | 343 | 2008 |
| Ligero: Lightweight sublinear arguments without a trusted setup S Ames, C Hazay, Y Ishai, M Venkitasubramaniam Proceedings of the 2017 acm sigsac conference on computer and communications …, 2017 | 320 | 2017 |
| Complete fairness in secure two-party computation SD Gordon, C Hazay, J Katz, Y Lindell Journal of the ACM (JACM) 58 (6), 1-37, 2011 | 188 | 2011 |
| Efficient Set Operations in the Presence of Malicious Adversaries. C Hazay, K Nissim Public Key Cryptography 6056, 312-331, 2010 | 147 | 2010 |
| Efficient RSA key generation and threshold paillier in the two-party setting C Hazay, GL Mikkelsen, T Rabin, T Toft, AA Nicolosi Journal of Cryptology 32, 265-323, 2019 | 141 | 2019 |
| Secure two-party computation with low communication I Damgård, S Faust, C Hazay Theory of Cryptography: 9th Theory of Cryptography Conference, TCC 2012 …, 2012 | 139 | 2012 |
| Computationally secure pattern matching in the presence of malicious adversaries C Hazay, T Toft Journal of cryptology 27, 358-395, 2014 | 116 | 2014 |
| Towards a game theoretic view of secure computation G Asharov, R Canetti, C Hazay Advances in Cryptology–EUROCRYPT 2011: 30th Annual International Conference …, 2011 | 104 | 2011 |
| Efficient set intersection with simulation-based security MJ Freedman, C Hazay, K Nissim, B Pinkas Journal of Cryptology 29 (1), 115-155, 2016 | 101 | 2016 |
| Scalable multi-party private set-intersection C Hazay, M Venkitasubramaniam Public-Key Cryptography–PKC 2017: 20th IACR International Conference on …, 2017 | 97 | 2017 |
| On compression of data encrypted with block ciphers D Klinc, C Hazay, A Jagmohan, H Krawczyk, T Rabin IEEE transactions on information theory 58 (11), 6989-7001, 2012 | 95 | 2012 |
| Low cost constant round MPC combining BMR and oblivious transfer C Hazay, P Scholl, E Soria-Vazquez Journal of Cryptology 33 (4), 1732-1786, 2020 | 91 | 2020 |
| Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries C Hazay, Y Lindell Journal of cryptology 23 (3), 422-456, 2010 | 91 | 2010 |
| Constructions of truly practical secure protocols using standardsmartcards C Hazay, Y Lindell Proceedings of the 15th ACM conference on Computer and communications …, 2008 | 86 | 2008 |
| Leakage-resilient cryptography from minimal assumptions C Hazay, A López-Alt, H Wee, D Wichs Journal of Cryptology 29 (3), 514-551, 2016 | 79 | 2016 |
| Efficient set operations in the presence of malicious adversaries C Hazay, K Nissim Journal of cryptology 25 (3), 383-433, 2012 | 78 | 2012 |
| Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs C Hazay Journal of Cryptology 31 (2), 537-586, 2018 | 73 | 2018 |
| Text search protocols with simulation based security R Gennaro, C Hazay, JS Sorensen Public Key Cryptography–PKC 2010: 13th International Conference on Practice …, 2010 | 64 | 2010 |
| Concurrently-secure blind signatures without random oracles or setup assumptions C Hazay, J Katz, CY Koo, Y Lindell Theory of Cryptography: 4th Theory of Cryptography Conference, TCC 2007 …, 2007 | 63 | 2007 |
