| 2026 | EuroCrypt | New Upper and Lower Bounds for Perfectly Secure MPC. | Ivan Damgrd, Shravani Patil, Arpita Patra, Lawrence Roy |
| 2026 | SP | Breaking the Barrier for Asynchronous MPC with a Friend. | Banashri Karmakar, Aniket Kate, Shravani Patil, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi |
| 2025 | AsiaCCS | Pay What You Spend! Privacy-Aware Real-Time Pricing with High Precision IEEE 754 Floating Point Division. | Soumyadyuti Ghosh, Harishma Boyapally, Ajith Suresh, Arpita Patra, Soumyajit Dey, Debdeep Mukhopadhyay |
| 2025 | PODC | Perfectly-secure Network-agnostic MPC with Optimal Resiliency. | Shravani Patil, Arpita Patra |
| 2024 | CCS | Graphiti: Secure Graph Computation Made More Scalable. | Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal |
| 2024 | EuroCrypt | Perfect Asynchronous MPC with Linear Communication Overhead. | Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra |
| 2024 | SP | Asterisk: Super-fast MPC with a Friend. | Banashri Karmakar, Nishat Koti, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi |
| 2024 | TCC | Asynchronous Agreement on a Core Set in Constant Expected Time and More Efficient Asynchronous VSS and MPC. | Ittai Abraham, Gilad Asharov, Arpita Patra, Gilad Stern |
| 2023 | EuroCrypt | Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time. | Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra |
| 2023 | WWW | Shield: Secure Allegation Escrow System with Stronger Guarantees. | Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal |
| 2023 | STOC | The Round Complexity of Statistical MPC with Optimal Resiliency. | Benny Applebaum, Eliran Kachlon, Arpita Patra |
| 2022 | ASIACRYPT | Attaining GOD Beyond Honest Majority with Friends and Foes. | Aditya Hegde, Nishat Koti, Varsha Bhat Kukkala, Shravani Patil, Arpita Patra, Protik Paul |
| 2022 | CCS | Poster: Vogue: Faster Computation of Private Heavy Hitters. | Pranav Jangir, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, Somya Sangal |
| 2022 | CCS | PentaGOD: Stepping beyond Traditional GOD with Five Parties. | Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal |
| 2022 | CCS | Poster MPClan: : Protocol Suite for Privacy-Conscious Computations. | Nishat Koti, Shravani Patil, Arpita Patra, Ajith Suresh |
| 2022 | CRYPTO | Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications. | Benny Applebaum, Yuval Ishai, Or Karni, Arpita Patra |
| 2022 | CRYPTO | Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority - (Extended Abstract). | Benny Applebaum, Eliran Kachlon, Arpita Patra |
| 2022 | NDSS | Tetrad: Actively Secure 4PC for Secure Training and Inference. | Nishat Koti, Arpita Patra, Rahul Rachuri, Ajith Suresh |
| 2022 | TCC | Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. | Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra |
| 2022 | TCC | On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. | Bar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra |
| 2022 | TCC | Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract). | Benny Applebaum, Eliran Kachlon, Arpita Patra |
| 2022 | TCC | Fully-Secure MPC with Minimal Trust. | Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan |
| 2021 | CRYPTO | Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. | Arpita Patra, Akshayaram Srinivasan |
| 2020 | ASIACRYPT | On the Exact Round Complexity of Best-of-Both-Worlds Multi-party Computation. | Arpita Patra, Divya Ravi, Swati Singla |
| 2020 | FOCS | The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. | Benny Applebaum, Eliran Kachlon, Arpita Patra |
| 2020 | NDSS | BLAZE: Blazing Fast Privacy-Preserving Machine Learning. | Arpita Patra, Ajith Suresh |
| 2020 | TCC | The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract). | Benny Applebaum, Eliran Kachlon, Arpita Patra |
| 2019 | ASIACRYPT | Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. | Arpita Patra, Divya Ravi |
| 2019 | CCS | Fast Actively Secure Five-Party Computation with Security Beyond Abort. | Megha Byali, Carmit Hazay, Arpita Patra, Swati Singla |
| 2019 | CCS | ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. | Harsh Chaudhari, Ashish Choudhury, Arpita Patra, Ajith Suresh |
| 2018 | CCS | Fast Secure Computation for Small Population over the Internet. | Megha Byali, Arun Joseph, Arpita Patra, Divya Ravi |
| 2018 | CRYPTO | On the Exact Round Complexity of Secure Three-Party Computation. | Arpita Patra, Divya Ravi |
| 2018 | PKC | Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits. | Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar |
| 2018 | PODC | Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. | Laasya Bangalore, Ashish Choudhury, Arpita Patra |
| 2018 | SIROCCO | Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract). | Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar |
| 2017 | CRYPTO | Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic. | Yashvanth Kondi, Arpita Patra |
| 2017 | NDSS | Fast Actively Secure OT Extension for Short Secrets. | Arpita Patra, Pratik Sarkar, Ajith Suresh |
| 2016 | PODC | Broadcast Extensions with Optimal Communication and Round Complexity. | Chaya Ganesh, Arpita Patra |
| 2016 | SCN | Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. | Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart |
| 2015 | ASIACRYPT | Selective Opening Security for Receivers. | Carmit Hazay, Arpita Patra, Bogdan Warinschi |
| 2015 | ICDCN | Optimally Resilient Asynchronous MPC with Linear Communication Complexity. | Ashish Choudhury, Arpita Patra |
| 2015 | PODC | Adaptively Secure Computation with Partial Erasures. | Carmit Hazay, Yehuda Lindell, Arpita Patra |
| 2014 | SCN | Key-Indistinguishable Message Authentication Codes. | Jol Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov |
| 2014 | SCN | Reducing the Overhead of MPC over a Large Population. | Ashish Choudhury, Arpita Patra, Nigel P. Smart |
| 2014 | TCC | One-Sided Adaptively Secure Two-Party Computation. | Carmit Hazay, Arpita Patra |
| 2013 | ASIACRYPT | Between a Rock and a Hard Place: Interpolating between MPC and FHE. | Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, Nigel P. Smart |
| 2012 | PODC | Brief announcement: efficient optimally resilient statistical AVSS and its applications. | Ashish Choudhury, Arpita Patra |
| 2011 | ACNS | Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. | Ashish Choudhury, Kaoru Kurosawa, Arpita Patra |
| 2011 | ASIACRYPT | Computational Verifiable Secret Sharing Revisited. | Michael Backes, Aniket Kate, Arpita Patra |
| 2011 | ICISC | On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks. | Ashish Choudhury, Arpita Patra |
| 2011 | OPODIS | Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity. | Arpita Patra |
| 2010 | ASIACRYPT | The Round Complexity of Verifiable Secret Sharing: The Statistical Case. | Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan |
| 2010 | ICDCN | On Communication Complexity of Secure Message Transmission in Directed Networks. | Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2010 | PODC | Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity. | Arpita Patra, Ashish Choudhury, C. Pandu Rangan |
| 2010 | PODC | Brief announcement: communication efficient asynchronous byzantine agreement. | Arpita Patra, C. Pandu Rangan |
| 2009 | CANS | Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security. | G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2009 | CCS | Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary. | Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2009 | CRYPTO | The Round Complexity of Verifiable Secret Sharing Revisited. | Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan |
| 2009 | ICDCN | On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. | Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan |
| 2009 | INDOCRYPT | Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience. | Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2009 | PODC | Simple and efficient asynchronous byzantine agreement with optimal resilience. | Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2009 | PODC | Brief announcement: perfectly secure message transmission in directed networks re-visited. | Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2008 | ACISP | Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. | Arpita Patra, Ashish Choudhary, Madhu Vaidyanathan, C. Pandu Rangan |
| 2008 | CANS | Unconditionally Reliable Message Transmission in Directed Hypergraphs. | Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2008 | INDOCRYPT | Round Efficient Unconditionally Secure Multiparty Computation Protocol. | Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2008 | PODC | On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary. | B. V. Ashwinkumar, Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan |
| 2008 | PODC | Efficient single phase unconditionally secure message transmission with optimum communication complexity. | Kannan Srinathan, Ashish Choudhary, Arpita Patra, C. Pandu Rangan |
| 2008 | SCN | Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited. | Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2007 | CANS | Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary. | Arpita Patra, Bhavani Shankar, Ashish Choudhary, K. Srinathan, C. Pandu Rangan |
| 2007 | INDOCRYPT | Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality. | Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2007 | PODC | Constant phase efficient protocols for secure message transmission in directed networks. | Arpita Patra, Ashish Choudhary, Chandrasekaran Pandu Rangan |
| 2006 | INDOCRYPT | Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission. | Arpita Patra, Ashish Choudhary, K. Srinathan, C. Pandu Rangan |