© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Lecture notes in computer science

Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience

Arpita Patra, Ashish Choudhary, Chandrasekharan Pandu Rangan

Published Jan 1, 2009• 11 citations

DOI: 10.1007/978-3-642-10628-6_26

Related papers

Round Efficient Unconditionally Secure Multiparty Computation Protocol

Arpita Patra, Ashish Choudhary, Chandrasekharan Pandu Rangan

Lecture notes in computer science•Jan 1, 2008•12 citations

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

Benny Applebaum, Eliran Kachlon, Arpita Patra

IEEE Conference Proceedings•Jan 1, 2020•0 citations

Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience

Arpita Patra, Ashish Choudhury, Chandrasekharan Pandu Rangan

Lecture notes in computer science•Jan 1, 2010•14 citations

An Unconditionally Secure Protocol for Multi-Party Set Intersection

Ronghua Li, Chuan-Kun Wu

Lecture notes in computer science•Jan 1, 2007•42 citations

On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience

Ashish Choudhury, Arpita Patra

Journal of Cryptology•Mar 25, 2023•25 citations

Round and Communication Efficient Unconditionally-Secure MPC with $$t<n/3$$ in Partially Synchronous Network

Ashish Choudhury, Arpita Patra, Divya Ravi

Lecture notes in computer science•Jan 1, 2017•5 citations

Round and Communication Efficient Unconditionally-Secure MPC with

t<n/3

in Partially Synchronous Network