| Multi-input functional encryption S Goldwasser, SD Gordon, V Goyal, A Jain, J Katz, FH Liu, A Sahai, E Shi, ... Annual International Conference on the Theory and Applications of …, 2014 | 488 | 2014 |
| A group signature scheme from lattice assumptions SD Gordon, J Katz, V Vaikuntanathan International conference on the theory and application of cryptology and …, 2010 | 329 | 2010 |
| Rational secret sharing, revisited SD Gordon, J Katz International conference on security and cryptography for networks, 229-241, 2006 | 265 | 2006 |
| Secure two-party computation in sublinear (amortized) time SD Gordon, J Katz, V Kolesnikov, F Krell, T Malkin, M Raykova, Y Vahlis Proceedings of the 2012 ACM conference on Computer and communications …, 2012 | 230 | 2012 |
| 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 | 213 | 2011 |
| Partial fairness in secure two-party computation SD Gordon, J Katz Journal of cryptology 25 (1), 14-40, 2012 | 140 | 2012 |
| Constant-round MPC with fairness and guarantee of output delivery S Dov Gordon, FH Liu, E Shi Annual Cryptology Conference, 63-82, 2015 | 127 | 2015 |
| Secure computation with differentially private access patterns S Mazloom, SD Gordon Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications …, 2018 | 81 | 2018 |
| Multi-client verifiable computation with stronger security guarantees SD Gordon, J Katz, FH Liu, E Shi, HS Zhou Theory of Cryptography Conference, 144-168, 2015 | 70 | 2015 |
| Multi-input functional encryption SD Gordon, J Katz, FH Liu, E Shi, HS Zhou Cryptology ePrint Archive, 2013 | 66 | 2013 |
| Complete fairness in multi-party computation without an honest majority SD Gordon, J Katz Theory of Cryptography Conference, 19-35, 2009 | 64 | 2009 |
| On the relationship between functional encryption, obfuscation, and fully homomorphic encryption J Alwen, M Barbosa, P Farshim, R Gennaro, SD Gordon, S Tessaro, ... IMA International Conference on Cryptography and Coding, 65-84, 2013 | 55 | 2013 |
| Secure computation with low communication from cross-checking SD Gordon, S Ranellucci, X Wang International Conference on the Theory and Application of Cryptology and …, 2018 | 54 | 2018 |
| On complete primitives for fairness D Gordon, Y Ishai, T Moran, R Ostrovsky, A Sahai Theory of Cryptography Conference, 91-108, 2010 | 54 | 2010 |
| Two-party private set intersection with an untrusted third party PH Le, S Ranellucci, SD Gordon Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019 | 49 | 2019 |
| Simple and efficient two-server ORAM SD Gordon, J Katz, X Wang International Conference on the Theory and Application of Cryptology and …, 2018 | 49* | 2018 |
| Secure computation of MIPS machine code X Wang, SD Gordon, A McIntosh, J Katz European Symposium on Research in Computer Security, 99-117, 2016 | 41 | 2016 |
| Multi-party computation of polynomials and branching programs without simultaneous interaction SD Gordon, T Malkin, M Rosulek, H Wee Annual International Conference on the Theory and Applications of …, 2013 | 39 | 2013 |
| Secure parallel computation on national scale volumes of data S Mazloom, PH Le, S Ranellucci, SD Gordon 29th USENIX Security Symposium (USENIX Security 20), 2487-2504, 2020 | 34 | 2020 |
| Compressed oblivious encoding for homomorphically encrypted search SG Choi, D Dachman-Soled, SD Gordon, L Liu, A Yerukhimovich Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications …, 2021 | 30 | 2021 |
