| The exact round complexity of secure computation S Garg, P Mukherjee, O Pandey, A Polychroniadou Annual International Conference on the Theory and Applications of …, 2016 | 64 | 2016 |
| Four round secure computation without setup Z Brakerski, S Halevi, A Polychroniadou Theory of Cryptography Conference, 645-677, 2017 | 52 | 2017 |
| Two-round adaptively secure MPC from indistinguishability obfuscation S Garg, A Polychroniadou Theory of Cryptography Conference, 614-637, 2015 | 51 | 2015 |
| Laconic oblivious transfer and its applications C Cho, N Döttling, S Garg, D Gupta, P Miao, A Polychroniadou Annual International Cryptology Conference, 33-65, 2017 | 47 | 2017 |
| A coding-theoretic approach to recovering noisy RSA keys KG Paterson, A Polychroniadou, DL Sibborn International Conference on the Theory and Application of Cryptology and …, 2012 | 43 | 2012 |
| Round-optimal secure multi-party computation S Halevi, C Hazay, A Polychroniadou, M Venkitasubramaniam Journal of Cryptology 34 (3), 1-63, 2021 | 33 | 2021 |
| Composable security in the tamper-proof hardware model under minimal complexity C Hazay, A Polychroniadou, M Venkitasubramaniam Theory of Cryptography Conference, 367-399, 2016 | 28* | 2016 |
| On the communication required for unconditionally secure multiplication I Damgård, JB Nielsen, A Polychroniadou, M Raskin Annual International Cryptology Conference, 459-488, 2016 | 26 | 2016 |
| Efficient multi-party computation: from passive to active security via secure SIMD circuits D Genkin, Y Ishai, A Polychroniadou Annual Cryptology Conference, 721-741, 2015 | 26 | 2015 |
| Adaptively secure multi-party computation from LWE (via equivocal FHE) I Damgård, A Polychroniadou, V Rao Public-Key Cryptography--PKC 2016, 208-233, 2016 | 20* | 2016 |
| DNS Cache-Based User Tracking. A Klein, B Pinkas NDSS, 2019 | 18 | 2019 |
| More is less: Perfectly secure oblivious algorithms in the multi-server setting THH Chan, J Katz, K Nayak, A Polychroniadou, E Shi International Conference on the Theory and Application of Cryptology and …, 2018 | 13 | 2018 |
| Constant round adaptively secure protocols in the tamper-proof hardware model C Hazay, A Polychroniadou, M Venkitasubramaniam IACR International Workshop on Public Key Cryptography, 428-460, 2017 | 12 | 2017 |
| Two-round adaptively secure multiparty computation from standard assumptions F Benhamouda, H Lin, A Polychroniadou, M Venkitasubramaniam Theory of Cryptography Conference, 175-205, 2018 | 9 | 2018 |
| Efficient leakage resilient circuit compilers M Andrychowicz, I Damgård, S Dziembowski, S Faust, A Polychroniadou Cryptographers’ Track at the RSA Conference, 311-329, 2015 | 8 | 2015 |
| Limits of practical sublinear secure computation E Boyle, Y Ishai, A Polychroniadou Annual International Cryptology Conference, 302-332, 2018 | 7 | 2018 |
| On the communication and round complexity of secure computation A Polychroniadou PhD thesis, Aarhus University, 2016 | 6 | 2016 |
| Laconic receiver oblivious transfer and applications C Cho, N Döttling, S Garg, D Gupta, P Miao, A Polychroniadou Manuscript, 2017 | 5 | 2017 |
| Succinct non-interactive secure computation A Morgan, R Pass, A Polychroniadou Annual International Conference on the Theory and Applications of …, 2020 | 2 | 2020 |
| Differentially Private Secure Multi-Party Computation for Federated Learning in Financial Applications D Byrd, A Polychroniadou arXiv preprint arXiv:2010.05867, 2020 | 1 | 2020 |
Muthuramakrishnan Venkitasubraman...Associate Professor of Computer Science, University of RochesterVerified email at cs.rochester.edu
