Cryptography and Information Security Lab

Department of Computer Science and Automation


Publications and Preprints

2024
Privadome: A Framework for Citizen Privacy in the Delivery Drone Era

Gokulnath PillaiEikansh GuptaAjith SureshVinod Ganapathy and Arpita Patra

picture_as_pdf
Perfect Asynchronous MPC with Linear Communication Overhead

Ittai AbrahamGilad AsharovShravani Patil and Arpita Patra

picture_as_pdf
Asterisk: Super-fast MPC with a Friend

Banashri KarmakarNishat KotiArpita PatraSikhar PatranabisProtik Paul and Divya Ravi

picture_as_pdf
Succinct Verification of Compressed Sigma Protocols in the Updatable SRS setting

Moumita DuttaChaya Ganesh and Neha Jawalkar

picture_as_pdf
2023
MPClan: Protocol Suite for Privacy-Conscious Computations

Nishat KotiShravani PatilArpita Patra and Ajith Suresh

picture_as_pdf
Ruffle: Rapid 3-Party Shuffle Protocols

Pranav Shriram ANishat KotiVarsha Bhat KukkalaArpita PatraBhavish Raj Gopal and Somya Sangal

picture_as_pdf
The Round Complexity of Statistical MPC with Optimal Resiliency

Benny ApplebaumEliran Kachlon and Arpita Patra

picture_as_pdf
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time

Ittai AbrahamGilad AsharovShravani Patil and Arpita Patra

picture_as_pdf
Shield: Secure Allegation Escrow System with Stronger Guarantees

Nishat KotiVarsha Bhat KukkalaArpita Patra and Bhavish Raj Gopal

picture_as_pdf
On the Communication Efficiency of Statistically-Secure Asynchronous MPC

Ashish Choudhury and Arpita Patra

picture_as_pdf
Find Thy Neighbourhood: Privacy-Preserving Local Clustering

Pranav Shriram ANishat KotiVarsha Bhat KukkalaArpita Patra and Bhavish Raj Gopal

picture_as_pdf
Vogue: Faster Computation of Private Heavy Hitters

Pranav JangirNishat KotiVarsha Bhat KukkalaArpita PatraBhavish Raj Gopal and Somya Sangal

picture_as_pdf
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation

Arpita Patra and Divya Ravi

picture_as_pdf
2022
Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security

Benny ApplebaumEliran Kachlon and Arpita Patra

picture_as_pdf
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS

Ittai AbrahamGilad AsharovShravani Patil and Arpita Patra

picture_as_pdf
Fully-Secure MPC with Minimal Trust

Yuval IshaiArpita PatraSikhar PatranabisDivya Ravi and Akshayaram Srinivasan

picture_as_pdf
Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness

Bar AlonOlga NissenbaumEran OmriAnat Paskin-Cherniavsky and Arpita Patra

picture_as_pdf
Attaining GOD Beyond Honest Majority with Friends and Foes

Aditya HedgeNishat KotiVarsha Bhat KukkalaShravani PatilArpita Patra and Protik Paul

picture_as_pdf
Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority

Benny ApplebaumEliran Kachlon and Arpita Patra

picture_as_pdf
Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications

Benny ApplebaumYuval IshaiOrr Karni and Arpita Patra

picture_as_pdf
PentaGOD: Stepping beyond traditional GOD with five parties

Nishat KotiVarsha Bhat KukkalaBhavish Raj Gopal and Arpita Patra

picture_as_pdf
A survey on Perfectly-Secure Verifiable Secret-Sharing

Anirudh CAshish Choudhury and Arpita Patra

picture_as_pdf
How to prove any NP statement jointly? Efficient Distributed-prover Zero-Knowledge Protocols

Pankaj DayamaArpita PatraProtik PaulNitin Singh and Dhinakaran Vinayagamurthy

picture_as_pdf
Tetrad: Actively Secure 4PC for Secure Training and Inference

Nishat KotiArpita PatraRahul Rachuri and Ajith Suresh

picture_as_pdf
2021
SynCirc: Efficient Synthesis of Depth‐Optimized Circuits for Secure Computation

Arpita PatraThomas SchneiderAjith Suresh and Hossein Yalame

picture_as_pdf
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer

Arpita Patra and Akshayaram Srinivasan (TIFR)

picture_as_pdf
MPCLeague: Robust and Efficient Mixed-protocol Framework for 4-party Computation

Nishat KotiArpita Patra and Ajith Suresh

picture_as_pdf
SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning

Nishat KotiMahak PancholiArpita Patra and Ajith Suresh

picture_as_pdf
Optimal Extension Protocols for Byzantine Broadcast and Agreement

Chaya Ganesh and Arpita Patra

picture_as_pdf
ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation

Arpita PatraThomas SchneiderAjith Suresh and Hossein Yalame

picture_as_pdf
2020
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors

Benny ApplebaumEliran Kachlon and Arpita Patra

picture_as_pdf
On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation

Arpita PatraDivya Ravi and Swati Singla

picture_as_pdf
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency

Benny ApplebaumEliran Kachlon and Arpita Patra

picture_as_pdf
The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited

Laasya BangaloreAshish Choudhury and Arpita Patra

picture_as_pdf
BLAZE: Blazing Fast Privacy-Preserving Machine Learning

Arpita Patra and Ajith Suresh

picture_as_pdf
FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning

Megha ByaliHarsh ChaudhariArpita Patra and Ajith Suresh

picture_as_pdf
Trident: Efficient 4PC Framework for Privacy Preserving Machine Learning

Harsh ChaudhariRahul Rachuri and Ajith Suresh

picture_as_pdf
2019
ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction

Harsh ChaudhariAshish ChoudhuryArpita Patra and Ajith Suresh

picture_as_pdf
Fast Actively-Secure 5-Party Computation with Security Beyond Abort

Megha ByaliCarmit HazayArpita Patra and Swati Singla

picture_as_pdf
2018
Fast Secure Computation for Small Population over the Internet

Megha ByaliArun JosephArpita Patra and Divya Ravi

picture_as_pdf
On the Exact Round complexity of Secure Three-party Computation

Arpita Patra and Divya Ravi

picture_as_pdf
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited

Laasya BangaloreAshish Choudhury and Arpita Patra

picture_as_pdf
On the power of Hybrid Networks in Multi-party Computation

Arpita Patra and Divya Ravi

picture_as_pdf
Crash-Tolerant Consensus in Directed Graph Revisited

Ashish ChoudhuryGayathri GarimellaArpita PatraDivya Ravi and Pratik Sarkar

picture_as_pdf
Efficient Adaptively Secure Zero-knowledge from Garbled Circuits

Chaya GaneshYashvanth KondiArpita Patra and Pratik Sarkar

picture_as_pdf
2017
An Efficient Framework for Unconditionally-secure Multiparty Computation

Ashish Choudhary and Arpita Patra

picture_as_pdf
Round and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network.

Ashish ChoudhuryArpita Patra and Divya Ravi

picture_as_pdf
Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic

Yashvanth Kondi and Arpita Patra

picture_as_pdf
Fast Actively Secure OT Extension for Short Secrets

Arpita PatraPratik Sarkar and Ajith Suresh

picture_as_pdf
2016
Efficient One-Sided Adaptively Secure Computation

Carmit Hazay and Arpita Patra

picture_as_pdf
Broadcast Extensions with Optimal Communication and Round Complexity

Chaya Ganesh and Arpita Patra

picture_as_pdf
Linear Overhead Robust MPC with Honest Majority Using Preprocessing

Ashish ChoudhuryEmmanuela OrsiniArpita Patra and Nigel Smart

picture_as_pdf
2015
Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation

Ashish ChoudharyArpita Patra and C. Pandu Rangan

picture_as_pdf
Selective Opening Security for Receivers

Carmit HazayArpita Patra and Bogdan Warinschi

picture_as_pdf
Adaptively Secure Computation with Partial Erasures

Carmit HazayYehuda Lindell and Arpita Patra

picture_as_pdf
Optimally Resilient Asynchronous MPC with Linear Communication Complexity

Ashish Choudhury and Arpita Patra

picture_as_pdf
2014
Efficient Asynchronous Byzantine Agreement with Optimal Resilience

Ashish ChoudharyArpita Patra and C. Pandu Rangan

picture_as_pdf
Anonymous Authentication with Shared Secrets

Joel AlwenMartin HirtUeli MaurerArpita Patra and Pavel Raykov

picture_as_pdf
Key-Indistinguishable Message Authentication Codes

Joel AlwenMartin HirtUeli MaurerArpita Patra and Pavel Raykov

picture_as_pdf
Reducing the Overhead of MPC over a Large Population

Ashish ChoudhuryArpita Patra and Nigel P. Smart

picture_as_pdf
One-Sided Adaptively Secure Two-Party Computation

Carmit Hazay and Arpita Patra

picture_as_pdf



On this page