| Efficient secure two-party protocols: Techniques and constructions C Hazay, Y Lindell Springer Science & Business Media, 2010 | 306 | 2010 |
| Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries C Hazay, Y Lindell Theory of Cryptography Conference, 155-175, 2008 | 302 | 2008 |
| 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 | 181 | 2011 |
| 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 | 155 | 2017 |
| Efficient set operations in the presence of malicious adversaries C Hazay, K Nissim International Workshop on Public Key Cryptography, 312-331, 2010 | 130 | 2010 |
| Secure two-party computation with low communication I Damgård, S Faust, C Hazay Theory of Cryptography Conference, 54-74, 2012 | 117 | 2012 |
| 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 (2), 265-323, 2019 | 93 | 2019 |
| Towards a game theoretic view of secure computation G Asharov, R Canetti, C Hazay Annual International Conference on the Theory and Applications of …, 2011 | 90 | 2011 |
| 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 | 86 | 2012 |
| 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 | 81 | 2010 |
| Constructions of truly practical secure protocols using standardsmartcards C Hazay, Y Lindell Proceedings of the 15th ACM conference on Computer and communications …, 2008 | 81 | 2008 |
| Computationally secure pattern matching in the presence of malicious adversaries C Hazay, T Toft International Conference on the Theory and Application of Cryptology and …, 2010 | 80 | 2010 |
| Efficient set operations in the presence of malicious adversaries C Hazay, K Nissim Journal of cryptology 25 (3), 383-433, 2012 | 67 | 2012 |
| Leakage-resilient cryptography from minimal assumptions C Hazay, A López-Alt, H Wee, D Wichs Journal of Cryptology 29 (3), 514-551, 2016 | 62 | 2016 |
| Efficient set intersection with simulation-based security MJ Freedman, C Hazay, K Nissim, B Pinkas Journal of Cryptology 29 (1), 115-155, 2016 | 62 | 2016 |
| Text search protocols with simulation based security R Gennaro, C Hazay, JS Sorensen International Workshop on Public Key Cryptography, 332-350, 2010 | 58 | 2010 |
| Concurrently-secure blind signatures without random oracles or setup assumptions C Hazay, J Katz, CY Koo, Y Lindell Theory of Cryptography Conference, 323-341, 2007 | 57 | 2007 |
| 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 | 54 | 2020 |
| Approximate parameterized matching C Hazay, M Lewenstein, D Sokol ACM Transactions on Algorithms (TALG) 3 (3), 29-es, 2007 | 53 | 2007 |
| Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs C Hazay Journal of Cryptology 31 (2), 537-586, 2018 | 49 | 2018 |
