Publications and Preprints
- BOOK: Fault-Tolerant Distributed Consensus in Synchronous Networks. Information Security and Cryptography, Springer 2025, ISBN 978-3-031-80459-5
.
Ashish Choudhury, Arpita Patra
- Perfectly-secure Network Agnostic MPC with Optimal Resiliency. PODC 2025.
Shravani Patil and Arpita Patra
- Match Quest: Fast and Secure Pattern Matching. PoPETS 2025.
Pranav Jangir, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal.
- Pay What You Spend! Privacy-Aware Real-Time Pricing with High Precision IEEE-754 Floating Point Division. AsiaCCS 2025.
Soumyadyuti Ghosh, Boyapally Harishma, Ajith Suresh, Arpita Patra, Soumyajit Dey, Debdeep Mukhopadhyay.
Publications and Preprints
- Perfect Asynchronous MPC with Linear Communication Overhead. EUROCRYPT 2024.
Ittai Abraham , Gilad Asharov , Shravani Patil and Arpita Patra
- Perfect Asynchronous Agreement on a Core Set in Constant Expected Time TCC 2024.
Ittai Abraham , Gilad Asharov , Arpita Patra and Gilad Stern
- Asterisk: Super-fast MPC with a Friend. IEEE S&P 2024.
Banashri Karmakar, Nishat Koti, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi
- Graphiti: Secure Graph Computation Made More Scalable. ACM CCS 2024.
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
- Privadome: A Framework for Citizen Privacy in the Delivery Drone Era. PoPETS 2024.
Gokulnath Pillai, Eikansh Gupta, Ajith Suresh, Vinod Ganapathy, Arpita Patra
Publications and Preprints
- 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
- On the Communication Efficiency of Statistically-Secure Asynchronous MPC. Journal of Cryptology, 2023.
Ashish, Choudhury, Arpita Patra
- 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
- 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.
Publications and Preprints
- BOOK: Secure Multi‑party Computation Against Passive Adversaries. “Synthesis Lectures
on Distributed Computing Theory”, Springer.
Ashish Choudhury, Arpita Patra
- 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.
- Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. TCC 2022 .
Ittai Abraham, Gilad Asharov, Shravani Patil, 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.
- A survey on Perfectly-Secure Verifiable Secret-Sharing. ACM Computing Survey 2022.
Anirudh C, Ashish Choudhury, Arpita Patra
- PentaGOD: Stepping beyond traditional GOD with five parties. ACM CCS 2022.
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Rajgopal
- 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
Publications and Preprints
- Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. CRYPTO 2021.
Arpita Patra, Akshayaram Srinivasan.
- 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
- 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
- Optimal Extension Protocols for Byzantine Broadcast and Agreement. Distributed Computing 2020.
Full and extended version of PODC'16 and OPODIS'11. [PDF].
Chaya Ganesh, Arpita Patra
Publications and Preprints
- 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.
- The Power of Shunning: Efficient Asynchronous Byzantine Agreement
Revisited. Journal of ACM 2020.
Full and extended version of PODC'18.
Laasya Bangalore, Ashish Choudhury 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
Publications and Preprints
- 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
Publications and Preprints
- On the power of Hybrid Networks in Secure Multi-party Computation. IEEE Transactions on Information Theory.
Arpita Patra and Divya Ravi
- On the Exact Round Complexity of Three-party Computation. CRYPTO'18.
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
- Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. PODC'18.
with Laasya Bangalore and Ashish Choudhury
- Crash-tolerant Consensus in Directed Graph Revisited. DISC 2017 (brief announcement); SIROCCO 2018 (full paper).
with Ashish Choudhury, Gayathri Garimella, Divya Ravi and Pratik Sarkar
- Efficient Adaptively Secure Zero-knowledge from Garbled Circuits. PKC 2018.
with Chaya Ganesh, Yashvanth Kondi and Pratik Sarkar
Publications and Preprints
- Efficient One-Sided Adaptively Secure Computation. Journal of Cryptology, 2017. Full and extended version of TCC 2014. [PDF].
with Carmit Hazay
- An Efficient Framework for Unconditionally-secure Multiparty Computation. IEEE Transactions on Information Theory.
with Ashish Choudhury
- 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
Publications
- Broadcast Extensions with Optimal Communication and Round Complexity. PODC 2016.
with Chaya Ganesh
- Linear Overhead Robust MPC with Honest Majority Using Preprocessing. SCN 2016. [PDF].
with Ashish Choudhury, Emmanuela Orsini, Nigel Smart
Publications and Preprints
- Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation. Journal of Cryptology, 2015.
with Ashish Choudhary and C. Pandu Rangan
- Selective Opening Security for Receivers. ASIACRYPT 2015. Full and extended version in submission. [PDF].
with Carmit Hazay and Bogdan Warinschi
- 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
Publications
- Efficient Asynchronous Byzantine Agreement with Optimal Resilience. Distributed Computing Journal, volume 27, number 2, pp. 111- 146, 2014. [PDF].
with Ashish Choudhary and C. Pandu Rangan
- Anonymous Authentication with Shared Secrets. LatinCrypt 2014. PDF.
with Joel Alwen, Martin Hirt, Ueli Maurer and Pavel Raykov
- Key-Indistinguishable Message Authentication Codes. SCN 2014. PDF.
with Joel Alwen, Martin Hirt, Ueli Maurer and Pavel Raykov
- 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
Publications
- 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
Publications
- On the Tradeoff Between Network Connectivity, Round Complexity and Communication Complexity of Reliable Message Transmission. Journal of ACM, 2012. PDF.
with Ashwinkumar Badanidiyuru, Ashish Choudhury, Kannan Srinathan and C. Pandu Rangan
- Brief Announcement: Efficient Optimally Resilient Statistical AVSS and Its Applications. PODC 2012, pp. 103-104, ACM Press, 2012. PDF.
with Ashish Choudhury
Publications
- Secure Message Transmission in Asynchronous Networks. Journal of Parallel and Distributed Computing, vol. 71, no. 8, pp. 1067-1074, 2011. PDF.
with Ashish Choudhury, Ashwinkumar B. V, Kannan Srinathan and C. Pandu Rangan
- Computational Verifiable Secret Sharing Revisited. ASIACRYPT 2011, LNCS 7073, pp. 590-609, 2011. PDF.
with Michael Backes and Aniket Kate
- Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity. OPODIS 2011, LNCS 7109, pp. 34-49, 2011. PDF.
- Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. ACNS 2011, LNCS 6715, pp. 292-308, 2011.PDF.
with Ashish Choudhury and Kaoru Kurosawa
Publications and Preprints
- Statistically Reliable and Secure Message Transmission in Directed Networks. In Submission. PDF.
with Ashish Choudhury and C. Pandu Rangan
- Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality. International Journal of Applied Cryptography (IJACT), vol 2, Issue 2, pp. 159-197, 2010. PDF.
with Ashish Choudhury, Kannan Srinathan and C. Pandu Rangan
- 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 Asynchronous Byzantine Agreement. PODC 2010, pp 243-244, ACM Press, 2010. PDF.
with 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
- On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks. ICDCN 2010, LNCS 5935, pp. 42--53, 2010.
with Ashish Choudhury and C. Pandu Rangan
Publications and Preprints
- Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience. In Submission. PDF.
with Ashish Choudhury and C. Pandu Rangan
- Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. International Journal of Applied Cryptography (IJACT), vol. 1, Issue 3, pp. 200-224, 2009.
with Ashish Choudhury, Kannan Srinathan, C. Pandu Rangan and Prasad Raghavendra
- 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
- Simple and Efficient Asynchronous Byzantine Agreement with Optimal Resilience. PODC 2009, pp. 92--101, ACM Press, 2009.
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
- Perfectly Secure Message Transmission in Directed Networks Revisited. PODC 2009, pp. 278--279, ACM Press, 2009.
with Ashish Choudhury and C. Pandu Rangan
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. ICDCN 2009, LNCS 5408, pp. 148--162, 2009.
with Ashish Choudhury, Ashwinkumar B.V, Kannan Srinathan and C. Pandu Rangan
Publications
- On Tradeoff Between Network Connectivity, Phase Complexity and Communication Complexity of Reliable Communication
Tolerating Mixed Adversary. PODC 2008, pp. 115--124, ACM Press, 2008
with Ashish Choudhury, Ashwinkumar B.V, Kannan Srinathan and C. Pandu Rangan
- Brief Announcement: Efficient Single Phase Unconditionally Secure Message Transmission
with Optimum Communication Complexity. PODC 2008, pp. 457, ACM Press, 2008.
with Ashish Choudhury, Kannan Srinathan and C. Pandu Rangan
- Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary. ACISP 2008, LNCS 5107, pp. 170--186, 2008.
with Ashish Choudhury, Madhu Gayatri and C. Pandu Rangan
- Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited. SCN 2008, LNCS 5229, pp. 309--326, 2008.
with Ashish Choudhury and C. Pandu Rangan
Publications
- Constant Phase Efficient Protocols for Perfectly Secure Message Transmission in Directed Networks. PODC 2007, pp. 322-323, ACM Press, 2007.
with Ashish Choudhury and C. Pandu Rangan
- Perfectly Secure Message Transmission in Directed Networks Tolerating Mixed Adversary. DISC 2007, LNCS 4731, pp.
496--498, 2007.
with Ashish Choudhury, Kannan Srinathan and C. Pandu Rangan