Arpita Patra
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Arpita Patra has a total of 65 co-authors. Here are the top co-authors by number of shared publications:
- Ashish Choudhury
International Institute of Information Technology Bangalore
33 shared publications - Nishat Koti
Indian Institute of Science, Bangalore
11 shared publications - Shravani Patil
Indian Institute of Science, Bangalore, India
9 shared publications - Varsha Bhat Kukkala
Indian Institute of Science
7 shared publications - Gilad Asharov
Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel
6 shared publications - Ajith Suresh
Technology Innovation Institute, Abu Dhabi, UAE
4 shared publications
Latest Publications
- 6 November 2026
- Published by Springer Nature
- p. 242-277
Statistical MPC with a Constant Communication Overhead (Extended Abstract)
- 6 November 2026
- Published by Springer Nature
- p. 242-277
Statistical MPC with a Constant Communication Overhead (Extended Abstract)
- 31 October 2026
- Published by Springer Nature
- p. 3-35
Constant-Round MPC Protocols with Fall-Back Security
- 31 October 2026
- Published by Springer Nature
- p. 3-35
Constant-Round MPC Protocols with Fall-Back Security
- 31 October 2026
- Published by Springer Nature
- p. 87-124
(Im)possibility of Asynchronous MPC with Honest Majority over Blockchains
- 31 October 2026
- Published by Springer Nature
- p. 87-124
(Im)possibility of Asynchronous MPC with Honest Majority over Blockchains
- 19 October 2026
- Published by Springer Nature in Journal of Cryptology
- Vol. 40 (1) , 1
Detect, Pack and Batch: Perfectly Secure MPC with Linear Communication and Constant Expected Time
- 19 October 2026
- Published by Springer Nature in Journal of Cryptology
- Vol. 40 (1) , 1
Detect, Pack and Batch: Perfectly Secure MPC with Linear Communication and Constant Expected Time
- 16 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (6) , 2200-2211
SynCirc: Efficient Syn thesis of Depth-Optimized Circ uits From High-Level Languages
Secure Multi-Party Computation (MPC) enables secure computation on private data. Many of today’s efficient MPC protocols need a representation of the evaluated function as circuit composed of Boolean or Lookup Tables (LUTs). To improve the practicality of MPC, we present SynCirc, a hardware synthesis framework optimized for MPC applications. Built on Verilog and the open-source tool Yosys-ABC, SynCirc introduces custom libraries and constraints for multi-input AND gates, achieving up to$3\times$ reduction in multiplicative depth and online rounds compared to TinyGMW (Demmler et al., CCS’15). SynCirc also offers an expanded library of efficient building blocks like comparison, multiplexers and equality checks, and incorporates Boolean and LUT circuits. For these building blocks, we achieve improvements in multiplicative depth/online rounds between$22.3\%$ and$66.7\%$ over ShallowCC (Büscher et al., ESORICS’16). Our evaluation using the FLUTE framework (Brüggemann et al., IEEE S&P’23) shows that SynCirc has$116\times$ less online communication than the multi-input AND gate protocol of Trifecta (Faraji and Kerschbaum, PETS’23). SynCirc introduces new capabilities, including enhanced support for High-Level Synthesis (HLS) with the XLS tool, enabling developers to create secure functions in C/C++ without the need for expertise in hardware definition languages like Verilog. SynCirc is an open-source toolchain that democratizes secure computation, simplifies circuit synthesis, and makes advanced privacy-preserving technologies more accessible.- 16 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (6) , 2200-2211
SynCirc: Efficient Syn thesis of Depth-Optimized Circ uits From High-Level Languages
Secure Multi-Party Computation (MPC) enables secure computation on private data. Many of today’s efficient MPC protocols need a representation of the evaluated function as circuit composed of Boolean or Lookup Tables (LUTs). To improve the practicality of MPC, we present SynCirc, a hardware synthesis framework optimized for MPC applications. Built on Verilog and the open-source tool Yosys-ABC, SynCirc introduces custom libraries and constraints for multi-input AND gates, achieving up to$3\times$ reduction in multiplicative depth and online rounds compared to TinyGMW (Demmler et al., CCS’15). SynCirc also offers an expanded library of efficient building blocks like comparison, multiplexers and equality checks, and incorporates Boolean and LUT circuits. For these building blocks, we achieve improvements in multiplicative depth/online rounds between$22.3\%$ and$66.7\%$ over ShallowCC (Büscher et al., ESORICS’16). Our evaluation using the FLUTE framework (Brüggemann et al., IEEE S&P’23) shows that SynCirc has$116\times$ less online communication than the multi-input AND gate protocol of Trifecta (Faraji and Kerschbaum, PETS’23). SynCirc introduces new capabilities, including enhanced support for High-Level Synthesis (HLS) with the XLS tool, enabling developers to create secure functions in C/C++ without the need for expertise in hardware definition languages like Verilog. SynCirc is an open-source toolchain that democratizes secure computation, simplifies circuit synthesis, and makes advanced privacy-preserving technologies more accessible.- 15 October 2025
- Published by Springer Nature in Journal of Cryptology
- Vol. 38 (4) , 1-52
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS
- 15 October 2025
- Published by Springer Nature in Journal of Cryptology
- Vol. 38 (4) , 1-52
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS
- Open Access
- 1 October 2025
- Published by Privacy Enhancing Technologies Symposium Advisory Board in Proceedings on Privacy Enhancing Technologies
- Vol. 2025 (4) , 308-328
Match Quest: Fast and Secure Pattern Matching
Pattern matching (PM) is the technique of identifying occurrences of a short pattern in a long text, where both, the pattern and text, are a string of characters. Since several applications demand the privacy of the pattern and the text in the process of identifying matches, designing secure solutions for PM is gaining popularity. Moreover, given the variety of applications that consider PM, we design secure solutions for three popular variants of PM---exact, wildcard and approximate. Our solutions are designed using the techniques of secure multiparty computation (MPC) in the two-party semi-honest setting. All of our solutions attain a fast response time, which is the time taken from submission of the input to obtaining the output, and forms a crucial parameter when analysing the performance of any protocol. Moreover, our protocols also provide an improved online communication complexity in comparison to prior works. Since determining if two secret-shared values are equal forms a crucial component in all the PM variants, we design a novel constant-round equality protocol in the two-party semi-honest setting. Our equality protocol outperforms all the prior works in the considered setting and can also be of independent interest. We implement all our protocols on the MPC framework of MOTION2NX to showcase the practicality of the designed solutions. In comparison to prior works that consider DNA matching (over 2-bit characters), our pattern matching protocols see improvements of up to 2 orders of magnitude in response time. Our equality protocol, too, excels over all existing constructions. To analyse the performance of our equality protocol in comparison to prior work, we benchmark it for varying input sizes. We observe that with increasing input sizes, the improvement in response time of our protocol keeps on increasing, with improvements of up to 9.7x for 256-bit inputs.
- 1 October 2025
- Published by Privacy Enhancing Technologies Symposium Advisory Board in Proceedings on Privacy Enhancing Technologies
- Vol. 2025 (4) , 308-328
Open AccessMatch Quest: Fast and Secure Pattern Matching
Pattern matching (PM) is the technique of identifying occurrences of a short pattern in a long text, where both, the pattern and text, are a string of characters. Since several applications demand the privacy of the pattern and the text in the process of identifying matches, designing secure solutions for PM is gaining popularity. Moreover, given the variety of applications that consider PM, we design secure solutions for three popular variants of PM---exact, wildcard and approximate. Our solutions are designed using the techniques of secure multiparty computation (MPC) in the two-party semi-honest setting. All of our solutions attain a fast response time, which is the time taken from submission of the input to obtaining the output, and forms a crucial parameter when analysing the performance of any protocol. Moreover, our protocols also provide an improved online communication complexity in comparison to prior works. Since determining if two secret-shared values are equal forms a crucial component in all the PM variants, we design a novel constant-round equality protocol in the two-party semi-honest setting. Our equality protocol outperforms all the prior works in the considered setting and can also be of independent interest. We implement all our protocols on the MPC framework of MOTION2NX to showcase the practicality of the designed solutions. In comparison to prior works that consider DNA matching (over 2-bit characters), our pattern matching protocols see improvements of up to 2 orders of magnitude in response time. Our equality protocol, too, excels over all existing constructions. To analyse the performance of our equality protocol in comparison to prior work, we benchmark it for varying input sizes. We observe that with increasing input sizes, the improvement in response time of our protocol keeps on increasing, with improvements of up to 9.7x for 256-bit inputs.
- 22 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (1) , 923-935
Entrada to Secure Graph Convolutional Networks 1
Graph convolutional networks (GCNs) are gaining popularity due to their powerful modelling capabilities. However, guaranteeing privacy is an issue when evaluating on inputs that contain users' sensitive information such as social interactions, financial transactions, etc. To address such privacy concerns, we design $\mathsf {Entrada}$, a framework for securely evaluating GCNs that relies on the technique of secure multiparty computation (MPC). For efficiency and accuracy reasons, $\mathsf {Entrada}$ builds over 4-party MPC framework of Tetrad (NDSS'22) and enhances it by providing necessary primitives. Moreover, $\mathsf {Entrada}$ leverages GraphSC paradigm of Araki et al. (CCS'21) to further enhance efficiency. To leverage the GraphSC paradigm, we (i) identify computations in GCN evaluation that benefit from GraphSC, and (ii) define $\mathsf {Scatter}\PLXtext{-}\mathsf {Gather}$ primitives of GraphSC specific to the identified computations. Further, as required for GraphSC, we design a secure and efficient shuffle protocol in the 4-party setting, which to the best of our knowledge, is done for the first time and may be of independent interest. Through extensive experiments, we showcase secure GCN's accuracy evaluated via $\mathsf {Entrada}$ is on par with its cleartext counterpart. We benchmark efficiency of $\mathsf {Entrada}$ with respect to the included primitives as well as the framework as a whole. Finally, we showcase $\mathsf {Entrada}$'s practicality by benchmarking GCN-based fraud detection applications.
- 22 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (1) , 923-935
Entrada to Secure Graph Convolutional Networks 1
Graph convolutional networks (GCNs) are gaining popularity due to their powerful modelling capabilities. However, guaranteeing privacy is an issue when evaluating on inputs that contain users' sensitive information such as social interactions, financial transactions, etc. To address such privacy concerns, we design $\mathsf {Entrada}$, a framework for securely evaluating GCNs that relies on the technique of secure multiparty computation (MPC). For efficiency and accuracy reasons, $\mathsf {Entrada}$ builds over 4-party MPC framework of Tetrad (NDSS'22) and enhances it by providing necessary primitives. Moreover, $\mathsf {Entrada}$ leverages GraphSC paradigm of Araki et al. (CCS'21) to further enhance efficiency. To leverage the GraphSC paradigm, we (i) identify computations in GCN evaluation that benefit from GraphSC, and (ii) define $\mathsf {Scatter}\PLXtext{-}\mathsf {Gather}$ primitives of GraphSC specific to the identified computations. Further, as required for GraphSC, we design a secure and efficient shuffle protocol in the 4-party setting, which to the best of our knowledge, is done for the first time and may be of independent interest. Through extensive experiments, we showcase secure GCN's accuracy evaluated via $\mathsf {Entrada}$ is on par with its cleartext counterpart. We benchmark efficiency of $\mathsf {Entrada}$ with respect to the included primitives as well as the framework as a whole. Finally, we showcase $\mathsf {Entrada}$'s practicality by benchmarking GCN-based fraud detection applications.
- Open Access
- 24 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 87-103
Pay What You Spend! Privacy-Aware Real-Time Pricing with High Precision IEEE 754 Floating Point Division
- 24 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 87-103
Open AccessPay What You Spend! Privacy-Aware Real-Time Pricing with High Precision IEEE 754 Floating Point Division
- Open Access
- 13 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 121-130
Perfectly-secure Network-agnostic MPC with Optimal Resiliency
- 13 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 121-130
Open AccessPerfectly-secure Network-agnostic MPC with Optimal Resiliency