Arpita Patra

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 111

Top Venues

IACR Cryptol. ePrint Arch.

CoRR

Proc. Priv. Enhancing Technol.

CCS

Publications

Shravani Patil, Arpita Patra
Perfectly-secure Network-agnostic MPC with Optimal Resiliency. IACR Cryptol. ePrint Arch. 2024 (2024)
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
Perfect Asynchronous MPC with Linear Communication Overhead. EUROCRYPT (5) (2024)
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
Perfect Asynchronous MPC with Linear Communication Overhead. IACR Cryptol. ePrint Arch. 2024 (2024)
Pranav Jangir, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, Somya Sangal
Vogue: Faster Computation of Private Heavy Hitters. IEEE Trans. Dependable Secur. Comput. 21 (4) (2024)
Banashri Karmakar, Shyam Murthy, Arpita Patra, Protik Paul
QuickPool: Privacy-Preserving Ride-Sharing Service. IACR Cryptol. ePrint Arch. 2024 (2024)
Gokulnath Pillai, Ajith Suresh, Eikansh Gupta, Vinod Ganapathy, Arpita Patra
Privadome: Delivery Drones and Citizen Privacy. Proc. Priv. Enhancing Technol. 2024 (2) (2024)
Nishat Koti, Shravani Mahesh Patil, Arpita Patra, Ajith Suresh
MPClan: Protocol Suite for Privacy-Conscious Computations. J. Cryptol. 36 (3) (2023)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Statistical MPC with Optimal Resiliency. IACR Cryptol. ePrint Arch. 2023 (2023)
Yongqin Wang, Pratik Sarkar, Nishat Koti, Arpita Patra, Murali Annavaram
CompactTag: Minimizing Computation Overheads in Actively-Secure MPC for Deep Neural Networks. IACR Cryptol. ePrint Arch. 2023 (2023)
Pranav Shriram A, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
Find Thy Neighbourhood: Privacy-Preserving Local Clustering. Proc. Priv. Enhancing Technol. 2023 (2) (2023)
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
Shield: Secure Allegation Escrow System with Stronger Guarantees. IACR Cryptol. ePrint Arch. 2023 (2023)
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time. IACR Cryptol. ePrint Arch. 2023 (2023)
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time. EUROCRYPT (2) (2023)
Ashish Choudhury, Arpita Patra
On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience. J. Cryptol. 36 (2) (2023)
Yongqin Wang, Pratik Sarkar, Nishat Koti, Arpita Patra, Murali Annavaram
CompactTag: Minimizing Computation Overheads in Actively-Secure MPC for Deep Neural Networks. CoRR (2023)
Pranav Shriram A, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, Somya Sangal
Ruffle: Rapid 3-party shuffle protocols. IACR Cryptol. ePrint Arch. 2023 (2023)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Statistical MPC with Optimal Resiliency. Electron. Colloquium Comput. Complex. (2023)
Pranav Shriram A, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, Somya Sangal
Ruffle: Rapid 3-Party Shuffle Protocols. Proc. Priv. Enhancing Technol. 2023 (3) (2023)
Ittai Abraham, Gilad Asharov, Arpita Patra, Gilad Stern
Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time. IACR Cryptol. ePrint Arch. 2023 (2023)
Banashri Karmakar, Nishat Koti, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi
sfAsterisk: Super-fast MPC with a Friend. IACR Cryptol. ePrint Arch. 2023 (2023)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Statistical MPC with Optimal Resiliency. STOC (2023)
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
Shield: Secure Allegation Escrow System with Stronger Guarantees. WWW (2023)
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
Entrada to Secure Graph Convolutional Networks. IACR Cryptol. ePrint Arch. 2023 (2023)
Benny Applebaum, Eliran Kachlon, Arpita Patra
Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority - (Extended Abstract). CRYPTO (4) (2022)
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. IACR Cryptol. ePrint Arch. 2022 (2022)
Pranav Jangir, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, Somya Sangal
Vogue: Faster Computation of Private Heavy Hitters. IACR Cryptol. ePrint Arch. 2022 (2022)
Nishat Koti, Shravani Patil, Arpita Patra, Ajith Suresh
Poster MPClan: : Protocol Suite for Privacy-Conscious Computations. CCS (2022)
Pranav Shriram A, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
Find Thy Neighbourhood: Privacy-Preserving Local Clustering. IACR Cryptol. ePrint Arch. 2022 (2022)
Aditya Hegde, Nishat Koti, Varsha Bhat Kukkala, Shravani Patil, Arpita Patra, Protik Paul
Attaining GOD Beyond Honest Majority With Friends and Foes. IACR Cryptol. ePrint Arch. 2022 (2022)
Bar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra
On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. IACR Cryptol. ePrint Arch. 2022 (2022)
Benny Applebaum, Yuval Ishai, Or Karni, Arpita Patra
Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications. CRYPTO (4) (2022)
Nishat Koti, Shravani Patil, Arpita Patra, Ajith Suresh
MPClan: Protocol Suite for Privacy-Conscious Computations. CoRR (2022)
Nishat Koti, Shravani Patil, Arpita Patra, Ajith Suresh
MPClan: Protocol Suite for Privacy-Conscious Computations. IACR Cryptol. ePrint Arch. 2022 (2022)
Pranav Jangir, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, Somya Sangal
Poster: Vogue: Faster Computation of Private Heavy Hitters. CCS (2022)
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. TCC (1) (2022)
Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan
Fully-Secure MPC with Minimal Trust. IACR Cryptol. ePrint Arch. 2022 (2022)
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
PentaGOD: Stepping beyond Traditional GOD with Five Parties. IACR Cryptol. ePrint Arch. 2022 (2022)
Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan
Fully-Secure MPC with Minimal Trust. TCC (2) (2022)
Ashish Choudhury, Arpita Patra
On the Communication Efficiency of Statistically-Secure Asynchronous MPC with Optimal Resilience. IACR Cryptol. ePrint Arch. 2022 (2022)
Bar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra
On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. TCC (2) (2022)
Gokulnath Pillai, Eikansh Gupta, Ajith Suresh, Vinod Ganapathy, Arpita Patra
Privadome: Protecting Citizen Privacy from Delivery Drones. CoRR (2022)
Benny Applebaum, Eliran Kachlon, Arpita Patra
Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract). TCC (2) (2022)
Aditya Hegde, Nishat Koti, Varsha Bhat Kukkala, Shravani Patil, Arpita Patra, Protik Paul
Attaining GOD Beyond Honest Majority with Friends and Foes. ASIACRYPT (1) (2022)
Anirudh Chandramouli, Ashish Choudhury, Arpita Patra
A Survey on Perfectly Secure Verifiable Secret-sharing. ACM Comput. Surv. 54 (11s) (2022)
Nishat Koti, Arpita Patra, Rahul Rachuri, Ajith Suresh
Tetrad: Actively Secure 4PC for Secure Training and Inference. NDSS (2022)
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
PentaGOD: Stepping beyond Traditional GOD with Five Parties. CCS (2022)
Benny Applebaum, Eliran Kachlon, Arpita Patra
Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority. IACR Cryptol. ePrint Arch. 2022 (2022)
Benny Applebaum, Yuval Ishai, Or Karni, Arpita Patra
Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications. IACR Cryptol. ePrint Arch. 2022 (2022)
Pankaj Dayama, Arpita Patra, Protik Paul, Nitin Singh, Dhinakaran Vinayagamurthy
How to prove any NP statement jointly? Efficient Distributed-prover Zero-Knowledge Protocols. Proc. Priv. Enhancing Technol. 2022 (2) (2022)
Arpita Patra, Akshayaram Srinivasan
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. CRYPTO (2) (2021)
Nishat Koti, Arpita Patra, Rahul Rachuri, Ajith Suresh
Tetrad: Actively Secure 4PC for Secure Training and Inference. CoRR (2021)
Anirudh C, Ashish Choudhury, Arpita Patra
A Survey on Perfectly-Secure Verifiable Secret-Sharing. IACR Cryptol. ePrint Arch. 2021 (2021)
Arpita Patra, Divya Ravi
On the Exact Round Complexity of Secure Three-Party Computation. J. Cryptol. 34 (4) (2021)
Benny Applebaum, Eliran Kachlon, Arpita Patra
Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security. IACR Cryptol. ePrint Arch. 2021 (2021)
Arpita Patra, Akshayaram Srinivasan
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. IACR Cryptol. ePrint Arch. 2021 (2021)
Arpita Patra, Thomas Schneider, Ajith Suresh, Hossein Yalame
SynCirc: Efficient Synthesis of Depth-Optimized Circuits for Secure Computation. IACR Cryptol. ePrint Arch. 2021 (2021)
Nishat Koti, Arpita Patra, Rahul Rachuri, Ajith Suresh
Tetrad: Actively Secure 4PC for Secure Training and Inference. IACR Cryptol. ePrint Arch. 2021 (2021)
Chaya Ganesh, Arpita Patra
Optimal extension protocols for byzantine broadcast and agreement. Distributed Comput. 34 (1) (2021)
Arpita Patra, Thomas Schneider, Ajith Suresh, Hossein Yalame
SynCirc: Efficient Synthesis of Depth-Optimized Circuits for Secure Computation. HOST (2021)
Anirudh C, Ashish Choudhury, Arpita Patra
A Survey on Perfectly-Secure Verifiable Secret-Sharing. CoRR (2021)
Pankaj Dayama, Arpita Patra, Protik Paul, Nitin Singh, Dhinakaran Vinayagamurthy
How to prove any NP statement jointly? Efficient Distributed-prover Zero-Knowledge Protocols. IACR Cryptol. ePrint Arch. 2021 (2021)
Arpita Patra, Thomas Schneider, Ajith Suresh, Hossein Yalame
ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation. USENIX Security Symposium (2021)
Nishat Koti, Mahak Pancholi, Arpita Patra, Ajith Suresh
SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. USENIX Security Symposium (2021)
Arpita Patra, Ajith Suresh
BLAZE: Blazing Fast Privacy-Preserving Machine Learning. NDSS (2020)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. IACR Cryptol. ePrint Arch. 2020 (2020)
Arpita Patra, Thomas Schneider, Ajith Suresh, Hossein Yalame
ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2020 (2020)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. Electron. Colloquium Comput. Complex. 27 (2020)
Arpita Patra, Ajith Suresh
BLAZE: Blazing Fast Privacy-Preserving Machine Learning. IACR Cryptol. ePrint Arch. 2020 (2020)
Nishat Koti, Mahak Pancholi, Arpita Patra, Ajith Suresh
SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. IACR Cryptol. ePrint Arch. 2020 (2020)
Arpita Patra, Divya Ravi, Swati Singla
On the Exact Round Complexity of Best-of-Both-Worlds Multi-party Computation. ASIACRYPT (3) (2020)
Arpita Patra, Divya Ravi, Swati Singla
On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation. IACR Cryptol. ePrint Arch. 2020 (2020)
Laasya Bangalore, Ashish Choudhury, Arpita Patra
The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited. J. ACM 67 (3) (2020)
Megha Byali, Harsh Chaudhari, Arpita Patra, Ajith Suresh
FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning. Proc. Priv. Enhancing Technol. 2020 (2) (2020)
Nishat Koti, Mahak Pancholi, Arpita Patra, Ajith Suresh
SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. CoRR (2020)
Benny Applebaum, Eliran Kachlon, Arpita Patra
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. IACR Cryptol. ePrint Arch. 2020 (2020)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract). TCC (2) (2020)
Arpita Patra, Ajith Suresh
BLAZE: Blazing Fast Privacy-Preserving Machine Learning. CoRR (2020)
Arpita Patra, Divya Ravi
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. ASIACRYPT (1) (2019)
Harsh Chaudhari, Ashish Choudhury, Arpita Patra, Ajith Suresh
ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. CoRR (2019)
Arpita Patra, Pratik Sarkar, Ajith Suresh
Fast Actively Secure OT Extension for Short Secrets. CoRR (2019)
Megha Byali, Carmit Hazay, Arpita Patra, Swati Singla
Fast Actively Secure Five-Party Computation with Security Beyond Abort. CCS (2019)
Harsh Chaudhari, Ashish Choudhury, Arpita Patra, Ajith Suresh
ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. IACR Cryptol. ePrint Arch. 2019 (2019)
Arpita Patra, Divya Ravi
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. IACR Cryptol. ePrint Arch. 2019 (2019)
Harsh Chaudhari, Ashish Choudhury, Arpita Patra, Ajith Suresh
ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. CCSW@CCS (2019)
Megha Byali, Harsh Chaudhari, Arpita Patra, Ajith Suresh
FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning. IACR Cryptol. ePrint Arch. 2019 (2019)
Megha Byali, Carmit Hazay, Arpita Patra, Swati Singla
Fast Actively Secure Five-Party Computation with Security Beyond Abort. IACR Cryptol. ePrint Arch. 2019 (2019)
Laasya Bangalore, Ashish Choudhury, Arpita Patra
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. PODC (2018)
Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar
Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract). SIROCCO (2018)
Megha Byali, Arun Joseph, Arpita Patra, Divya Ravi
Fast Secure Computation for Small Population over the Internet. CCS (2018)
Arpita Patra, Divya Ravi
On the Exact Round Complexity of Secure Three-Party Computation. CRYPTO (2) (2018)
Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar
Crash-tolerant Consensus in Directed Graph Revisited. IACR Cryptol. ePrint Arch. 2018 (2018)
Arpita Patra, Divya Ravi
On the Exact Round Complexity of Secure Three-Party Computation. IACR Cryptol. ePrint Arch. 2018 (2018)
Arpita Patra, Divya Ravi
On the Power of Hybrid Networks in Multi-Party Computation. IEEE Trans. Inf. Theory 64 (6) (2018)
Megha Byali, Arun Joseph, Arpita Patra, Divya Ravi
Fast Secure Computation for Small Population over the Internet. IACR Cryptol. ePrint Arch. 2018 (2018)
Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar
Efficient Adaptively Secure Zero-knowledge from Garbled Circuits. IACR Cryptol. ePrint Arch. 2018 (2018)
Laasya Bangalore, Ashish Choudhury, Arpita Patra
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. IACR Cryptol. ePrint Arch. 2018 (2018)
Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar
Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits. Public Key Cryptography (2) (2018)
Yashvanth Kondi, Arpita Patra
Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic. IACR Cryptol. ePrint Arch. 2017 (2017)
Chaya Ganesh, Arpita Patra
Optimal Extension Protocols for Byzantine Broadcast and Agreement. IACR Cryptol. ePrint Arch. 2017 (2017)

Arpita Patra.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Arpita Patra