SynCirc: Efficient Synthesis of Depth-Optimized Circuits From High-Level Languages.

Arpita Patra

Arpita Patra Joachim Schmidt 0006 Thomas Schneider 0003 Ajith Suresh Hossein Yalame SynCirc: Efficient Synthesis of Depth-Optimized Circuits From High-Level Languages. 2026 June 2200-2211 75 IEEE Trans. Computers 6 https://doi.org/10.1109/TC.2026.3673169 db/journals/tc/tc75.html#PatraSSSY26 streams/journals/tc

Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal Entrada to Secure Graph Convolutional Networks<sup>1</sup>. 923-935 2026 January - February 23 IEEE Trans. Dependable Secur. Comput. 1 https://doi.org/10.1109/TDSC.2025.3611834 db/journals/tdsc/tdsc23.html#KotiKPG26 streams/journals/tdsc

Ivan Damgård Shravani Patil Arpita Patra Lawrence Roy New Upper and Lower Bounds for Perfectly Secure MPC. EUROCRYPT 2026 366-396 conf/eurocrypt/2026-3 https://doi.org/10.1007/978-3-032-25324-8_13 db/conf/eurocrypt/eurocrypt2026-3.html#DamgardPPR26 streams/conf/eurocrypt Banashri Karmakar Aniket Kate Shravani Patil Arpita Patra Sikhar Patranabis Protik Paul Divya Ravi 0001 Breaking the Barrier for Asynchronous MPC with a Friend. SP 2026 3262-3280 conf/sp/2026 https://doi.org/10.1109/SP63933.2026.00077 db/conf/sp/sp2026.html#KarmakarKPPPPR26 streams/conf/sp

Arpita Patra Joachim Schmidt 0006 Thomas Schneider 0003 Ajith Suresh Hossein Yalame SynCirc: Efficient Synthesis of Depth-Optimized Circuits from High-Level Languages (Extended Version). 561 2026 2026 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2026/561 db/journals/iacr/iacr2026.html#PatraSSSY26

Ashish Choudhury Arpita Patra Fault-Tolerant Distributed Consensus in Synchronous Networks Springer 2025 1-312 Information Security and Cryptography 978-3-031-80459-5 https://doi.org/10.1007/978-3-031-80460-1

Ittai Abraham Gilad Asharov Shravani Patil Arpita Patra Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. 36 2025 October 38 J. Cryptol. 4 https://doi.org/10.1007/s00145-025-09556-3 db/journals/joc/joc38.html#AbrahamAPP25 streams/journals/joc

Pranav Jangir Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal Match Quest: Fast and Secure Pattern Matching. 308-328 2025 2025 Proc. Priv. Enhancing Technol. 4 https://doi.org/10.56553/popets-2025-0132 db/journals/popets/popets2025.html#JangirKKPG25 streams/journals/popets

Soumyadyuti Ghosh Harishma Boyapally Ajith Suresh Arpita Patra Soumyajit Dey Debdeep Mukhopadhyay Pay What You Spend! Privacy-Aware Real-Time Pricing with High Precision IEEE 754 Floating Point Division. 87-103 2025 AsiaCCS https://doi.org/10.1145/3708821.3733913 conf/asiaccs/2025 db/conf/asiaccs/asiaccs2025.html#GhoshBSPDM25 Shravani Patil Arpita Patra Perfectly-secure Network-agnostic MPC with Optimal Resiliency. 121-130 2025 PODC https://doi.org/10.1145/3732772.3733500 conf/podc/2025 db/conf/podc/podc2025.html#PatilP25 Arpita Patra Topics in Cryptology - CT-RSA 2025 - Cryptographers' Track at the RSA Conference 2025, San Francisco, CA, USA, April 28-May 1, 2025, Proceedings CT-RSA Springer 2025 Lecture Notes in Computer Science 15598 978-3-031-88660-7 978-3-031-88661-4 https://doi.org/10.1007/978-3-031-88661-4 db/conf/ctrsa/ctrsa2025.html

Siddharth Kapoor Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal emGraph: Efficient Multiparty Secure Graph Computation. 590 2025 2025 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2025/590 db/journals/iacr/iacr2025.html#KapoorKKPG25 streams/journals/iacr

Ivan Damgård Shravani Patil Arpita Patra Lawrence Roy New Upper and Lower Bounds for Perfectly Secure MPC. 1206 2025 2025 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2025/1206 db/journals/iacr/iacr2025.html#DamgardPPR25

Ashish Choudhury Ivan Damgård Shravani Patil Arpita Patra Information-theoretic MPC with Constant Communication Overhead. 1555 2025 2025 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2025/1555 db/journals/iacr/iacr2025.html#ChoudhuryDPP25 streams/journals/iacr

Banashri Karmakar Aniket Kate Shravani Patil Arpita Patra Sikhar Patranabis Protik Paul Divya Ravi 0001 Breaking the Barrier for Asynchronous MPC with a Friend. 1736 2025 2025 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2025/1736 db/journals/iacr/iacr2025.html#KarmakarKPPPPR25 streams/journals/iacr

Gokulnath Pillai Ajith Suresh Eikansh Gupta Vinod Ganapathy Arpita Patra Privadome: Delivery Drones and Citizen Privacy. 29-48 2024 2024 Proc. Priv. Enhancing Technol. 2 https://doi.org/10.56553/popets-2024-0039 db/journals/popets/popets2024.html#PillaiSGGP24

Pranav Jangir Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal Somya Sangal Vogue: Faster Computation of Private Heavy Hitters. 3096-3108 2024 July - August 21 IEEE Trans. Dependable Secur. Comput. 4 https://doi.org/10.1109/TDSC.2023.3322511 db/journals/tdsc/tdsc21.html#JangirKKPGS24 streams/journals/tdsc

Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal Graphiti: Secure Graph Computation Made More Scalable. 4017-4031 2024 CCS https://doi.org/10.1145/3658644.3670393 conf/ccs/2024 db/conf/ccs/ccs2024.html#KotiKPG24 Ittai Abraham Gilad Asharov Shravani Patil Arpita Patra Perfect Asynchronous MPC with Linear Communication Overhead. 280-309 2024 EUROCRYPT (5) https://doi.org/10.1007/978-3-031-58740-5_10 conf/eurocrypt/2024-5 db/conf/eurocrypt/eurocrypt2024-5.html#AbrahamAPP24 Banashri Karmakar Nishat Koti Arpita Patra Sikhar Patranabis Protik Paul Divya Ravi 0001 Asterisk: Super-fast MPC with a Friend. 542-560 2024 SP https://doi.org/10.1109/SP54263.2024.00128 conf/sp/2024 db/conf/sp/sp2024.html#KarmakarKPPPR24 streams/conf/sp Ittai Abraham Gilad Asharov Arpita Patra Gilad Stern Asynchronous Agreement on a Core Set in Constant Expected Time and More Efficient Asynchronous VSS and MPC. 451-482 2024 TCC (4) https://doi.org/10.1007/978-3-031-78023-3_15 conf/tcc/2024-4 db/conf/tcc/tcc2024-4.html#AbrahamAPS24 streams/conf/tcc

Ittai Abraham Gilad Asharov Shravani Patil Arpita Patra Perfect Asynchronous MPC with Linear Communication Overhead. 432 2024 2024 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2024/432 db/journals/iacr/iacr2024.html#AbrahamAPP24

Shravani Patil Arpita Patra Perfectly-secure Network-agnostic MPC with Optimal Resiliency. 990 2024 2024 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2024/990 db/journals/iacr/iacr2024.html#PatilP24

Banashri Karmakar Shyam Murthy Arpita Patra Protik Paul QuickPool: Privacy-Preserving Ride-Sharing Service. 1109 2024 2024 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2024/1109 db/journals/iacr/iacr2024.html#KarmakarMPP24 streams/journals/iacr

Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal Graphiti: Secure Graph Computation Made More Scalable. 1756 2024 2024 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2024/1756 db/journals/iacr/iacr2024.html#KotiKPG24 streams/journals/iacr

Ashish Choudhury Arpita Patra On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience. 13 2023 April 36 J. Cryptol. 2 https://doi.org/10.1007/s00145-023-09451-9 db/journals/joc/joc36.html#ChoudhuryP23

Nishat Koti Shravani Mahesh Patil Arpita Patra Ajith Suresh MPClan: Protocol Suite for Privacy-Conscious Computations. 22 2023 July 36 J. Cryptol. 3 https://doi.org/10.1007/s00145-023-09469-z db/journals/joc/joc36.html#KotiPPS23

Pranav Shriram A Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal Find Thy Neighbourhood: Privacy-Preserving Local Clustering. 23-39 2023 April 2023 Proc. Priv. Enhancing Technol. 2 https://doi.org/10.56553/popets-2023-0039 db/journals/popets/popets2023.html#AKKPG23

Pranav Shriram A Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal Somya Sangal Ruffle: Rapid 3-Party Shuffle Protocols. 24-42 2023 July 2023 Proc. Priv. Enhancing Technol. 3 https://doi.org/10.56553/popets-2023-0068 db/journals/popets/popets2023.html#AKKPGS23

Ittai Abraham Gilad Asharov Shravani Patil Arpita Patra Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time. 251-281 2023 EUROCRYPT (2) https://doi.org/10.1007/978-3-031-30617-4_9 conf/eurocrypt/2023-2 db/conf/eurocrypt/eurocrypt2023-2.html#AbrahamAPP23 Benny Applebaum Eliran Kachlon Arpita Patra The Round Complexity of Statistical MPC with Optimal Resiliency. 1527-1536 2023 STOC https://doi.org/10.1145/3564246.3585228 https://www.wikidata.org/entity/Q130957567 conf/stoc/2023 db/conf/stoc/stoc2023.html#ApplebaumKP23 Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal Shield: Secure Allegation Escrow System with Stronger Guarantees. 2252-2262 2023 WWW https://doi.org/10.1145/3543507.3583391 conf/www/2023 db/conf/www/www2023.html#KotiKPG23

Yongqin Wang Pratik Sarkar Nishat Koti Arpita Patra Murali Annavaram CompactTag: Minimizing Computation Overheads in Actively-Secure MPC for Deep Neural Networks. 2023 abs/2311.04406 CoRR https://doi.org/10.48550/arXiv.2311.04406 db/journals/corr/corr2311.html#abs-2311-04406

Benny Applebaum Eliran Kachlon Arpita Patra The Round Complexity of Statistical MPC with Optimal Resiliency. TR23-031 2023 TR23 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2023/031 db/journals/eccc/eccc2023.html#ApplebaumKP23

Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal Shield: Secure Allegation Escrow System with Stronger Guarantees. 338 2023 2023 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2023/338 db/journals/iacr/iacr2023.html#KotiKPG23

Benny Applebaum Eliran Kachlon Arpita Patra The Round Complexity of Statistical MPC with Optimal Resiliency. 418 2023 2023 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2023/418 db/journals/iacr/iacr2023.html#ApplebaumKP23

Pranav Shriram A Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal Somya Sangal Ruffle: Rapid 3-party shuffle protocols. 431 2023 2023 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2023/431 db/journals/iacr/iacr2023.html#AKKPGS23

Ittai Abraham Gilad Asharov Shravani Patil Arpita Patra Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time. 557 2023 2023 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2023/557 db/journals/iacr/iacr2023.html#AbrahamAPP23

Banashri Karmakar Nishat Koti Arpita Patra Sikhar Patranabis Protik Paul Divya Ravi 0001 sfAsterisk: Super-fast MPC with a Friend. 1098 2023 2023 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2023/1098 db/journals/iacr/iacr2023.html#KarmakarKPPPR23

Ittai Abraham Gilad Asharov Arpita Patra Gilad Stern Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time. 1130 2023 2023 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2023/1130 db/journals/iacr/iacr2023.html#AbrahamAPS23

Yongqin Wang Pratik Sarkar Nishat Koti Arpita Patra Murali Annavaram CompactTag: Minimizing Computation Overheads in Actively-Secure MPC for Deep Neural Networks. 1729 2023 2023 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2023/1729 db/journals/iacr/iacr2023.html#WangSKPA23

Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal Entrada to Secure Graph Convolutional Networks. 1807 2023 2023 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2023/1807 db/journals/iacr/iacr2023.html#KotiKPG23a

Anirudh Chandramouli Ashish Choudhury Arpita Patra A Survey on Perfectly Secure Verifiable Secret-sharing. 232:1-232:36 2022 January 54 ACM Comput. Surv. 11s https://doi.org/10.1145/3512344 db/journals/csur/csur54.html#ChandramouliCP22

Pankaj Dayama 0001 Arpita Patra Protik Paul Nitin Singh Dhinakaran Vinayagamurthy How to prove any NP statement jointly? Efficient Distributed-prover Zero-Knowledge Protocols. 517-556 2022 2022 Proc. Priv. Enhancing Technol. 2 https://doi.org/10.2478/popets-2022-0055 db/journals/popets/popets2022.html#0001PPSV22

Aditya Hegde 0003 Nishat Koti Varsha Bhat Kukkala Shravani Patil Arpita Patra Protik Paul Attaining GOD Beyond Honest Majority with Friends and Foes. 556-587 2022 ASIACRYPT (1) https://doi.org/10.1007/978-3-031-22963-3_19 conf/asiacrypt/2022-1 db/conf/asiacrypt/asiacrypt2022-1.html#HegdeKKPPP22 Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal PentaGOD: Stepping beyond Traditional GOD with Five Parties. 1843-1856 2022 CCS https://doi.org/10.1145/3548606.3559369 conf/ccs/2022 db/conf/ccs/ccs2022.html#KotiKPG22 Pranav Jangir Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal Somya Sangal Poster: Vogue: Faster Computation of Private Heavy Hitters. 3371-3373 2022 CCS https://doi.org/10.1145/3548606.3563544 conf/ccs/2022 db/conf/ccs/ccs2022.html#JangirKKPGS22 Nishat Koti Shravani Patil Arpita Patra Ajith Suresh Poster MPClan: : Protocol Suite for Privacy-Conscious Computations. 3379-3381 2022 CCS https://doi.org/10.1145/3548606.3563496 conf/ccs/2022 db/conf/ccs/ccs2022.html#KotiPPS22 Benny Applebaum Eliran Kachlon Arpita Patra Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority - (Extended Abstract). 33-56 2022 CRYPTO (4) https://doi.org/10.1007/978-3-031-15985-5_2 conf/crypto/2022-4 db/conf/crypto/crypto2022-4.html#ApplebaumKP22 Benny Applebaum Yuval Ishai Or Karni Arpita Patra Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications. 453-482 2022 CRYPTO (4) https://doi.org/10.1007/978-3-031-15985-5_16 conf/crypto/2022-4 db/conf/crypto/crypto2022-4.html#ApplebaumIKP22 Nishat Koti Arpita Patra Rahul Rachuri Ajith Suresh Tetrad: Actively Secure 4PC for Secure Training and Inference. 2022 NDSS https://www.ndss-symposium.org/ndss-paper/auto-draft-202/ conf/ndss/2022 db/conf/ndss/ndss2022.html#KotiPRS22 Benny Applebaum Eliran Kachlon Arpita Patra Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract). 103-120 2022 TCC (2) https://doi.org/10.1007/978-3-031-22365-5_4 conf/tcc/2022-2 db/conf/tcc/tcc2022-2.html#ApplebaumKP22 Ittai Abraham Gilad Asharov Shravani Patil Arpita Patra Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. 384-414 2022 TCC (1) https://doi.org/10.1007/978-3-031-22318-1_14 conf/tcc/2022-1 db/conf/tcc/tcc2022-1.html#AbrahamAPP22 Yuval Ishai Arpita Patra Sikhar Patranabis Divya Ravi 0001 Akshayaram Srinivasan Fully-Secure MPC with Minimal Trust. 470-501 2022 TCC (2) https://doi.org/10.1007/978-3-031-22365-5_17 conf/tcc/2022-2 db/conf/tcc/tcc2022-2.html#IshaiPPRS22 Bar Alon 0001 Olga Nissenbaum Eran Omri Anat Paskin-Cherniavsky Arpita Patra On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. 532-561 2022 TCC (2) https://doi.org/10.1007/978-3-031-22365-5_19 conf/tcc/2022-2 db/conf/tcc/tcc2022-2.html#AlonNOPP22 Alastair R. Beresford Arpita Patra Emanuele Bellini 0002 Cryptology and Network Security - 21st International Conference, CANS 2022, Dubai, United Arab Emirates, November 13-16, 2022, Proceedings CANS Springer 2022 Lecture Notes in Computer Science 13641 978-3-031-20973-4 978-3-031-20974-1 https://doi.org/10.1007/978-3-031-20974-1 db/conf/cans/cans2022.html

Gokulnath Pillai Eikansh Gupta Ajith Suresh Vinod Ganapathy Arpita Patra Privadome: Protecting Citizen Privacy from Delivery Drones. 2022 abs/2205.04961 CoRR https://doi.org/10.48550/arXiv.2205.04961 db/journals/corr/corr2205.html#abs-2205-04961

Nishat Koti Shravani Patil Arpita Patra Ajith Suresh MPClan: Protocol Suite for Privacy-Conscious Computations. 2022 abs/2206.12224 CoRR https://doi.org/10.48550/arXiv.2206.12224 db/journals/corr/corr2206.html#abs-2206-12224

Benny Applebaum Eliran Kachlon Arpita Patra Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority. 167 2022 2022 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2022/167 db/journals/iacr/iacr2022.html#ApplebaumKP22

Nishat Koti Shravani Patil Arpita Patra Ajith Suresh MPClan: Protocol Suite for Privacy-Conscious Computations. 675 2022 2022 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2022/675 db/journals/iacr/iacr2022.html#KotiPPS22

Benny Applebaum Yuval Ishai Or Karni Arpita Patra Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications. 813 2022 2022 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2022/813 db/journals/iacr/iacr2022.html#ApplebaumIKP22

Ashish Choudhury Arpita Patra On the Communication Efficiency of Statistically-Secure Asynchronous MPC with Optimal Resilience. 913 2022 2022 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2022/913 db/journals/iacr/iacr2022.html#ChoudhuryP22

Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal PentaGOD: Stepping beyond Traditional GOD with Five Parties. 1118 2022 2022 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2022/1118 db/journals/iacr/iacr2022.html#KotiKPG22

Aditya Hegde 0003 Nishat Koti Varsha Bhat Kukkala Shravani Patil Arpita Patra Protik Paul Attaining GOD Beyond Honest Majority With Friends and Foes. 1207 2022 2022 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2022/1207 db/journals/iacr/iacr2022.html#0003KKPPP22

Yuval Ishai Arpita Patra Sikhar Patranabis Divya Ravi 0001 Akshayaram Srinivasan Fully-Secure MPC with Minimal Trust. 1248 2022 2022 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2022/1248 db/journals/iacr/iacr2022.html#IshaiPPRS22

Ittai Abraham Gilad Asharov Shravani Patil Arpita Patra Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. 1266 2022 2022 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2022/1266 db/journals/iacr/iacr2022.html#AbrahamAPP22

Bar Alon 0001 Olga Nissenbaum Eran Omri Anat Paskin-Cherniavsky Arpita Patra On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. 1504 2022 2022 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2022/1504 db/journals/iacr/iacr2022.html#AlonNOPP22

Pranav Jangir Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal Somya Sangal Vogue: Faster Computation of Private Heavy Hitters. 1561 2022 2022 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2022/1561 db/journals/iacr/iacr2022.html#JangirKKPGS22

Pranav Shriram A Nishat Koti Varsha Bhat Kukkala Arpita Patra Bhavish Raj Gopal Find Thy Neighbourhood: Privacy-Preserving Local Clustering. 1727 2022 2022 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2022/1727 db/journals/iacr/iacr2022.html#AKKPG22

Chaya Ganesh Arpita Patra Optimal extension protocols for byzantine broadcast and agreement. 59-77 2021 34 Distributed Comput. 1 https://doi.org/10.1007/s00446-020-00384-1 db/journals/dc/dc34.html#GaneshP21

Arpita Patra Divya Ravi 0001 On the Exact Round Complexity of Secure Three-Party Computation. 40 2021 34 J. Cryptol. 4 https://doi.org/10.1007/s00145-021-09404-0 db/journals/joc/joc34.html#PatraR21

Arpita Patra Akshayaram Srinivasan Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. 185-213 2021 CRYPTO (2) https://doi.org/10.1007/978-3-030-84245-1_7 conf/crypto/2021-2 db/conf/crypto/crypto2021-2.html#PatraS21 Arpita Patra Thomas Schneider 0003 Ajith Suresh Hossein Yalame SynCirc: Efficient Synthesis of Depth-Optimized Circuits for Secure Computation. 147-157 2021 HOST https://doi.org/10.1109/HOST49136.2021.9702293 conf/host/2021 db/conf/host/host2021.html#PatraSSY21 Arpita Patra Thomas Schneider 0003 Ajith Suresh Hossein Yalame ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation. 2165-2182 2021 USENIX Security Symposium https://www.usenix.org/conference/usenixsecurity21/presentation/patra conf/uss/2021 db/conf/uss/uss2021.html#Patra0SY21 Nishat Koti Mahak Pancholi Arpita Patra Ajith Suresh SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. 2651-2668 2021 USENIX Security Symposium https://www.usenix.org/conference/usenixsecurity21/presentation/koti conf/uss/2021 db/conf/uss/uss2021.html#KotiPPS21

Nishat Koti Arpita Patra Rahul Rachuri Ajith Suresh Tetrad: Actively Secure 4PC for Secure Training and Inference. 2021 abs/2106.02850 CoRR https://arxiv.org/abs/2106.02850 db/journals/corr/corr2106.html#abs-2106-02850

Anirudh C Ashish Choudhury Arpita Patra A Survey on Perfectly-Secure Verifiable Secret-Sharing. 2021 abs/2112.11393 CoRR https://arxiv.org/abs/2112.11393 db/journals/corr/corr2112.html#abs-2112-11393

Benny Applebaum Eliran Kachlon Arpita Patra Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security. 346 2021 2021 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2021/346 db/journals/iacr/iacr2021.html#ApplebaumKP21

Anirudh C Ashish Choudhury Arpita Patra A Survey on Perfectly-Secure Verifiable Secret-Sharing. 445 2021 2021 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2021/445 db/journals/iacr/iacr2021.html#CCP21

Nishat Koti Arpita Patra Rahul Rachuri Ajith Suresh Tetrad: Actively Secure 4PC for Secure Training and Inference. 755 2021 2021 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2021/755 db/journals/iacr/iacr2021.html#KotiPRS21

Arpita Patra Akshayaram Srinivasan Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. 957 2021 2021 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2021/957 db/journals/iacr/iacr2021.html#PatraS21

Arpita Patra Thomas Schneider 0003 Ajith Suresh Hossein Yalame SynCirc: Efficient Synthesis of Depth-Optimized Circuits for Secure Computation. 1153 2021 2021 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2021/1153 db/journals/iacr/iacr2021.html#PatraSSY21

Pankaj Dayama 0001 Arpita Patra Protik Paul Nitin Singh Dhinakaran Vinayagamurthy How to prove any NP statement jointly? Efficient Distributed-prover Zero-Knowledge Protocols. 1599 2021 2021 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2021/1599 db/journals/iacr/iacr2021.html#DayamaPPSV21

Laasya Bangalore Ashish Choudhury Arpita Patra The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited. 14:1-14:59 2020 67 J. ACM 3 https://doi.org/10.1145/3388788 db/journals/jacm/jacm67.html#BangaloreCP20

Megha Byali Harsh Chaudhari Arpita Patra Ajith Suresh FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning. 459-480 2020 2020 Proc. Priv. Enhancing Technol. 2 https://doi.org/10.2478/popets-2020-0036 db/journals/popets/popets2020.html#ByaliCPS20

Arpita Patra Divya Ravi 0001 Swati Singla On the Exact Round Complexity of Best-of-Both-Worlds Multi-party Computation. 60-91 2020 ASIACRYPT (3) https://doi.org/10.1007/978-3-030-64840-4_3 conf/asiacrypt/2020-3 db/conf/asiacrypt/asiacrypt2020-3.html#PatraRS20 Benny Applebaum Eliran Kachlon Arpita Patra The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. 1277-1284 2020 FOCS https://doi.org/10.1109/FOCS46700.2020.00121 conf/focs/2020 db/conf/focs/focs2020.html#ApplebaumKP20 Arpita Patra Ajith Suresh BLAZE: Blazing Fast Privacy-Preserving Machine Learning. 2020 NDSS https://www.ndss-symposium.org/ndss-paper/blaze-blazing-fast-privacy-preserving-machine-learning/ conf/ndss/2020 db/conf/ndss/ndss2020.html#PatraS20 Benny Applebaum Eliran Kachlon Arpita Patra The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract). 562-594 2020 TCC (2) https://doi.org/10.1007/978-3-030-64378-2_20 conf/tcc/2020-2 db/conf/tcc/tcc2020-2.html#ApplebaumKP20

Arpita Patra Ajith Suresh BLAZE: Blazing Fast Privacy-Preserving Machine Learning. 2020 abs/2005.09042 CoRR https://arxiv.org/abs/2005.09042 db/journals/corr/corr2005.html#abs-2005-09042

Nishat Koti Mahak Pancholi Arpita Patra Ajith Suresh SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. 2020 abs/2005.10296 CoRR https://arxiv.org/abs/2005.10296 db/journals/corr/corr2005.html#abs-2005-10296

Benny Applebaum Eliran Kachlon Arpita Patra The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. TR20-076 2020 TR20 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2020/076 db/journals/eccc/eccc27.html#ApplebaumKP20

Arpita Patra Ajith Suresh BLAZE: Blazing Fast Privacy-Preserving Machine Learning. 42 2020 2020 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2020/042 db/journals/iacr/iacr2020.html#PatraS20

Benny Applebaum Eliran Kachlon Arpita Patra The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. 581 2020 2020 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2020/581 db/journals/iacr/iacr2020.html#ApplebaumKP20

Nishat Koti Mahak Pancholi Arpita Patra Ajith Suresh SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. 592 2020 2020 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2020/592 db/journals/iacr/iacr2020.html#KotiPPS20

Arpita Patra Divya Ravi 0001 Swati Singla On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation. 1050 2020 2020 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2020/1050 db/journals/iacr/iacr2020.html#PatraRS20

Arpita Patra Thomas Schneider 0003 Ajith Suresh Hossein Yalame ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation. 1225 2020 2020 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2020/1225 db/journals/iacr/iacr2020.html#PatraSSY20

Benny Applebaum Eliran Kachlon Arpita Patra The Resiliency of MPC with Low Interaction: The Benefit of Making Errors. 1419 2020 2020 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2020/1419 db/journals/iacr/iacr2020.html#ApplebaumKP20a

Arpita Patra Divya Ravi 0001 Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. 456-487 2019 ASIACRYPT (1) https://doi.org/10.1007/978-3-030-34578-5_17 conf/asiacrypt/2019-1 db/conf/asiacrypt/asiacrypt2019-1.html#PatraR19 Harsh Chaudhari Ashish Choudhury Arpita Patra Ajith Suresh ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. 81-92 2019 CCSW https://doi.org/10.1145/3338466.3358922 conf/ccs/2019ccsw db/conf/ccs/ccsw2019.html#ChaudhariCPS19 Megha Byali Carmit Hazay Arpita Patra Swati Singla Fast Actively Secure Five-Party Computation with Security Beyond Abort. 1573-1590 2019 CCS https://doi.org/10.1145/3319535.3345657 conf/ccs/2019 db/conf/ccs/ccs2019.html#ByaliHPS19

Arpita Patra Pratik Sarkar Ajith Suresh Fast Actively Secure OT Extension for Short Secrets. 2019 abs/1911.08834 CoRR http://arxiv.org/abs/1911.08834 db/journals/corr/corr1911.html#abs-1911-08834

Harsh Chaudhari Ashish Choudhury Arpita Patra Ajith Suresh ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. 2019 abs/1912.02592 CoRR http://arxiv.org/abs/1912.02592 db/journals/corr/corr1912.html#abs-1912-02592

Harsh Chaudhari Ashish Choudhury Arpita Patra Ajith Suresh ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. 429 2019 2019 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2019/429 db/journals/iacr/iacr2019.html#ChaudhariCPS19

Megha Byali Carmit Hazay Arpita Patra Swati Singla Fast Actively Secure Five-Party Computation with Security Beyond Abort. 863 2019 2019 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2019/863 db/journals/iacr/iacr2019.html#ByaliHPS19

Arpita Patra Divya Ravi 0001 Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. 998 2019 2019 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2019/998 db/journals/iacr/iacr2019.html#PatraR19

Megha Byali Harsh Chaudhari Arpita Patra Ajith Suresh FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning. 1365 2019 2019 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2019/1365 db/journals/iacr/iacr2019.html#ByaliCPS19

Arpita Patra Divya Ravi 0001 On the Power of Hybrid Networks in Multi-Party Computation. 4207-4227 2018 64 IEEE Trans. Inf. Theory 6 https://doi.org/10.1109/TIT.2018.2827360 https://www.wikidata.org/entity/Q129967106 db/journals/tit/tit64.html#PatraR18

Megha Byali Arun Joseph Arpita Patra Divya Ravi 0001 Fast Secure Computation for Small Population over the Internet. 677-694 2018 CCS https://doi.org/10.1145/3243734.3243784 conf/ccs/2018 db/conf/ccs/ccs2018.html#ByaliJPR18 Arpita Patra Divya Ravi 0001 On the Exact Round Complexity of Secure Three-Party Computation. 425-458 2018 CRYPTO (2) https://doi.org/10.1007/978-3-319-96881-0_15 conf/crypto/2018-2 db/conf/crypto/crypto2018-2.html#PatraR18 Chaya Ganesh Yashvanth Kondi Arpita Patra Pratik Sarkar Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits. 499-529 2018 Public Key Cryptography (2) https://doi.org/10.1007/978-3-319-76581-5_17 conf/pkc/2018-2 db/conf/pkc/pkc2018-2.html#GaneshKPS18 Laasya Bangalore Ashish Choudhury Arpita Patra Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. 295-304 2018 PODC https://dl.acm.org/citation.cfm?id=3212735 conf/podc/2018 db/conf/podc/podc2018.html#BangaloreCP18 Ashish Choudhury Gayathri Garimella Arpita Patra Divya Ravi 0001 Pratik Sarkar Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract). 55-71 2018 SIROCCO https://doi.org/10.1007/978-3-030-01325-7_10 conf/sirocco/2018 db/conf/sirocco/sirocco2018.html#ChoudhuryGPRS18

Chaya Ganesh Yashvanth Kondi Arpita Patra Pratik Sarkar Efficient Adaptively Secure Zero-knowledge from Garbled Circuits. 43 2018 2018 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2018/043 db/journals/iacr/iacr2018.html#GaneshKPS18

Laasya Bangalore Ashish Choudhury Arpita Patra Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. 394 2018 2018 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2018/394 db/journals/iacr/iacr2018.html#BangaloreCP18

Ashish Choudhury Gayathri Garimella Arpita Patra Divya Ravi 0001 Pratik Sarkar Crash-tolerant Consensus in Directed Graph Revisited. 436 2018 2018 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2018/436 db/journals/iacr/iacr2018.html#ChoudhuryGPRS18

Arpita Patra Divya Ravi 0001 On the Exact Round Complexity of Secure Three-Party Computation. 481 2018 2018 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2018/481 db/journals/iacr/iacr2018.html#PatraR18

Megha Byali Arun Joseph Arpita Patra Divya Ravi 0001 Fast Secure Computation for Small Population over the Internet. 710 2018 2018 IACR Cryptol. ePrint Arch. https://eprint.iacr.org/2018/710 db/journals/iacr/iacr2018.html#ByaliJPR18

Carmit Hazay Arpita Patra Efficient One-Sided Adaptively Secure Computation. 321-371 2017 30 J. Cryptol. 1 https://doi.org/10.1007/s00145-015-9222-4 db/journals/joc/joc30.html#HazayP17

Ashish Choudhury Arpita Patra An Efficient Framework for Unconditionally Secure Multiparty Computation. 428-468 2017 63 IEEE Trans. Inf. Theory 1 https://doi.org/10.1109/TIT.2016.2614685 db/journals/tit/tit63.html#ChoudhuryP17

Yashvanth Kondi Arpita Patra Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic. 188-222 2017 CRYPTO (1) https://doi.org/10.1007/978-3-319-63688-7_7 conf/crypto/2017-1 db/conf/crypto/crypto2017-1.html#KondiP17 Ashish Choudhury Arpita Patra Divya Ravi 0001 Round and Communication Efficient Unconditionally-Secure MPC with t t n / 3 in Partially Synchronous Network. 83-109 2017 ICITS https://doi.org/10.1007/978-3-319-72089-0_6 conf/icits/2017 db/conf/icits/icits2017.html#ChoudhuryPR17 Arpita Patra Pratik Sarkar Ajith Suresh Fast Actively Secure OT Extension for Short Secrets. 2017 NDSS https://www.ndss-symposium.org/ndss2017/ndss-2017-programme/fast-actively-secure-ot-extension-for-short-secrets/ conf/ndss/2017 db/conf/ndss/ndss2017.html#PatraSS17 Ashish Choudhury Gayathri Garimella Arpita Patra Divya Ravi 0001 Pratik Sarkar Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited. 46:1-46:4 2017 DISC https://doi.org/10.4230/LIPIcs.DISC.2017.46 conf/wdag/2017 db/conf/wdag/disc2017.html#ChoudhuryGPRS17 Arpita Patra Nigel P. Smart Progress in Cryptology - INDOCRYPT 2017 - 18th International Conference on Cryptology in India, Chennai, India, December 10-13, 2017, Proceedings INDOCRYPT Springer 2017 Lecture Notes in Computer Science 10698 978-3-319-71666-4 978-3-319-71667-1 https://doi.org/10.1007/978-3-319-71667-1 db/conf/indocrypt/indocrypt2017.html

Chaya Ganesh Arpita Patra Optimal Extension Protocols for Byzantine Broadcast and Agreement. 63 2017 2017 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2017/063 db/journals/iacr/iacr2017.html#GaneshP17

Yashvanth Kondi Arpita Patra Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic. 561 2017 2017 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2017/561 db/journals/iacr/iacr2017.html#KondiP17

Ashish Choudhury Arpita Patra Divya Ravi 0001 Round and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network. 1006 2017 2017 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2017/1006 db/journals/iacr/iacr2017.html#ChoudhuryPR17

Megha Byali Arpita Patra Divya Ravi 0001 Pratik Sarkar Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security. 1165 2017 2017 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2017/1165 db/journals/iacr/iacr2017.html#ByaliPRS17

Chaya Ganesh Arpita Patra Broadcast Extensions with Optimal Communication and Round Complexity. 371-380 2016 PODC https://doi.org/10.1145/2933057.2933082 conf/podc/2016 db/conf/podc/podc2016.html#GaneshP16 Ashish Choudhury Emmanuela Orsini Arpita Patra Nigel P. Smart Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. 147-168 2016 SCN https://doi.org/10.1007/978-3-319-44618-9_8 conf/scn/2016 db/conf/scn/scn2016.html#ChoudhuryOPS16

Arpita Patra Pratik Sarkar Ajith Suresh Fast Actively Secure OT Extension for Short Secrets. 940 2016 2016 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2016/940 db/journals/iacr/iacr2016.html#PatraSS16

Arpita Patra Ashish Choudhury C. Pandu Rangan Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation. 49-109 2015 28 J. Cryptol. 1 https://doi.org/10.1007/s00145-013-9172-7 db/journals/joc/joc28.html#PatraCR15

Carmit Hazay Arpita Patra Bogdan Warinschi Selective Opening Security for Receivers. 443-469 2015 ASIACRYPT (1) https://doi.org/10.1007/978-3-662-48797-6_19 conf/asiacrypt/2015-1 db/conf/asiacrypt/asiacrypt2015-1.html#HazayPW15 Ashish Choudhury Arpita Patra Optimally Resilient Asynchronous MPC with Linear Communication Complexity. 5:1-5:10 2015 ICDCN https://doi.org/10.1145/2684464.2684470 conf/icdcn/2015 db/conf/icdcn/icdcn2015.html#ChoudhuryP15 Carmit Hazay Yehuda Lindell Arpita Patra Adaptively Secure Computation with Partial Erasures. 291-300 2015 PODC https://doi.org/10.1145/2767386.2767400 conf/podc/2015 db/conf/podc/podc2015.html#HazayLP15

Carmit Hazay Yehuda Lindell Arpita Patra Adaptively Secure Computation with Partial Erasures. 450 2015 2015 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2015/450 db/journals/iacr/iacr2015.html#HazayLP15

Ashish Choudhury Emmanuela Orsini Arpita Patra Nigel P. Smart Linear Overhead Robust MPC with Honest Majority Using Preprocessing. 705 2015 2015 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2015/705 db/journals/iacr/iacr2015.html#ChoudhuryOPS15

Carmit Hazay Arpita Patra Bogdan Warinschi Selective Opening Security for Receivers. 860 2015 2015 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2015/860 db/journals/iacr/iacr2015.html#HazayPW15

Arpita Patra Ashish Choudhury C. Pandu Rangan Asynchronous Byzantine Agreement with optimal resilience. 111-146 2014 27 Distributed Comput. 2 https://doi.org/10.1007/s00446-013-0200-5 db/journals/dc/dc27.html#PatraCR14

Joël Alwen Martin Hirt Ueli Maurer Arpita Patra Pavel Raykov Anonymous Authentication with Shared Secrets. 219-236 2014 LATINCRYPT https://doi.org/10.1007/978-3-319-16295-9_12 conf/latincrypt/2014 db/conf/latincrypt/latincrypt2014.html#AlwenHMPR14 Ashish Choudhury Arpita Patra Nigel P. Smart Reducing the Overhead of MPC over a Large Population. 197-217 2014 SCN https://doi.org/10.1007/978-3-319-10879-7_12 conf/scn/2014 db/conf/scn/scn2014.html#ChoudhuryPS14 Joël Alwen Martin Hirt Ueli Maurer Arpita Patra Pavel Raykov Key-Indistinguishable Message Authentication Codes. 476-493 2014 SCN https://doi.org/10.1007/978-3-319-10879-7_27 conf/scn/2014 db/conf/scn/scn2014.html#AlwenHMPR14 Carmit Hazay Arpita Patra One-Sided Adaptively Secure Two-Party Computation. 368-393 2014 TCC https://doi.org/10.1007/978-3-642-54242-8_16 conf/tcc/2014 db/conf/tcc/tcc2014.html#HazayP14

Joël Alwen Martin Hirt Ueli Maurer Arpita Patra Pavel Raykov Anonymous Authentication with Shared Secrets. 73 2014 2014 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2014/073 db/journals/iacr/iacr2014.html#AlwenHMPR14

Ashish Choudhury Arpita Patra Nigel P. Smart Reducing the Overhead of Cloud MPC. 105 2014 2014 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2014/105 db/journals/iacr/iacr2014.html#ChoudhuryPS14

Joël Alwen Martin Hirt Ueli Maurer Arpita Patra Pavel Raykov Key-Indistinguishable Message Authentication Codes. 107 2014 2014 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2014/107 db/journals/iacr/iacr2014.html#AlwenHMPR14a

Ashish Choudhury Jake Loftus Emmanuela Orsini Arpita Patra Nigel P. Smart Between a Rock and a Hard Place: Interpolating between MPC and FHE. 221-240 2013 ASIACRYPT (2) https://doi.org/10.1007/978-3-642-42045-0_12 conf/asiacrypt/2013-2 db/conf/asiacrypt/asiacrypt2013-2.html#ChoudhuryLOPS13 Ashish Choudhury Martin Hirt Arpita Patra Asynchronous Multiparty Computation with Linear Communication Complexity. 388-402 2013 DISC https://doi.org/10.1007/978-3-642-41527-2_27 conf/wdag/2013 db/conf/wdag/disc2013.html#ChoudhuryHP13

Ashish Choudhury Jake Loftus Emmanuela Orsini Arpita Patra Nigel P. Smart Between a Rock and a Hard Place: Interpolating Between MPC and FHE. 85 2013 2013 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2013/085 db/journals/iacr/iacr2013.html#ChoudhuryLOPS13

Carmit Hazay Arpita Patra One-Sided Adaptively Secure Two-Party Computation. 593 2013 2013 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2013/593 db/journals/iacr/iacr2013.html#HazayP13

Ashwinkumar Badanidiyuru Arpita Patra Ashish Choudhury Kannan Srinathan C. Pandu Rangan On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission. 22:1-22:35 2012 59 J. ACM 5 https://doi.org/10.1145/2371656.2371657 db/journals/jacm/jacm59.html#BadanidiyuruPCSR12

Ashish Choudhury Arpita Patra Brief announcement: efficient optimally resilient statistical AVSS and its applications. 103-104 2012 PODC https://doi.org/10.1145/2332432.2332454 conf/podc/2012 db/conf/podc/podc2012.html#ChoudhuryP12

Ashish Choudhury Martin Hirt Arpita Patra Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity. 517 2012 2012 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2012/517 db/journals/iacr/iacr2012.html#ChoudhuryHP12

Ashish Choudhury Arpita Patra B. V. Ashwinkumar Kannan Srinathan C. Pandu Rangan Secure message transmission in asynchronous networks. 1067-1074 2011 71 J. Parallel Distributed Comput. 8 https://doi.org/10.1016/j.jpdc.2011.03.004 db/journals/jpdc/jpdc71.html#ChoudhuryPASR11

Ashish Choudhury Kaoru Kurosawa Arpita Patra Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. 292-308 2011 ACNS https://doi.org/10.1007/978-3-642-21554-4_17 conf/acns/2011 db/conf/acns/acns2011.html#ChoudhuryKP11 Michael Backes 0001 Aniket Kate Arpita Patra Computational Verifiable Secret Sharing Revisited. 590-609 2011 ASIACRYPT https://doi.org/10.1007/978-3-642-25385-0_32 conf/asiacrypt/2011 db/conf/asiacrypt/asiacrypt2011.html#BackesKP11 Ashish Choudhury Arpita Patra On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks. 450-466 2011 ICISC https://doi.org/10.1007/978-3-642-31912-9_30 conf/icisc/2011 db/conf/icisc/icisc2011.html#ChoudhuryP11 Ashish Choudhury Kaoru Kurosawa Arpita Patra The Round Complexity of Perfectly Secure General VSS. 143-162 2011 ICITS https://doi.org/10.1007/978-3-642-20728-0_14 conf/icits/2011 db/conf/icits/icits2011.html#ChoudhuryKP11 Arpita Patra C. Pandu Rangan Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience. 206-226 2011 ICITS https://doi.org/10.1007/978-3-642-20728-0_19 conf/icits/2011 db/conf/icits/icits2011.html#PatraR11 Arpita Patra Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity. 34-49 2011 OPODIS https://doi.org/10.1007/978-3-642-25873-2_4 conf/opodis/2011 db/conf/opodis/opodis2011.html#Patra11

Ashish Choudhury Kaoru Kurosawa Arpita Patra Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. 27 2011 2011 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2011/027 db/journals/iacr/iacr2011.html#ChoudhuryKP11

Ashish Choudhury Arpita Patra Statistical Asynchronous Weak Commitment Scheme: A New Primitive to Design Statistical Asynchronous Verifiable Secret Sharing Scheme. 31 2011 2011 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2011/031 db/journals/iacr/iacr2011.html#ChoudhuryP11

Michael Backes 0001 Aniket Kate Arpita Patra Computational Verifiable Secret Sharing Revisited. 281 2011 2011 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2011/281 db/journals/iacr/iacr2011.html#BackesKP11

Ashish Choudhury Arpita Patra On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks. 288 2011 2011 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2011/288 db/journals/iacr/iacr2011.html#ChoudhuryP11a

Arpita Patra Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity. 313 2011 2011 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2011/313 db/journals/iacr/iacr2011.html#Patra11

Arpita Patra Ashish Choudhury C. Pandu Rangan Kannan Srinathan Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality. 159-197 2010 2 Int. J. Appl. Cryptogr. 2 https://doi.org/10.1504/IJACT.2010.038309 db/journals/ijact/ijact2.html#PatraCRS10

Arpita Patra Ashish Choudhary C. Pandu Rangan Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. 184-202 2010 AFRICACRYPT https://doi.org/10.1007/978-3-642-12678-9_12 conf/africacrypt/2010 db/conf/africacrypt/africacrypt2010.html#PatraCR10 Ranjit Kumaresan Arpita Patra C. Pandu Rangan The Round Complexity of Verifiable Secret Sharing: The Statistical Case. 431-447 2010 ASIACRYPT https://doi.org/10.1007/978-3-642-17373-8_25 conf/asiacrypt/2010 db/conf/asiacrypt/asiacrypt2010.html#KumaresanPR10 Arpita Patra Ashish Choudhary C. Pandu Rangan On Communication Complexity of Secure Message Transmission in Directed Networks. 42-53 2010 ICDCN https://doi.org/10.1007/978-3-642-11322-2_9 conf/icdcn/2010 db/conf/icdcn/icdcn2010.html#PatraCR10 Arpita Patra C. Pandu Rangan Communication Optimal Multi-valued Asynchronous Broadcast Protocol. 162-177 2010 LATINCRYPT https://doi.org/10.1007/978-3-642-14712-8_10 conf/latincrypt/2010 db/conf/latincrypt/latincrypt2010.html#PatraR10 Arpita Patra C. Pandu Rangan Brief announcement: communication efficient asynchronous byzantine agreement. 243-244 2010 PODC https://doi.org/10.1145/1835698.1835756 conf/podc/2010 db/conf/podc/podc2010.html#PatraR10 Arpita Patra Ashish Choudhury C. Pandu Rangan Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity. 245-246 2010 PODC https://doi.org/10.1145/1835698.1835757 conf/podc/2010 db/conf/podc/podc2010.html#PatraCR10

Arpita Patra C. Pandu Rangan Communication and Round Efficient Information Checking Protocol http://arxiv.org/abs/1004.3504 2010 CoRR abs/1004.3504 db/journals/corr/corr1004.html#abs-1004-3504

Arpita Patra Ashish Choudhary C. Pandu Rangan Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. 7 2010 2010 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2010/007 db/journals/iacr/iacr2010.html#PatraCR10

Arpita Patra Studies on Verifiable Secret Sharing, Byzantine Agreement and Multiparty Computation. 280 2010 2010 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2010/280 db/journals/iacr/iacr2010.html#Patra10

Ashish Choudhury Kaoru Kurosawa Arpita Patra The Round Complexity of General VSS. 609 2010 2010 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2010/609 db/journals/iacr/iacr2010.html#ChoudhuryKP10

Arpita Patra Ashish Choudhary C. Pandu Rangan Kannan Srinathan Prasad Raghavendra Perfectly reliable and secure message transmission tolerating mobile adversary. 200-224 2009 1 Int. J. Appl. Cryptogr. 3 https://doi.org/10.1504/IJACT.2009.023467 db/journals/ijact/ijact1.html#PatraCRSR09

G. Sathya Narayanan T. Aishwarya Anugrah Agrawal Arpita Patra Ashish Choudhary C. Pandu Rangan Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security. 21-40 2009 CANS https://doi.org/10.1007/978-3-642-10433-6_2 conf/cans/2009 db/conf/cans/cans2009.html#NarayananAAPCR09 Kannan Srinathan Arpita Patra Ashish Choudhary C. Pandu Rangan Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary. 171-182 2009 AsiaCCS https://doi.org/10.1145/1533057.1533083 conf/ccs/2009asia db/conf/ccs/asiaccs2009.html#SrinathanPCR09 Arpita Patra Ashish Choudhary C. Pandu Rangan Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience. 179-197 2009 Inscrypt https://doi.org/10.1007/978-3-642-16342-5_14 conf/cisc/2009 db/conf/cisc/inscrypt2009.html#PatraCR09 Arpita Patra Ashish Choudhary Tal Rabin C. Pandu Rangan The Round Complexity of Verifiable Secret Sharing Revisited. 487-504 2009 CRYPTO https://doi.org/10.1007/978-3-642-03356-8_29 conf/crypto/2009 db/conf/crypto/crypto2009.html#PatraCRR09 Ashish Choudhary Arpita Patra B. V. Ashwinkumar Kannan Srinathan C. Pandu Rangan On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. 148-162 2009 ICDCN https://doi.org/10.1007/978-3-540-92295-7_19 conf/icdcn/2009 db/conf/icdcn/icdcn2009.html#ChoudharyPASR09 Arpita Patra Ashish Choudhary C. Pandu Rangan Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience. 74-92 2009 ICITS https://doi.org/10.1007/978-3-642-14496-7_7 conf/icits/2009 db/conf/icits/icits2009.html#PatraCR09 Arpita Patra Ashish Choudhary C. Pandu Rangan Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience. 398-417 2009 INDOCRYPT https://doi.org/10.1007/978-3-642-10628-6_26 conf/indocrypt/2009 db/conf/indocrypt/indocrypt2009.html#PatraCR09 Arpita Patra Ashish Choudhary C. Pandu Rangan Simple and efficient asynchronous byzantine agreement with optimal resilience. 92-101 2009 PODC https://doi.org/10.1145/1582716.1582736 conf/podc/2009 db/conf/podc/podc2009.html#PatraCR09 Arpita Patra Ashish Choudhary C. Pandu Rangan Brief announcement: perfectly secure message transmission in directed networks re-visited. 278-279 2009 PODC https://doi.org/10.1145/1582716.1582763 conf/podc/2009 db/conf/podc/podc2009.html#PatraCR09a Arpita Patra Ashish Choudhary C. Pandu Rangan Information Theoretically Secure Multi Party Set Intersection Re-visited. 71-91 2009 Selected Areas in Cryptography https://doi.org/10.1007/978-3-642-05445-7_5 conf/sacrypt/2009 db/conf/sacrypt/sacrypt2009.html#PatraCR09

Arpita Patra Ashish Choudhary C. Pandu Rangan Information Theoretically Secure Multi Party Set Intersection Re-Visited. 116 2009 2009 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2009/116 db/journals/iacr/iacr2009.html#PatraCR09a

G. Sathya Narayanan T. Aishwarya Anugrah Agrawal Arpita Patra Ashish Choudhary C. Pandu Rangan Multi Party Distributed Private Matching, Set Disjointness and Cardinality Set Intersection with Information Theoretic Security. 311 2009 2009 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2009/311 db/journals/iacr/iacr2009.html#NarayananAAPCR09

Arpita Patra C. Pandu Rangan Communication Optimal Multi-Valued Asynchronous Byzantine Agreement with Optimal Resilience. 433 2009 2009 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2009/433 db/journals/iacr/iacr2009.html#PatraR09

Arpita Patra Ashish Choudhary C. Pandu Rangan On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks. 470 2009 2009 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2009/470 db/journals/iacr/iacr2009.html#PatraCR09b

Arpita Patra Ashish Choudhary C. Pandu Rangan Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience. 492 2009 2009 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2009/492 db/journals/iacr/iacr2009.html#PatraCR09c

Arpita Patra Sukhendu Das Enhancing decision combination of face and fingerprint by exploitation of individual classifier space: An approach to multi-modal biometry. 2298-2308 2008 41 Pattern Recognit. 7 https://doi.org/10.1016/j.patcog.2007.12.004 db/journals/pr/pr41.html#PatraD08

Arpita Patra Ashish Choudhary Madhu Vaidyanathan C. Pandu Rangan Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. 170-186 2008 ACISP https://doi.org/10.1007/978-3-540-70500-0_13 conf/acisp/2008 db/conf/acisp/acisp2008.html#PatraCVR08 Kannan Srinathan Arpita Patra Ashish Choudhary C. Pandu Rangan Unconditionally Reliable Message Transmission in Directed Hypergraphs. 285-303 2008 CANS https://doi.org/10.1007/978-3-540-89641-8_21 conf/cans/2008 db/conf/cans/cans2008.html#SrinathanPCR08 Ashish Choudhary Arpita Patra B. V. Ashwinkumar K. Srinathan 0001 C. Pandu Rangan Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary. 137-155 2008 ICITS https://doi.org/10.1007/978-3-540-85093-9_15 conf/icits/2008 db/conf/icits/icits2008.html#ChoudharyPASR08 Arpita Patra Ashish Choudhary C. Pandu Rangan Round Efficient Unconditionally Secure Multiparty Computation Protocol. 185-199 2008 INDOCRYPT https://doi.org/10.1007/978-3-540-89754-5_15 conf/indocrypt/2008 db/conf/indocrypt/indocrypt2008.html#PatraCR08 B. V. Ashwinkumar Arpita Patra Ashish Choudhary Kannan Srinathan C. Pandu Rangan On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary. 115-124 2008 PODC https://doi.org/10.1145/1400751.1400768 conf/podc/2008 db/conf/podc/podc2008.html#AshwinkumarPCSR08 Kannan Srinathan Ashish Choudhary Arpita Patra C. Pandu Rangan Efficient single phase unconditionally secure message transmission with optimum communication complexity. 457 2008 PODC https://doi.org/10.1145/1400751.1400855 conf/podc/2008 db/conf/podc/podc2008.html#SrinathanCPR08 Arpita Patra Ashish Choudhary C. Pandu Rangan Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited. 309-326 2008 SCN https://doi.org/10.1007/978-3-540-85855-3_21 conf/scn/2008 db/conf/scn/scn2008.html#PatraCR08

Arpita Patra Ashish Choudhary Madhu Gayatri C. Pandu Rangan Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary. 86 2008 2008 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2008/086 db/journals/iacr/iacr2008.html#PatraCGR08

Arpita Patra Ashish Choudhury C. Pandu Rangan Kannan Srinathan Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality. 141 2008 2008 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2008/141 db/journals/iacr/iacr2008.html#PatraCRS08

Arpita Patra Ashish Choudhary Tal Rabin C. Pandu Rangan The Round Complexity of Verifiable Secret Sharing Revisited. 172 2008 2008 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2008/172 db/journals/iacr/iacr2008.html#PatraCRR08

Arpita Patra Ashish Choudhury B. V. Ashwinkumar Kannan Srinathan C. Pandu Rangan Perfectly Secure Message Transmission Tolerating Mixed Adversary. 232 2008 2008 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2008/232 db/journals/iacr/iacr2008.html#PatraCASR08

Arpita Patra Ashish Choudhury C. Pandu Rangan Statistically Reliable and Secure Message Transmission in Directed Networks. 262 2008 2008 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2008/262 db/journals/iacr/iacr2008.html#PatraCR08

Kannan Srinathan Arpita Patra Ashish Choudhary C. Pandu Rangan Unconditionally Reliable Message Transmission in Directed Hypergraphs. 371 2008 2008 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2008/371 db/journals/iacr/iacr2008.html#SrinathanPCR08

Arpita Patra Ashish Choudhary C. Pandu Rangan Round Efficient Unconditionally Secure Multiparty Computation Protocol. 399 2008 2008 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2008/399 db/journals/iacr/iacr2008.html#PatraCR08a

Arpita Patra Ashish Choudhury C. Pandu Rangan Efficient Asynchronous Byzantine Agreement with Optimal Resilience. 424 2008 2008 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2008/424 db/journals/iacr/iacr2008.html#PatraCR08b

Arpita Patra Ashish Choudhury C. Pandu Rangan Efficient Asynchronous Multiparty Computation with Optimal Resilience. 425 2008 2008 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2008/425 db/journals/iacr/iacr2008.html#PatraCR08c

Arpita Patra Ashish Choudhary C. Pandu Rangan Unconditionally Secure Multiparty Set Intersection Re-Visited. 462 2008 2008 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2008/462 db/journals/iacr/iacr2008.html#PatraCR08d

Kannan Srinathan Arpita Patra Ashish Choudhary C. Pandu Rangan Unconditionally Secure Message Transmission in Arbitrary Directed Synchronous Networks Tolerating Generalized Mixed Adversary. 506 2008 2008 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2008/506 db/journals/iacr/iacr2008.html#SrinathanPCR08a

Lalit Gupta Vinod Pathangay Arpita Patra A. Dyana Sukhendu Das Indoor versus Outdoor Scene Classification Using Probabilistic Neural Network. 2007 2007 EURASIP J. Adv. Signal Process. https://doi.org/10.1155/2007/94298 db/journals/ejasp/ejasp2007.html#GuptaPPDD07

Arpita Patra Bhavani Shankar Ashish Choudhary K. Srinathan 0001 C. Pandu Rangan Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary. 80-101 2007 conf/cans/2007 CANS https://doi.org/10.1007/978-3-540-76969-9_6 db/conf/cans/cans2007.html#PatraSCSR07 Kannan Srinathan Arpita Patra Ashish Choudhary C. Pandu Rangan Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality. 101-122 2007 conf/indocrypt/2007 INDOCRYPT https://doi.org/10.1007/978-3-540-77026-8_9 db/conf/indocrypt/indocrypt2007.html#SrinathanPCR07 Arpita Patra Ashish Choudhary Chandrasekaran Pandu Rangan Constant phase efficient protocols for secure message transmission in directed networks. 322-323 2007 conf/podc/2007 PODC https://doi.org/10.1145/1281100.1281153 db/conf/podc/podc2007.html#PatraCR07 Arpita Patra Ashish Choudhary Kannan Srinathan C. Pandu Rangan Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary. 496-498 2007 conf/wdag/2007 DISC https://doi.org/10.1007/978-3-540-75142-7_43 db/conf/wdag/disc2007.html#PatraCSR07 Arpita Patra Ashish Choudhary K. Srinathan 0001 C. Pandu Rangan Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission. 221-235 2006 conf/indocrypt/2006 INDOCRYPT https://doi.org/10.1007/11941378_16 db/conf/indocrypt/indocrypt2006.html#PatraCSR06 Pranav Shriram A Ittai Abraham Anugrah Agrawal T. Aishwarya Bar Alon 0001 Joël Alwen Murali Annavaram Benny Applebaum Gilad Asharov Michael Backes 0001 Ashwinkumar BadanidiyuruB. V. Ashwinkumar Laasya Bangalore Emanuele Bellini 0002 Alastair R. Beresford Harishma Boyapally Megha Byali Anirudh CAnirudh Chandramouli Harsh Chaudhari Ashish ChoudhuryAshish Choudhary Ivan Damgård Sukhendu Das Pankaj Dayama 0001 Soumyajit Dey A. Dyana Vinod Ganapathy Chaya Ganesh Gayathri Garimella Madhu Gayatri Soumyadyuti Ghosh Bhavish Raj Gopal Eikansh Gupta Lalit Gupta Carmit Hazay Aditya Hegde 0003 Martin Hirt Yuval Ishai Pranav Jangir Arun Joseph Eliran Kachlon Siddharth Kapoor Banashri Karmakar Or Karni Aniket Kate Yashvanth Kondi Nishat Koti Varsha Bhat Kukkala Ranjit Kumaresan Kaoru Kurosawa Yehuda Lindell Jake Loftus Ueli Maurer Debdeep Mukhopadhyay Shyam Murthy G. Sathya Narayanan Olga Nissenbaum Eran Omri Emmanuela Orsini Mahak Pancholi Anat Paskin-Cherniavsky Vinod Pathangay Shravani Patil Shravani Mahesh Patil Sikhar Patranabis Protik Paul Gokulnath Pillai Tal Rabin Rahul Rachuri Prasad Raghavendra C. Pandu RanganChandrasekaran Pandu Rangan Divya Ravi 0001 Pavel Raykov Lawrence Roy Somya Sangal Pratik Sarkar Joachim Schmidt 0006 Thomas Schneider 0003 Bhavani Shankar Nitin Singh Swati Singla Nigel P. Smart K. Srinathan 0001Kannan Srinathan Akshayaram Srinivasan Gilad Stern Ajith Suresh Madhu Vaidyanathan Dhinakaran Vinayagamurthy Yongqin Wang Bogdan Warinschi Hossein Yalame