Arpita Patra

214 papers A* 28A 7B 10Misc 15Journal 124Unranked 29
YearRankTypeTitle / Venue / Authors
2026 J jnl
Entrada to Secure Graph Convolutional Networks
IEEE Trans. Dependable Secur. Comput.
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
2025 J jnl
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS.
J. Cryptol.
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
2025 J jnl
Breaking the Barrier for Asynchronous MPC with a Friend.
IACR Cryptol. ePrint Arch.
Banashri Karmakar, Aniket Kate, Shravani Patil, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi
2025 — book
Fault-Tolerant Distributed Consensus in Synchronous Networks
Ashish Choudhury, Arpita Patra
2025 J jnl
Information-theoretic MPC with Constant Communication Overhead.
IACR Cryptol. ePrint Arch.
Ashish Choudhury, Ivan Damgård, Shravani Patil, Arpita Patra
2025 J jnl
Match Quest: Fast and Secure Pattern Matching.
Proc. Priv. Enhancing Technol.
Pranav Jangir, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
2025 J jnl
New Upper and Lower Bounds for Perfectly Secure MPC.
IACR Cryptol. ePrint Arch.
Ivan Damgård, Shravani Patil, Arpita Patra, Lawrence Roy
2025 A conf
Pay What You Spend! Privacy-Aware Real-Time Pricing with High Precision IEEE 754 Floating Point Division.
AsiaCCS
Soumyadyuti Ghosh, Harishma Boyapally, Ajith Suresh, Arpita Patra, Soumyajit Dey, Debdeep Mukhopadhyay
2025 A* conf
Perfectly-secure Network-agnostic MPC with Optimal Resiliency.
PODC
Shravani Patil, Arpita Patra
2025 B ed.
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
Arpita Patra
2025 J jnl
emGraph: Efficient Multiparty Secure Graph Computation.
IACR Cryptol. ePrint Arch.
Siddharth Kapoor, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
2024 A* conf
Asterisk: Super-fast MPC with a Friend.
SP
Banashri Karmakar, Nishat Koti, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi
2024 — conf
Asynchronous Agreement on a Core Set in Constant Expected Time and More Efficient Asynchronous VSS and MPC.
TCC (4)
Ittai Abraham, Gilad Asharov, Arpita Patra, Gilad Stern
2024 A* conf
Graphiti: Secure Graph Computation Made More Scalable.
CCS
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
2024 J jnl
Graphiti: Secure Graph Computation Made More Scalable.
IACR Cryptol. ePrint Arch.
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
2024 — conf
Perfect Asynchronous MPC with Linear Communication Overhead.
EUROCRYPT (5)
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
2024 J jnl
Perfect Asynchronous MPC with Linear Communication Overhead.
IACR Cryptol. ePrint Arch.
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
2024 J jnl
Perfectly-secure Network-agnostic MPC with Optimal Resiliency.
IACR Cryptol. ePrint Arch.
Shravani Patil, Arpita Patra
2024 J jnl
Privadome: Delivery Drones and Citizen Privacy.
Proc. Priv. Enhancing Technol.
Gokulnath Pillai, Ajith Suresh, Eikansh Gupta, Vinod Ganapathy, Arpita Patra
2024 J jnl
QuickPool: Privacy-Preserving Ride-Sharing Service.
IACR Cryptol. ePrint Arch.
Banashri Karmakar, Shyam Murthy, Arpita Patra, Protik Paul
2024 J jnl
Vogue: Faster Computation of Private Heavy Hitters.
IEEE Trans. Dependable Secur. Comput.
Pranav Jangir, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, Somya Sangal
2023 J jnl
CompactTag: Minimizing Computation Overheads in Actively-Secure MPC for Deep Neural Networks.
CoRR
Yongqin Wang, Pratik Sarkar, Nishat Koti, Arpita Patra, Murali Annavaram
2023 J jnl
CompactTag: Minimizing Computation Overheads in Actively-Secure MPC for Deep Neural Networks.
IACR Cryptol. ePrint Arch.
Yongqin Wang, Pratik Sarkar, Nishat Koti, Arpita Patra, Murali Annavaram
2023 — conf
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time.
EUROCRYPT (2)
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
2023 J jnl
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time.
IACR Cryptol. ePrint Arch.
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
2023 J jnl
Entrada to Secure Graph Convolutional Networks.
IACR Cryptol. ePrint Arch.
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
2023 J jnl
Find Thy Neighbourhood: Privacy-Preserving Local Clustering.
Proc. Priv. Enhancing Technol.
Pranav Shriram A, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
2023 J jnl
MPClan: Protocol Suite for Privacy-Conscious Computations.
J. Cryptol.
Nishat Koti, Shravani Mahesh Patil, Arpita Patra, Ajith Suresh
2023 J jnl
On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience.
J. Cryptol.
Ashish Choudhury, Arpita Patra
2023 J jnl
Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time.
IACR Cryptol. ePrint Arch.
Ittai Abraham, Gilad Asharov, Arpita Patra, Gilad Stern
2023 J jnl
Ruffle: Rapid 3-Party Shuffle Protocols.
Proc. Priv. Enhancing Technol.
Pranav Shriram A, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, Somya Sangal
2023 J jnl
Ruffle: Rapid 3-party shuffle protocols.
IACR Cryptol. ePrint Arch.
Pranav Shriram A, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, Somya Sangal
2023 A* conf
Shield: Secure Allegation Escrow System with Stronger Guarantees.
WWW
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
2023 J jnl
Shield: Secure Allegation Escrow System with Stronger Guarantees.
IACR Cryptol. ePrint Arch.
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
2023 A* conf
The Round Complexity of Statistical MPC with Optimal Resiliency.
STOC
Benny Applebaum, Eliran Kachlon, Arpita Patra
2023 J jnl
The Round Complexity of Statistical MPC with Optimal Resiliency.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2023 J jnl
The Round Complexity of Statistical MPC with Optimal Resiliency.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2023 J jnl
sfAsterisk: Super-fast MPC with a Friend.
IACR Cryptol. ePrint Arch.
Banashri Karmakar, Nishat Koti, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi
2022 J jnl
A Survey on Perfectly Secure Verifiable Secret-sharing.
ACM Comput. Surv.
Anirudh Chandramouli, Ashish Choudhury, Arpita Patra
2022 — conf
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS.
TCC (1)
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
2022 J jnl
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS.
IACR Cryptol. ePrint Arch.
Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra
2022 J jnl
Attaining GOD Beyond Honest Majority With Friends and Foes.
IACR Cryptol. ePrint Arch.
Aditya Hegde, Nishat Koti, Varsha Bhat Kukkala, Shravani Patil, Arpita Patra, Protik Paul
2022 — conf
Attaining GOD Beyond Honest Majority with Friends and Foes.
ASIACRYPT (1)
Aditya Hegde, Nishat Koti, Varsha Bhat Kukkala, Shravani Patil, Arpita Patra, Protik Paul
2022 B ed.
Cryptology and Network Security - 21st International Conference, CANS 2022, Dubai, United Arab Emirates, November 13-16, 2022, Proceedings
CANS
Alastair R. Beresford, Arpita Patra, Emanuele Bellini
2022 J jnl
Find Thy Neighbourhood: Privacy-Preserving Local Clustering.
IACR Cryptol. ePrint Arch.
Pranav Shriram A, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
2022 — conf
Fully-Secure MPC with Minimal Trust.
TCC (2)
Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan
2022 J jnl
Fully-Secure MPC with Minimal Trust.
IACR Cryptol. ePrint Arch.
Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan
2022 J jnl
How to prove any NP statement jointly? Efficient Distributed-prover Zero-Knowledge Protocols.
Proc. Priv. Enhancing Technol.
Pankaj Dayama, Arpita Patra, Protik Paul, Nitin Singh, Dhinakaran Vinayagamurthy
2022 J jnl
MPClan: Protocol Suite for Privacy-Conscious Computations.
CoRR
Nishat Koti, Shravani Patil, Arpita Patra, Ajith Suresh
2022 J jnl
MPClan: Protocol Suite for Privacy-Conscious Computations.
IACR Cryptol. ePrint Arch.
Nishat Koti, Shravani Patil, Arpita Patra, Ajith Suresh
2022 — conf
On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness.
TCC (2)
Bar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra
2022 J jnl
On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness.
IACR Cryptol. ePrint Arch.
Bar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra
2022 J jnl
On the Communication Efficiency of Statistically-Secure Asynchronous MPC with Optimal Resilience.
IACR Cryptol. ePrint Arch.
Ashish Choudhury, Arpita Patra
2022 A* conf
PentaGOD: Stepping beyond Traditional GOD with Five Parties.
CCS
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
2022 J jnl
PentaGOD: Stepping beyond Traditional GOD with Five Parties.
IACR Cryptol. ePrint Arch.
Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal
2022 A* conf
Poster MPClan: : Protocol Suite for Privacy-Conscious Computations.
CCS
Nishat Koti, Shravani Patil, Arpita Patra, Ajith Suresh
2022 A* conf
Poster: Vogue: Faster Computation of Private Heavy Hitters.
CCS
Pranav Jangir, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, Somya Sangal
2022 J jnl
Privadome: Protecting Citizen Privacy from Delivery Drones.
CoRR
Gokulnath Pillai, Eikansh Gupta, Ajith Suresh, Vinod Ganapathy, Arpita Patra
2022 — conf
Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications.
CRYPTO (4)
Benny Applebaum, Yuval Ishai, Or Karni, Arpita Patra
2022 J jnl
Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Yuval Ishai, Or Karni, Arpita Patra
2022 — conf
Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract).
TCC (2)
Benny Applebaum, Eliran Kachlon, Arpita Patra
2022 A* conf
Tetrad: Actively Secure 4PC for Secure Training and Inference.
NDSS
Nishat Koti, Arpita Patra, Rahul Rachuri, Ajith Suresh
2022 J jnl
Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2022 — conf
Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority - (Extended Abstract).
CRYPTO (4)
Benny Applebaum, Eliran Kachlon, Arpita Patra
2022 J jnl
Vogue: Faster Computation of Private Heavy Hitters.
IACR Cryptol. ePrint Arch.
Pranav Jangir, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, Somya Sangal
2021 J jnl
A Survey on Perfectly-Secure Verifiable Secret-Sharing.
CoRR
Anirudh C, Ashish Choudhury, Arpita Patra
2021 J jnl
A Survey on Perfectly-Secure Verifiable Secret-Sharing.
IACR Cryptol. ePrint Arch.
Anirudh C, Ashish Choudhury, Arpita Patra
2021 A* conf
ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation.
USENIX Security Symposium
Arpita Patra, Thomas Schneider, Ajith Suresh, Hossein Yalame
2021 J jnl
How to prove any NP statement jointly? Efficient Distributed-prover Zero-Knowledge Protocols.
IACR Cryptol. ePrint Arch.
Pankaj Dayama, Arpita Patra, Protik Paul, Nitin Singh, Dhinakaran Vinayagamurthy
2021 J jnl
On the Exact Round Complexity of Secure Three-Party Computation.
J. Cryptol.
Arpita Patra, Divya Ravi
2021 J jnl
Optimal extension protocols for byzantine broadcast and agreement.
Distributed Comput.
Chaya Ganesh, Arpita Patra
2021 J jnl
Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2021 A* conf
SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning.
USENIX Security Symposium
Nishat Koti, Mahak Pancholi, Arpita Patra, Ajith Suresh
2021 — conf
SynCirc: Efficient Synthesis of Depth-Optimized Circuits for Secure Computation.
HOST
Arpita Patra, Thomas Schneider, Ajith Suresh, Hossein Yalame
2021 J jnl
SynCirc: Efficient Synthesis of Depth-Optimized Circuits for Secure Computation.
IACR Cryptol. ePrint Arch.
Arpita Patra, Thomas Schneider, Ajith Suresh, Hossein Yalame
2021 J jnl
Tetrad: Actively Secure 4PC for Secure Training and Inference.
CoRR
Nishat Koti, Arpita Patra, Rahul Rachuri, Ajith Suresh
2021 J jnl
Tetrad: Actively Secure 4PC for Secure Training and Inference.
IACR Cryptol. ePrint Arch.
Nishat Koti, Arpita Patra, Rahul Rachuri, Ajith Suresh
2021 — conf
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer.
CRYPTO (2)
Arpita Patra, Akshayaram Srinivasan
2021 J jnl
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer.
IACR Cryptol. ePrint Arch.
Arpita Patra, Akshayaram Srinivasan
2020 J jnl
ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation.
IACR Cryptol. ePrint Arch.
Arpita Patra, Thomas Schneider, Ajith Suresh, Hossein Yalame
2020 A* conf
BLAZE: Blazing Fast Privacy-Preserving Machine Learning.
NDSS
Arpita Patra, Ajith Suresh
2020 J jnl
BLAZE: Blazing Fast Privacy-Preserving Machine Learning.
CoRR
Arpita Patra, Ajith Suresh
2020 J jnl
BLAZE: Blazing Fast Privacy-Preserving Machine Learning.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ajith Suresh
2020 J jnl
FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning.
Proc. Priv. Enhancing Technol.
Megha Byali, Harsh Chaudhari, Arpita Patra, Ajith Suresh
2020 — conf
On the Exact Round Complexity of Best-of-Both-Worlds Multi-party Computation.
ASIACRYPT (3)
Arpita Patra, Divya Ravi, Swati Singla
2020 J jnl
On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation.
IACR Cryptol. ePrint Arch.
Arpita Patra, Divya Ravi, Swati Singla
2020 J jnl
SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning.
CoRR
Nishat Koti, Mahak Pancholi, Arpita Patra, Ajith Suresh
2020 J jnl
SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning.
IACR Cryptol. ePrint Arch.
Nishat Koti, Mahak Pancholi, Arpita Patra, Ajith Suresh
2020 J jnl
The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited.
J. ACM
Laasya Bangalore, Ashish Choudhury, Arpita Patra
2020 — conf
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract).
TCC (2)
Benny Applebaum, Eliran Kachlon, Arpita Patra
2020 J jnl
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2020 A* conf
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency.
FOCS
Benny Applebaum, Eliran Kachlon, Arpita Patra
2020 J jnl
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2020 J jnl
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2019 — conf
ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction.
CCSW
Harsh Chaudhari, Ashish Choudhury, Arpita Patra, Ajith Suresh
2019 J jnl
ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction.
CoRR
Harsh Chaudhari, Ashish Choudhury, Arpita Patra, Ajith Suresh
2019 J jnl
ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction.
IACR Cryptol. ePrint Arch.
Harsh Chaudhari, Ashish Choudhury, Arpita Patra, Ajith Suresh
2019 — conf
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation.
ASIACRYPT (1)
Arpita Patra, Divya Ravi
2019 J jnl
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation.
IACR Cryptol. ePrint Arch.
Arpita Patra, Divya Ravi
2019 J jnl
FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning.
IACR Cryptol. ePrint Arch.
Megha Byali, Harsh Chaudhari, Arpita Patra, Ajith Suresh
2019 A* conf
Fast Actively Secure Five-Party Computation with Security Beyond Abort.
CCS
Megha Byali, Carmit Hazay, Arpita Patra, Swati Singla
2019 J jnl
Fast Actively Secure Five-Party Computation with Security Beyond Abort.
IACR Cryptol. ePrint Arch.
Megha Byali, Carmit Hazay, Arpita Patra, Swati Singla
2019 J jnl
Fast Actively Secure OT Extension for Short Secrets.
CoRR
Arpita Patra, Pratik Sarkar, Ajith Suresh
2018 A* conf
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited.
PODC
Laasya Bangalore, Ashish Choudhury, Arpita Patra
2018 J jnl
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited.
IACR Cryptol. ePrint Arch.
Laasya Bangalore, Ashish Choudhury, Arpita Patra
2018 B conf
Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract).
SIROCCO
Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar
2018 J jnl
Crash-tolerant Consensus in Directed Graph Revisited.
IACR Cryptol. ePrint Arch.
Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar
2018 — conf
Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits.
Public Key Cryptography (2)
Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar
2018 J jnl
Efficient Adaptively Secure Zero-knowledge from Garbled Circuits.
IACR Cryptol. ePrint Arch.
Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar
2018 A* conf
Fast Secure Computation for Small Population over the Internet.
CCS
Megha Byali, Arun Joseph, Arpita Patra, Divya Ravi
2018 J jnl
Fast Secure Computation for Small Population over the Internet.
IACR Cryptol. ePrint Arch.
Megha Byali, Arun Joseph, Arpita Patra, Divya Ravi
2018 — conf
On the Exact Round Complexity of Secure Three-Party Computation.
CRYPTO (2)
Arpita Patra, Divya Ravi
2018 J jnl
On the Exact Round Complexity of Secure Three-Party Computation.
IACR Cryptol. ePrint Arch.
Arpita Patra, Divya Ravi
2018 J jnl
On the Power of Hybrid Networks in Multi-Party Computation.
IEEE Trans. Inf. Theory
Arpita Patra, Divya Ravi
2017 J jnl
An Efficient Framework for Unconditionally Secure Multiparty Computation.
IEEE Trans. Inf. Theory
Ashish Choudhury, Arpita Patra
2017 A conf
Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited.
DISC
Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar
2017 J jnl
Efficient One-Sided Adaptively Secure Computation.
J. Cryptol.
Carmit Hazay, Arpita Patra
2017 A* conf
Fast Actively Secure OT Extension for Short Secrets.
NDSS
Arpita Patra, Pratik Sarkar, Ajith Suresh
2017 J jnl
Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security.
IACR Cryptol. ePrint Arch.
Megha Byali, Arpita Patra, Divya Ravi, Pratik Sarkar
2017 J jnl
Optimal Extension Protocols for Byzantine Broadcast and Agreement.
IACR Cryptol. ePrint Arch.
Chaya Ganesh, Arpita Patra
2017 — conf
Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic.
CRYPTO (1)
Yashvanth Kondi, Arpita Patra
2017 J jnl
Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic.
IACR Cryptol. ePrint Arch.
Yashvanth Kondi, Arpita Patra
2017 Misc ed.
Progress in Cryptology - INDOCRYPT 2017 - 18th International Conference on Cryptology in India, Chennai, India, December 10-13, 2017, Proceedings
INDOCRYPT
Arpita Patra, Nigel P. Smart
2017 — conf
Round and Communication Efficient Unconditionally-Secure MPC with t t n / 3 in Partially Synchronous Network.
ICITS
Ashish Choudhury, Arpita Patra, Divya Ravi
2017 J jnl
Round and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network.
IACR Cryptol. ePrint Arch.
Ashish Choudhury, Arpita Patra, Divya Ravi
2016 A* conf
Broadcast Extensions with Optimal Communication and Round Complexity.
PODC
Chaya Ganesh, Arpita Patra
2016 J jnl
Fast Actively Secure OT Extension for Short Secrets.
IACR Cryptol. ePrint Arch.
Arpita Patra, Pratik Sarkar, Ajith Suresh
2016 Misc conf
Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing.
SCN
Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
2015 A* conf
Adaptively Secure Computation with Partial Erasures.
PODC
Carmit Hazay, Yehuda Lindell, Arpita Patra
2015 J jnl
Adaptively Secure Computation with Partial Erasures.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Yehuda Lindell, Arpita Patra
2015 J jnl
Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation.
J. Cryptol.
Arpita Patra, Ashish Choudhury, C. Pandu Rangan
2015 J jnl
Linear Overhead Robust MPC with Honest Majority Using Preprocessing.
IACR Cryptol. ePrint Arch.
Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
2015 Misc conf
Optimally Resilient Asynchronous MPC with Linear Communication Complexity.
ICDCN
Ashish Choudhury, Arpita Patra
2015 — conf
Selective Opening Security for Receivers.
ASIACRYPT (1)
Carmit Hazay, Arpita Patra, Bogdan Warinschi
2015 J jnl
Selective Opening Security for Receivers.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Arpita Patra, Bogdan Warinschi
2014 — conf
Anonymous Authentication with Shared Secrets.
LATINCRYPT
Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov
2014 J jnl
Anonymous Authentication with Shared Secrets.
IACR Cryptol. ePrint Arch.
Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov
2014 J jnl
Asynchronous Byzantine Agreement with optimal resilience.
Distributed Comput.
Arpita Patra, Ashish Choudhury, C. Pandu Rangan
2014 Misc conf
Key-Indistinguishable Message Authentication Codes.
SCN
Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov
2014 J jnl
Key-Indistinguishable Message Authentication Codes.
IACR Cryptol. ePrint Arch.
Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov
2014 B conf
One-Sided Adaptively Secure Two-Party Computation.
TCC
Carmit Hazay, Arpita Patra
2014 J jnl
Reducing the Overhead of Cloud MPC.
IACR Cryptol. ePrint Arch.
Ashish Choudhury, Arpita Patra, Nigel P. Smart
2014 Misc conf
Reducing the Overhead of MPC over a Large Population.
SCN
Ashish Choudhury, Arpita Patra, Nigel P. Smart
2013 A conf
Asynchronous Multiparty Computation with Linear Communication Complexity.
DISC
Ashish Choudhury, Martin Hirt, Arpita Patra
2013 J jnl
Between a Rock and a Hard Place: Interpolating Between MPC and FHE.
IACR Cryptol. ePrint Arch.
Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
2013 — conf
Between a Rock and a Hard Place: Interpolating between MPC and FHE.
ASIACRYPT (2)
Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
2013 J jnl
One-Sided Adaptively Secure Two-Party Computation.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Arpita Patra
2012 A* conf
Brief announcement: efficient optimally resilient statistical AVSS and its applications.
PODC
Ashish Choudhury, Arpita Patra
2012 J jnl
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission.
J. ACM
Ashwinkumar Badanidiyuru, Arpita Patra, Ashish Choudhury, Kannan Srinathan, C. Pandu Rangan
2012 J jnl
Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity.
IACR Cryptol. ePrint Arch.
Ashish Choudhury, Martin Hirt, Arpita Patra
2011 — conf
Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience.
ICITS
Arpita Patra, C. Pandu Rangan
2011 A conf
Computational Verifiable Secret Sharing Revisited.
ASIACRYPT
Michael Backes, Aniket Kate, Arpita Patra
2011 J jnl
Computational Verifiable Secret Sharing Revisited.
IACR Cryptol. ePrint Arch.
Michael Backes, Aniket Kate, Arpita Patra
2011 B conf
Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity.
OPODIS
Arpita Patra
2011 J jnl
Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity.
IACR Cryptol. ePrint Arch.
Arpita Patra
2011 Misc conf
On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks.
ICISC
Ashish Choudhury, Arpita Patra
2011 J jnl
On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks.
IACR Cryptol. ePrint Arch.
Ashish Choudhury, Arpita Patra
2011 J jnl
Secure message transmission in asynchronous networks.
J. Parallel Distributed Comput.
Ashish Choudhury, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan
2011 J jnl
Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary.
IACR Cryptol. ePrint Arch.
Ashish Choudhury, Kaoru Kurosawa, Arpita Patra
2011 B conf
Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary.
ACNS
Ashish Choudhury, Kaoru Kurosawa, Arpita Patra
2011 J jnl
Statistical Asynchronous Weak Commitment Scheme: A New Primitive to Design Statistical Asynchronous Verifiable Secret Sharing Scheme.
IACR Cryptol. ePrint Arch.
Ashish Choudhury, Arpita Patra
2011 — conf
The Round Complexity of Perfectly Secure General VSS.
ICITS
Ashish Choudhury, Kaoru Kurosawa, Arpita Patra
2010 A* conf
Brief announcement: communication efficient asynchronous byzantine agreement.
PODC
Arpita Patra, C. Pandu Rangan
2010 A* conf
Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity.
PODC
Arpita Patra, Ashish Choudhury, C. Pandu Rangan
2010 — conf
Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience.
AFRICACRYPT
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2010 J jnl
Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2010 — conf
Communication Optimal Multi-valued Asynchronous Broadcast Protocol.
LATINCRYPT
Arpita Patra, C. Pandu Rangan
2010 J jnl
Communication and Round Efficient Information Checking Protocol
CoRR
Arpita Patra, C. Pandu Rangan
2010 Misc conf
On Communication Complexity of Secure Message Transmission in Directed Networks.
ICDCN
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2010 J jnl
Studies on Verifiable Secret Sharing, Byzantine Agreement and Multiparty Computation.
IACR Cryptol. ePrint Arch.
Arpita Patra
2010 J jnl
The Round Complexity of General VSS.
IACR Cryptol. ePrint Arch.
Ashish Choudhury, Kaoru Kurosawa, Arpita Patra
2010 A conf
The Round Complexity of Verifiable Secret Sharing: The Statistical Case.
ASIACRYPT
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan
2010 J jnl
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality.
Int. J. Appl. Cryptogr.
Arpita Patra, Ashish Choudhury, C. Pandu Rangan, Kannan Srinathan
2009 A* conf
Brief announcement: perfectly secure message transmission in directed networks re-visited.
PODC
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 Misc conf
Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience.
Inscrypt
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 J jnl
Communication Optimal Multi-Valued Asynchronous Byzantine Agreement with Optimal Resilience.
IACR Cryptol. ePrint Arch.
Arpita Patra, C. Pandu Rangan
2009 J jnl
Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 — conf
Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience.
ICITS
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 J jnl
Information Theoretically Secure Multi Party Set Intersection Re-Visited.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 B conf
Information Theoretically Secure Multi Party Set Intersection Re-visited.
Selected Areas in Cryptography
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 J jnl
Multi Party Distributed Private Matching, Set Disjointness and Cardinality Set Intersection with Information Theoretic Security.
IACR Cryptol. ePrint Arch.
G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 B conf
Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security.
CANS
G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 Misc conf
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks.
ICDCN
Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan
2009 J jnl
On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 J jnl
Perfectly reliable and secure message transmission tolerating mobile adversary.
Int. J. Appl. Cryptogr.
Arpita Patra, Ashish Choudhary, C. Pandu Rangan, Kannan Srinathan, Prasad Raghavendra
2009 Misc conf
Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience.
INDOCRYPT
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 A* conf
Simple and efficient asynchronous byzantine agreement with optimal resilience.
PODC
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 A* conf
The Round Complexity of Verifiable Secret Sharing Revisited.
CRYPTO
Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan
2009 A conf
Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary.
AsiaCCS
Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2008 J jnl
Efficient Asynchronous Byzantine Agreement with Optimal Resilience.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhury, C. Pandu Rangan
2008 J jnl
Efficient Asynchronous Multiparty Computation with Optimal Resilience.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhury, C. Pandu Rangan
2008 J jnl
Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhary, Madhu Gayatri, C. Pandu Rangan
2008 Misc conf
Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary.
ACISP
Arpita Patra, Ashish Choudhary, Madhu Vaidyanathan, C. Pandu Rangan
2008 A* conf
Efficient single phase unconditionally secure message transmission with optimum communication complexity.
PODC
Kannan Srinathan, Ashish Choudhary, Arpita Patra, C. Pandu Rangan
2008 J jnl
Enhancing decision combination of face and fingerprint by exploitation of individual classifier space: An approach to multi-modal biometry.
Pattern Recognit.
Arpita Patra, Sukhendu Das
2008 A* conf
On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary.
PODC
B. V. Ashwinkumar, Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan
2008 — conf
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary.
ICITS
Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, K. Srinathan, C. Pandu Rangan
2008 J jnl
Perfectly Secure Message Transmission Tolerating Mixed Adversary.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhury, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan
2008 Misc conf
Round Efficient Unconditionally Secure Multiparty Computation Protocol.
INDOCRYPT
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2008 J jnl
Round Efficient Unconditionally Secure Multiparty Computation Protocol.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2008 J jnl
Statistically Reliable and Secure Message Transmission in Directed Networks.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhury, C. Pandu Rangan
2008 J jnl
The Round Complexity of Verifiable Secret Sharing Revisited.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan
2008 B conf
Unconditionally Reliable Message Transmission in Directed Hypergraphs.
CANS
Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2008 J jnl
Unconditionally Reliable Message Transmission in Directed Hypergraphs.
IACR Cryptol. ePrint Arch.
Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2008 Misc conf
Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited.
SCN
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2008 J jnl
Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhury, C. Pandu Rangan, Kannan Srinathan
2008 J jnl
Unconditionally Secure Message Transmission in Arbitrary Directed Synchronous Networks Tolerating Generalized Mixed Adversary.
IACR Cryptol. ePrint Arch.
Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2008 J jnl
Unconditionally Secure Multiparty Set Intersection Re-Visited.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2007 A* conf
Constant phase efficient protocols for secure message transmission in directed networks.
PODC
Arpita Patra, Ashish Choudhary, Chandrasekaran Pandu Rangan
2007 J jnl
Indoor versus Outdoor Scene Classification Using Probabilistic Neural Network.
EURASIP J. Adv. Signal Process.
Lalit Gupta, Vinod Pathangay, Arpita Patra, A. Dyana, Sukhendu Das
2007 A conf
Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary.
DISC
Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan
2007 B conf
Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary.
CANS
Arpita Patra, Bhavani Shankar, Ashish Choudhary, K. Srinathan, C. Pandu Rangan
2007 Misc conf
Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality.
INDOCRYPT
Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2006 Misc conf
Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission.
INDOCRYPT
Arpita Patra, Ashish Choudhary, K. Srinathan, C. Pandu Rangan