Publications and Preprints
- Perfect Asynchronous MPC with Linear Communication Overhead. EUROCRYPT 2024.
Ittai Abraham , Gilad Asharov , Shravani Patil and Arpita Patra - Asterisk: Super-fast MPC with a Friend. IEEE S&P 2024.
Banashri Karmakar, Nishat Koti, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi - Privadome: A Framework for Citizen Privacy in the Delivery Drone Era. PoPETS 2024.
Gokulnath Pillai, Eikansh Gupta, Ajith Suresh, Vinod Ganapathy, Arpita Patra - MPClan: Protocol Suite for Privacy-Conscious Computations. Journal of Cryptology (JoC), 2023. Part of Topical Collection on Computing on Encrypted Data..
Nishat Koti, Shravani Patil, Arpita Patra, Ajith Suresh - Vogue: Faster Computation of Private Heavy Hitters. IEEE Transactions on Dependable and Secure Computing 2023.
Pranav Jangir, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal and Somya Sangal - Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. Journal of Cryptology, 2023.
Arpita Patra, Divya Ravi - The Round Complexity of Statistical MPC with Optimal Resiliency. STOC 2023.
Benny Applebaum, Eliran Kachlon, Arpita Patra. - Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time. EUROCRYPT 2023.
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra - Shield: Secure Allegation Escrow System with Stronger Guarantees. WWW 2023.
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal - On the Communication Efficiency of Statistically-Secure Asynchronous MPC. Journal of Cryptology, 2023.
Ashish, Choudhury, Arpita Patra - Ruffle: Rapid 3-Party Shuffle Protocols. PoPETS/PETS 2023.
Pranav Shriram A, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, Somya Sangal. - Find Thy Neighbourhood: Privacy-Preserving Local Clustering. PoPETS/PETS 2023.
Pranav Shriram A, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal. - Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority. CRYPTO 2022.
Benny Applebaum, Eliran Kachlon, Arpita Patra - Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications. CRYPTO 2022.
Benny Applebaum, Yuval Ishai, Orr Karni, Arpita Patra - Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security. TCC 2022 .
Benny Applebaum, Eliran Kachlon, Arpita Patra. - Fully-Secure MPC with Minimal Trust. TCC 2022 .
Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan. - On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. TCC 2022 .
Bar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra. - Attaining GOD Beyond Honest Majority With Friends and Foes. ASIACRYPT 2022 .
Aditya Hegde, Nishat Koti, Varsha Bhat Kukkala, Shravani Patil, Arpita Patra and Protik Paul. - PentaGOD: Stepping beyond traditional GOD with five parties. ACM CCS 2022.
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Rajgopal - A survey on Perfectly-Secure Verifiable Secret-Sharing. ACM Computing Survey 2022.
Anirudh C, Ashish Choudhury, Arpita Patra - Tetrad: Actively Secure 4PC for Secure Training and Inference. NDSS 2022.
Nishat Koti, Arpita Patra, Rahul Rachuri, Ajith Suresh - How to prove any NP statement jointly? Efficient Distributed-prover Zero-Knowledge Protocols. PoPETS/PETS 2022.
Pankaj Dayama, Arpita Patra, Protik Paul, Nitin Singh, Dhinakaran Vinayagamurthy - Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. CRYPTO 2021.
Arpita Patra, Akshayaram Srinivasan. - On the Exact Round Complexity of Three-party Computation. Journal of Cryptology 2021.
Full and extended version of CRYPTO 2018 [PDF]
Arpita Patra and Divya Ravi - SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. Usenix Security Symposium 2021. (Brief Announcement in NeurIPS PRIML and PPML Workshop 2020.)
Nishat Koti, Mahak Pancholi, Arpita Patra, Ajith Suresh. - ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation Usenix Security Symposium 2021.
Arpita Patra, Thomas Schneider, Ajith Suresh, Hossein Yalame - SynCirc: Efficient Synthesis of DepthâOptimized Circuits for Secure Computation
IEEE HOST 2021.
Arpita Patra, Thomas Schneider, Ajith Suresh, Hossein Yalame - The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. FOCS 2020.
Benny Applebaum, Eliran Kachlon, Arpita Patra - The Resiliency of MPC with Low Interaction: The Benefit of Making Errors. TCC 2020.
Benny Applebaum, Eliran Kachlon and Arpita Patra. - On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation. ASIACRYPT 2020.
Arpita Patra, Divya Ravi and Swati Singla - BLAZE: Blazing Fast Privacy-Preserving Machine Learning.
NDSS 2020.
Arpita Patra, Ajith Suresh - FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning.
PETS 2020.
Megha Byali, Harsh Chaudhari, Arpita Patra and Ajith Suresh - Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. Asiacrypt 2019.
Full and extended version in submission. [PDF].
Arpita Patra, Divya Ravi - ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. ACM CCSW 2019, PPML 2019.
Harsh Chaudhari, Ashish Choudhury, Arpita Patra and Ajith Suresh - Fast Actively-secure 5-Party Computation with Security Beyond Abort. ACM CCS 2019.
Megha Byali, Carmit Hazay, Arpita Patra and Swati Singla - On the power of Hybrid Networks in Secure Multi-party Computation. IEEE Transactions on Information Theory 2018.
Arpita Patra and Divya Ravi - On the Exact Round Complexity of Three-party Computation. CRYPTO'18.
Full and extended version in submission. [PDF].
Arpita Patra and Divya Ravi - Fast Secure Computation for Small Population over the Internet. ACM CCS'18.
with Megha Byali, Arun Joseph and Divya Ravi - Efficient Adaptively Secure Zero-knowledge from Garbled Circuits. PKC 2018.
with Chaya Ganesh, Yashvanth Kondi and Pratik Sarkar - Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic. CRYPTO 2017.
with Yashvanth Kondi - Fast Actively Secure OT Extension for Short Secrets. NDSS 2017.
with Pratik Sarkar and Ajith Suresh - Round and Communication Efficient Unconditionally-Secure MPC with n > 3t in Partially Synchronous Network. ICITS 2017.
with Ashish Choudhury and Divya Ravi - An Efficient Framework for Unconditionally-secure Multiparty Computation. IEEE Transactions on Information Theory.
with Ashish Choudhury - Efficient One-Sided Adaptively Secure Computation. Journal of Cryptology, 2016. Full and extended version of TCC 2014. [PDF].
with Carmit Hazay - Linear Overhead Robust MPC with Honest Majority Using Preprocessing. SCN 2016. [PDF].
with Ashish Choudhury, Emmanuela Orsini, Nigel Smart - Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation. Journal of Cryptology, 2015.
with Ashish Choudhary and C. Pandu Rangan - Adaptively Secure Computation with Partial Erasures. PODC 2015. Full and extended version in submission. [PDF].
with Carmit Hazay and Yehuda Lindell - Optimally Resilient Asynchronous MPC with Linear Communication Complexity. ICDCN 2015 .
with Ashish Choudhury - Reducing the Overhead of MPC over a Large Population. SCN 2014. PDF.
with Ashish Choudhury and Nigel P. Smart - One-Sided Adaptively Secure Two-Party Computation. TCC 2014, LNCS 8349, pp. 368-393, 2014.
with Carmit Hazay - Between a Rock and a Hard Place: Interpolating Between MPC and FHE. ASIACRYPT 2013, LNCS 8270, pp. 221-240, 2013. PDF.
with Ashish Choudhury, Jake Loftus, Emmanuela Orsini and Nigel P. Smart. - Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity. DISC 2013, LNCS 8205, pp. 406--421, 2013. [PDF].
with Ashish Choudhury and Martin Hirt - Brief Announcement: Efficient Optimally Resilient Statistical AVSS and Its Applications. Accepted in PODC 2012, pp. 103-104, ACM Press, 2012. PDF.
with Ashish Choudhury - Computational Verifiable Secret Sharing Revisited. ASIACRYPT 2011, LNCS 7073, pp. 590-609, 2011. PDF.
with Michael Backes and Aniket Kate - The Round Complexity of Verifiable Secret Sharing: The Statistical Case. ASIACRYPT 2010, LNCS 6477, pp. 431-447, 2010. PDF.
with Ranjit Kumaresan and C. Pandu Rangan - Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. AFRICACRYPT 2010, LNCS 6055, pp. 184--202, 2010.
with Ashish Choudhury and C. Pandu Rangan - Information Theoretically Secure Multi Party Set Intersection Re-Visited. SAC 2009, LNCS 5867, pp. 71--91, 2009. PDF.
with Ashish Choudhury and C. Pandu Rangan - The Round Complexity of Verifiable Secret Sharing Revisited. CRYPTO 2009, LNCS 5677, pp. 487--504, 2009. PDF.
with Ashish Choudhury, Tal Rabin and C. Pandu Rangan