{ABY2. 0}: Improved {Mixed-Protocol} secure {Two-Party} computation A Patra, T Schneider, A Suresh, H Yalame 30th USENIX Security Symposium (USENIX Security 21), 2165-2182, 2021 | 211 | 2021 |
BLAZE: blazing fast privacy-preserving machine learning A Patra, A Suresh NDSS 2020, 2020 | 183 | 2020 |
FLASH: fast and robust framework for privacy-preserving machine learning M Byali, H Chaudhari, A Patra, A Suresh Proceedings on Privacy Enhancing Technologies,, 2020 | 147 | 2020 |
ASTRA: high throughput 3pc over rings with application to secure prediction H Chaudhari, A Choudhury, A Patra, A Suresh Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security …, 2019 | 136 | 2019 |
{SWIFT}: Super-fast and robust {Privacy-Preserving} machine learning N Koti, M Pancholi, A Patra, A Suresh 30th USENIX Security Symposium (USENIX Security 21), 2651-2668, 2021 | 113 | 2021 |
Computational verifiable secret sharing revisited M Backes, A Kate, A Patra Advances in Cryptology–ASIACRYPT 2011: 17th International Conference on the …, 2011 | 99 | 2011 |
The round complexity of verifiable secret sharing revisited A Patra, A Choudhary, T Rabin, CP Rangan Advances in Cryptology-CRYPTO 2009: 29th Annual International Cryptology …, 2009 | 65 | 2009 |
Tetrad: Actively secure 4pc for secure training and inference N Koti, A Patra, R Rachuri, A Suresh arXiv preprint arXiv:2106.02850, 2021 | 61 | 2021 |
An efficient framework for unconditionally secure multiparty computation A Choudhury, A Patra IEEE Transactions on Information Theory 63 (1), 428-468, 2016 | 58 | 2016 |
Multi party distributed private matching, set disjointness and cardinality of set intersection with information theoretic security G Sathya Narayanan, T Aishwarya, A Agrawal, A Patra, A Choudhary, ... Cryptology and Network Security: 8th International Conference, CANS 2009 …, 2009 | 57 | 2009 |
Efficient asynchronous verifiable secret sharing and multiparty computation A Patra, A Choudhury, C Pandu Rangan Journal of Cryptology 28, 49-109, 2015 | 52 | 2015 |
The round complexity of verifiable secret sharing: The statistical case R Kumaresan, A Patra, CP Rangan Advances in Cryptology-ASIACRYPT 2010: 16th International Conference on the …, 2010 | 52 | 2010 |
Error-free multi-valued broadcast and Byzantine agreement with optimal communication complexity A Patra International Conference On Principles Of Distributed Systems, 34-49, 2011 | 51 | 2011 |
On the exact round complexity of secure three-party computation A Patra, D Ravi Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018 | 49 | 2018 |
Unconditionally reliable and secure message transmission in undirected synchronous networks: Possibility, feasibility and optimality A Patra, A Choudhury, C Pandu Rangan, K Srinathan International Journal of Applied Cryptography 2 (2), 159-197, 2010 | 49 | 2010 |
Between a Rock and a Hard Place: Interpolating between MPC and FHE A Choudhury, J Loftus, E Orsini, A Patra, NP Smart International conference on the theory and application of cryptology and …, 2013 | 47 | 2013 |
Asynchronous multiparty computation with linear communication complexity A Choudhury, M Hirt, A Patra International Symposium on Distributed Computing, 388-402, 2013 | 46 | 2013 |
Efficient statistical asynchronous verifiable secret sharing with optimal resilience A Patra, A Choudhary, CP Rangan International Conference on Information Theoretic Security, 74-92, 2009 | 44 | 2009 |
Simple and efficient asynchronous byzantine agreement with optimal resilience A Patra, A Choudhary, C Pandu Rangan Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009 | 44 | 2009 |
Asynchronous byzantine agreement with optimal resilience A Patra, A Choudhury, CP Rangan Distributed computing 27 (2), 111-146, 2014 | 42 | 2014 |