Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission. - Arpita Patra; Ashish Choudhary; K. Srinathan 001; C. Pandu Rangan (INDOCRYPT, 2006)

Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary. - Arpita Patra; Bhavani Shankar; Ashish Choudhary; K. Srinathan 001; C. Pandu Rangan (CANS, 2007)

Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality. - Kannan Srinathan; Arpita Patra; Ashish Choudhary; C. Pandu Rangan (INDOCRYPT, 2007)

Constant phase efficient protocols for secure message transmission in directed networks. - Arpita Patra; Ashish Choudhary; Chandrasekaran Pandu Rangan (PODC, 2007)

Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary. - Arpita Patra; Ashish Choudhary; Kannan Srinathan; C. Pandu Rangan (DISC, 2007)

Indoor versus Outdoor Scene Classification Using Probabilistic Neural Network. - Lalit Gupta; Vinod Pathangay; Arpita Patra; A. Dyana; Sukhendu Das (EURASIP J. Adv. Signal Process., 2007)

Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. - Arpita Patra; Ashish Choudhary; Madhu Vaidyanathan; C. Pandu Rangan (ACISP, 2008)

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary. - Ashish Choudhary; Arpita Patra; B. V. Ashwinkumar; K. Srinathan 001; C. Pandu Rangan (ICITS, 2008)

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 (PODC, 2008)

Efficient single phase unconditionally secure message transmission with optimum communication complexity. - Kannan Srinathan; Ashish Choudhary; Arpita Patra; C. Pandu Rangan (PODC, 2008)

Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (SCN, 2008)

Perfectly Secure Message Transmission Tolerating Mixed Adversary. - Arpita Patra; Ashish Choudhury; B. V. Ashwinkumar; Kannan Srinathan; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary. - Arpita Patra; Ashish Choudhary; Madhu Gayatri; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Statistically Reliable and Secure Message Transmission in Directed Networks. - Arpita Patra; Ashish Choudhury; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Round Efficient Unconditionally Secure Multiparty Computation Protocol. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Efficient Asynchronous Byzantine Agreement with Optimal Resilience. - Arpita Patra; Ashish Choudhury; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Efficient Asynchronous Multiparty Computation with Optimal Resilience. - Arpita Patra; Ashish Choudhury; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Unconditionally Secure Multiparty Set Intersection Re-Visited. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

The Round Complexity of Verifiable Secret Sharing Revisited. - Arpita Patra; Ashish Choudhary; Tal Rabin; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Unconditionally Reliable Message Transmission in Directed Hypergraphs. - Kannan Srinathan; Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Unconditionally Secure Message Transmission in Arbitrary Directed Synchronous Networks Tolerating Generalized Mixed Adversary. - Kannan Srinathan; Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Enhancing decision combination of face and fingerprint by exploitation of individual classifier space: An approach to multi-modal biometry. - Arpita Patra; Sukhendu Das (Pattern Recognit., 2008)

Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (Inscrypt, 2009)

On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. - Ashish Choudhary; Arpita Patra; B. V. Ashwinkumar; Kannan Srinathan; C. Pandu Rangan (ICDCN, 2009)

Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (ICITS, 2009)

Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (INDOCRYPT, 2009)

Simple and efficient asynchronous byzantine agreement with optimal resilience. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (PODC, 2009)

Brief announcement: perfectly secure message transmission in directed networks re-visited. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (PODC, 2009)

Multi Party Distributed Private Matching, Set Disjointness and Cardinality Set Intersection with Information Theoretic Security. - G. Sathya Narayanan; T. Aishwarya; Anugrah Agrawal; Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2009)

Information Theoretically Secure Multi Party Set Intersection Re-Visited. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2009)

On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2009)

Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2009)

Communication Optimal Multi-Valued Asynchronous Byzantine Agreement with Optimal Resilience. - Arpita Patra; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2009)

Perfectly reliable and secure message transmission tolerating mobile adversary. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan; Kannan Srinathan; Prasad Raghavendra (Int. J. Appl. Cryptogr., 2009)

The Round Complexity of Verifiable Secret Sharing: The Statistical Case. - Ranjit Kumaresan; Arpita Patra; C. Pandu Rangan (ASIACRYPT, 2010)

On Communication Complexity of Secure Message Transmission in Directed Networks. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (ICDCN, 2010)

Communication Optimal Multi-valued Asynchronous Broadcast Protocol. - Arpita Patra; C. Pandu Rangan (LATINCRYPT, 2010)

Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity. - Arpita Patra; Ashish Choudhury; C. Pandu Rangan (PODC, 2010)

Brief announcement: communication efficient asynchronous byzantine agreement. - Arpita Patra; C. Pandu Rangan (PODC, 2010)

Communication and Round Efficient Information Checking Protocol - Arpita Patra; C. Pandu Rangan (CoRR, 2010)

The Round Complexity of General VSS. - Ashish Choudhury; Kaoru Kurosawa; Arpita Patra (IACR Cryptol. ePrint Arch., 2010)

Studies on Verifiable Secret Sharing, Byzantine Agreement and Multiparty Computation. - Arpita Patra (IACR Cryptol. ePrint Arch., 2010)

Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2010)

Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality. - Arpita Patra; Ashish Choudhury; C. Pandu Rangan; Kannan Srinathan (Int. J. Appl. Cryptogr., 2010)

The Round Complexity of Perfectly Secure General VSS. - Ashish Choudhury; Kaoru Kurosawa; Arpita Patra (ICITS, 2011)

Computational Verifiable Secret Sharing Revisited. - Michael Backes 001; Aniket Kate; Arpita Patra (IACR Cryptol. ePrint Arch., 2011)

Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. - Ashish Choudhury; Kaoru Kurosawa; Arpita Patra (IACR Cryptol. ePrint Arch., 2011)

Statistical Asynchronous Weak Commitment Scheme: A New Primitive to Design Statistical Asynchronous Verifiable Secret Sharing Scheme. - Ashish Choudhury; Arpita Patra (IACR Cryptol. ePrint Arch., 2011)

On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks. - Ashish Choudhury; Arpita Patra (IACR Cryptol. ePrint Arch., 2011)

Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity. - Arpita Patra (IACR Cryptol. ePrint Arch., 2011)

Secure message transmission in asynchronous networks. - Ashish Choudhury; Arpita Patra; B. V. Ashwinkumar; Kannan Srinathan; C. Pandu Rangan (J. Parallel Distributed Comput., 2011)

Brief announcement: efficient optimally resilient statistical AVSS and its applications. - Ashish Choudhury; Arpita Patra (PODC, 2012)

Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity. - Ashish Choudhury; Martin Hirt; Arpita Patra (IACR Cryptol. ePrint Arch., 2012)

On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission. - Ashwinkumar Badanidiyuru; Arpita Patra; Ashish Choudhury; Kannan Srinathan; C. Pandu Rangan (J. ACM, 2012)

Asynchronous Multiparty Computation with Linear Communication Complexity. - Ashish Choudhury; Martin Hirt; Arpita Patra (DISC, 2013)

Between a Rock and a Hard Place: Interpolating Between MPC and FHE. - Ashish Choudhury; Jake Loftus; Emmanuela Orsini; Arpita Patra; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2013)

One-Sided Adaptively Secure Two-Party Computation. - Carmit Hazay; Arpita Patra (IACR Cryptol. ePrint Arch., 2013)

Reducing the Overhead of MPC over a Large Population. - Ashish Choudhury; Arpita Patra; Nigel P. Smart (SCN, 2014)

Asynchronous Byzantine Agreement with optimal resilience. - Arpita Patra; Ashish Choudhury; C. Pandu Rangan (Distributed Comput., 2014)

Anonymous Authentication with Shared Secrets. - Joël Alwen; Martin Hirt; Ueli Maurer; Arpita Patra; Pavel Raykov (IACR Cryptol. ePrint Arch., 2014)

Key-Indistinguishable Message Authentication Codes. - Joël Alwen; Martin Hirt; Ueli Maurer; Arpita Patra; Pavel Raykov (IACR Cryptol. ePrint Arch., 2014)

Reducing the Overhead of Cloud MPC. - Ashish Choudhury; Arpita Patra; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2014)

Optimally Resilient Asynchronous MPC with Linear Communication Complexity. - Ashish Choudhury; Arpita Patra (ICDCN, 2015)

Linear Overhead Robust MPC with Honest Majority Using Preprocessing. - Ashish Choudhury; Emmanuela Orsini; Arpita Patra; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2015)

Adaptively Secure Computation with Partial Erasures. - Carmit Hazay; Yehuda Lindell; Arpita Patra (IACR Cryptol. ePrint Arch., 2015)

Selective Opening Security for Receivers. - Carmit Hazay; Arpita Patra; Bogdan Warinschi (IACR Cryptol. ePrint Arch., 2015)

Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation. - Arpita Patra; Ashish Choudhury; C. Pandu Rangan (J. Cryptol., 2015)

Broadcast Extensions with Optimal Communication and Round Complexity. - Chaya Ganesh; Arpita Patra (PODC, 2016)

Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. - Ashish Choudhury; Emmanuela Orsini; Arpita Patra; Nigel P. Smart (SCN, 2016)

Fast Actively Secure OT Extension for Short Secrets. - Arpita Patra; Pratik Sarkar; Ajith Suresh (IACR Cryptol. ePrint Arch., 2016)

Round and Communication Efficient Unconditionally-Secure MPC with t t n / 3 in Partially Synchronous Network. - Ashish Choudhury; Arpita Patra; Divya Ravi 001 (ICITS, 2017)

Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited. - Ashish Choudhury; Gayathri Garimella; Arpita Patra; Divya Ravi 001; Pratik Sarkar (DISC, 2017)

Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security. - Megha Byali; Arpita Patra; Divya Ravi 001; Pratik Sarkar (IACR Cryptol. ePrint Arch., 2017)

Round and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network. - Ashish Choudhury; Arpita Patra; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2017)

Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic. - Yashvanth Kondi; Arpita Patra (IACR Cryptol. ePrint Arch., 2017)

Efficient One-Sided Adaptively Secure Computation. - Carmit Hazay; Arpita Patra (J. Cryptol., 2017)

An Efficient Framework for Unconditionally Secure Multiparty Computation. - Ashish Choudhury; Arpita Patra (IEEE Trans. Inf. Theory, 2017)

Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract). - Ashish Choudhury; Gayathri Garimella; Arpita Patra; Divya Ravi 001; Pratik Sarkar (SIROCCO, 2018)

Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. - Laasya Bangalore; Ashish Choudhury; Arpita Patra (IACR Cryptol. ePrint Arch., 2018)

Fast Secure Computation for Small Population over the Internet. - Megha Byali; Arun Joseph; Arpita Patra; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2018)

Crash-tolerant Consensus in Directed Graph Revisited. - Ashish Choudhury; Gayathri Garimella; Arpita Patra; Divya Ravi 001; Pratik Sarkar (IACR Cryptol. ePrint Arch., 2018)

Efficient Adaptively Secure Zero-knowledge from Garbled Circuits. - Chaya Ganesh; Yashvanth Kondi; Arpita Patra; Pratik Sarkar (IACR Cryptol. ePrint Arch., 2018)

On the Power of Hybrid Networks in Multi-Party Computation. - Arpita Patra; Divya Ravi 001 (IEEE Trans. Inf. Theory, 2018)

Fast Actively Secure Five-Party Computation with Security Beyond Abort. - Megha Byali; Carmit Hazay; Arpita Patra; Swati Singla (IACR Cryptol. ePrint Arch., 2019)

ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. - Harsh Chaudhari; Ashish Choudhury; Arpita Patra; Ajith Suresh (IACR Cryptol. ePrint Arch., 2019)

Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. - Arpita Patra; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2019)

The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract). - Benny Applebaum; Eliran Kachlon; Arpita Patra (TCC (2), 2020)

The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. - Benny Applebaum; Eliran Kachlon; Arpita Patra (Electron. Colloquium Comput. Complex., 2020)

The Resiliency of MPC with Low Interaction: The Benefit of Making Errors. - Benny Applebaum; Eliran Kachlon; Arpita Patra (IACR Cryptol. ePrint Arch., 2020)

SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. - Nishat Koti; Mahak Pancholi; Arpita Patra; Ajith Suresh (IACR Cryptol. ePrint Arch., 2020)

On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation. - Arpita Patra; Divya Ravi 001; Swati Singla (IACR Cryptol. ePrint Arch., 2020)

BLAZE: Blazing Fast Privacy-Preserving Machine Learning. - Arpita Patra; Ajith Suresh (IACR Cryptol. ePrint Arch., 2020)

ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation. - Arpita Patra; Thomas Schneider 003; Ajith Suresh; Hossein Yalame (IACR Cryptol. ePrint Arch., 2020)

The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited. - Laasya Bangalore; Ashish Choudhury; Arpita Patra (J. ACM, 2020)

FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning. - Megha Byali; Harsh Chaudhari; Arpita Patra; Ajith Suresh (Proc. Priv. Enhancing Technol., 2020)

Optimal extension protocols for byzantine broadcast and agreement. - Chaya Ganesh; Arpita Patra (Distributed Comput., 2021)

Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security. - Benny Applebaum; Eliran Kachlon; Arpita Patra (IACR Cryptol. ePrint Arch., 2021)

Tetrad: Actively Secure 4PC for Secure Training and Inference. - Nishat Koti; Arpita Patra; Rahul Rachuri; Ajith Suresh (IACR Cryptol. ePrint Arch., 2021)

Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. - Arpita Patra; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2021)

SynCirc: Efficient Synthesis of Depth-Optimized Circuits for Secure Computation. - Arpita Patra; Thomas Schneider 003; Ajith Suresh; Hossein Yalame (IACR Cryptol. ePrint Arch., 2021)

On the Exact Round Complexity of Secure Three-Party Computation. - Arpita Patra; Divya Ravi 001 (J. Cryptol., 2021)

Poster: Vogue: Faster Computation of Private Heavy Hitters. - Pranav Jangir; Nishat Koti; Varsha Bhat Kukkala; Arpita Patra; Bhavish Raj Gopal; Somya Sangal (CCS, 2022)

Poster MPClan: : Protocol Suite for Privacy-Conscious Computations. - Nishat Koti; Shravani Patil; Arpita Patra; Ajith Suresh (CCS, 2022)

Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority - (Extended Abstract). - Benny Applebaum; Eliran Kachlon; Arpita Patra (CRYPTO (4), 2022)

Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract). - Benny Applebaum; Eliran Kachlon; Arpita Patra (TCC (2), 2022)

Privadome: Protecting Citizen Privacy from Delivery Drones. - Gokulnath Pillai; Eikansh Gupta; Ajith Suresh; Vinod Ganapathy; Arpita Patra (CoRR, 2022)

Attaining GOD Beyond Honest Majority With Friends and Foes. - Aditya Hegde 003; Nishat Koti; Varsha Bhat Kukkala; Shravani Patil; Arpita Patra; Protik Paul (IACR Cryptol. ePrint Arch., 2022)

Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. - Ittai Abraham; Gilad Asharov; Shravani Patil; Arpita Patra (IACR Cryptol. ePrint Arch., 2022)

On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. - Bar Alon; Olga Nissenbaum; Eran Omri; Anat Paskin-Cherniavsky; Arpita Patra (IACR Cryptol. ePrint Arch., 2022)

Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications. - Benny Applebaum; Yuval Ishai; Or Karni; Arpita Patra (IACR Cryptol. ePrint Arch., 2022)

Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority. - Benny Applebaum; Eliran Kachlon; Arpita Patra (IACR Cryptol. ePrint Arch., 2022)

Fully-Secure MPC with Minimal Trust. - Yuval Ishai; Arpita Patra; Sikhar Patranabis; Divya Ravi 001; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2022)

PentaGOD: Stepping beyond Traditional GOD with Five Parties. - Nishat Koti; Varsha Bhat Kukkala; Arpita Patra; Bhavish Raj Gopal (IACR Cryptol. ePrint Arch., 2022)

MPClan: Protocol Suite for Privacy-Conscious Computations. - Nishat Koti; Shravani Patil; Arpita Patra; Ajith Suresh (IACR Cryptol. ePrint Arch., 2022)

How to prove any NP statement jointly? Efficient Distributed-prover Zero-Knowledge Protocols. - Pankaj Dayama 001; Arpita Patra; Protik Paul; Nitin Singh; Dhinakaran Vinayagamurthy (Proc. Priv. Enhancing Technol., 2022)

A Survey on Perfectly Secure Verifiable Secret-sharing. - Anirudh Chandramouli; Ashish Choudhury; Arpita Patra (ACM Comput. Surv., 2022)

The Round Complexity of Statistical MPC with Optimal Resiliency. - Benny Applebaum; Eliran Kachlon; Arpita Patra (Electron. Colloquium Comput. Complex., 2023)

Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time. - Ittai Abraham; Gilad Asharov; Shravani Patil; Arpita Patra (IACR Cryptol. ePrint Arch., 2023)

Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time. - Ittai Abraham; Gilad Asharov; Arpita Patra; Gilad Stern (IACR Cryptol. ePrint Arch., 2023)

sfAsterisk: Super-fast MPC with a Friend. - Banashri Karmakar; Nishat Koti; Arpita Patra; Sikhar Patranabis; Protik Paul; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2023)

Shield: Secure Allegation Escrow System with Stronger Guarantees. - Nishat Koti; Varsha Bhat Kukkala; Arpita Patra; Bhavish Raj Gopal (IACR Cryptol. ePrint Arch., 2023)

Entrada to Secure Graph Convolutional Networks. - Nishat Koti; Varsha Bhat Kukkala; Arpita Patra; Bhavish Raj Gopal (IACR Cryptol. ePrint Arch., 2023)

CompactTag: Minimizing Computation Overheads in Actively-Secure MPC for Deep Neural Networks. - Yongqin Wang; Pratik Sarkar; Nishat Koti; Arpita Patra; Murali Annavaram (IACR Cryptol. ePrint Arch., 2023)

On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience. - Ashish Choudhury; Arpita Patra (J. Cryptol., 2023)

Find Thy Neighbourhood: Privacy-Preserving Local Clustering. - Pranav Shriram A; Nishat Koti; Varsha Bhat Kukkala; Arpita Patra; Bhavish Raj Gopal (Proc. Priv. Enhancing Technol., 2023)

MPClan: Protocol Suite for Privacy-Conscious Computations. - Nishat Koti; Shravani Mahesh Patil; Arpita Patra; Ajith Suresh (J. Cryptol., 2023)

Ruffle: Rapid 3-Party Shuffle Protocols. - Pranav Shriram A; Nishat Koti; Varsha Bhat Kukkala; Arpita Patra; Bhavish Raj Gopal; Somya Sangal (Proc. Priv. Enhancing Technol., 2023)

Asterisk: Super-fast MPC with a Friend. - Banashri Karmakar; Nishat Koti; Arpita Patra; Sikhar Patranabis; Protik Paul; Divya Ravi 001 (SP, 2024)

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 (TCC (4), 2024)

Perfect Asynchronous MPC with Linear Communication Overhead. - Ittai Abraham; Gilad Asharov; Shravani Patil; Arpita Patra (IACR Cryptol. ePrint Arch., 2024)

QuickPool: Privacy-Preserving Ride-Sharing Service. - Banashri Karmakar; Shyam Murthy; Arpita Patra; Protik Paul (IACR Cryptol. ePrint Arch., 2024)

Graphiti: Secure Graph Computation Made More Scalable. - Nishat Koti; Varsha Bhat Kukkala; Arpita Patra; Bhavish Raj Gopal (IACR Cryptol. ePrint Arch., 2024)

Perfectly-secure Network-agnostic MPC with Optimal Resiliency. - Shravani Patil; Arpita Patra (IACR Cryptol. ePrint Arch., 2024)

Privadome: Delivery Drones and Citizen Privacy. - Gokulnath Pillai; Ajith Suresh; Eikansh Gupta; Vinod Ganapathy; Arpita Patra (Proc. Priv. Enhancing Technol., 2024)

Vogue: Faster Computation of Private Heavy Hitters. - Pranav Jangir; Nishat Koti; Varsha Bhat Kukkala; Arpita Patra; Bhavish Raj Gopal; Somya Sangal (IEEE Trans. Dependable Secur. Comput., 2024)

New Upper and Lower Bounds for Perfectly Secure MPC. - Ivan Damgård; Shravani Patil; Arpita Patra; Lawrence Roy (IACR Cryptol. ePrint Arch., 2025)

emGraph: Efficient Multiparty Secure Graph Computation. - Siddharth Kapoor; Nishat Koti; Varsha Bhat Kukkala; Arpita Patra; Bhavish Raj Gopal (IACR Cryptol. ePrint Arch., 2025)

Match Quest: Fast and Secure Pattern Matching. - Pranav Jangir; Nishat Koti; Varsha Bhat Kukkala; Arpita Patra; Bhavish Raj Gopal (Proc. Priv. Enhancing Technol., 2025)

Fault-Tolerant Distributed Consensus in Synchronous Networks - Ashish Choudhury; Arpita Patra (Springer, 2025)