Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Asynchronous Secure Communication Tolerating Mixed Adversaries

Kannan Srinathan, Mrinal Kumar, Chandrasekharan Pandu Rangan

Published Jan 1, 2002• 14 citations
Publisher
DOI
10.1007/3-540-36178-2_14

Related papers

Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries

Mrinal Kumar, Kannan Srinathan, Chandrasekharan Pandu Rangan

Lecture notes in computer science•Jan 1, 2002•7 citations

Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary

Arpita Patra, Ashish Choudhary, Kannan Srinathan +1 more

Lecture notes in computer science•Sep 5, 2007•9 citations

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary

Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar +2 more

Lecture notes in computer science•Aug 12, 2008•12 citations

Perfectly Secure Message Transmission Tolerating Mixed Adversary.

Arpita Patra, Ashish Choudhury, B. V. Ashwinkumar +2 more

•Jan 1, 2008•0 citations

Asynchronous Perfectly Secure Communication over One-Time Pads

Giovanni Di Crescenzo, Aggelos Kiayias

Lecture notes in computer science•Jan 1, 2005•9 citations

Optimally Resilient Asynchronous MPC with Linear Communication Complexity

Ashish Choudhury, Arpita Patra

We present a secure asynchronous multiparty computation (AMPC) protocol with optimal resilience, involving n = 3t + 1 parties and tolerating a computationally bounded static adversary, capable of corrupting upto t parties. For a security parameter k and for circuits of sufficiently large size, our protocol has an amortized communication complexity of O(cMnk) bits, where cM denotes the number of multiplication gates in the arithmetic circuit, representing the function to be computed. Prior to our work, the most efficient optimally resilient, computationally secure AMPC protocol was due to Hirt et al. (ICALP 2008). The protocol offers an amortized communication complexity of O(cMn2k) bits.

International Conference on Distributed Computing and Networking (ICDCN)•Jan 4, 2015•33 citations
We present a secure asynchronous multiparty computation (AMPC) protocol with optimal resilience, involving n = 3t + 1 parties and tolerating a computationally bounded static adversary, capable of corrupting upto t parties. For a security parameter k and for circuits of sufficiently large size, our protocol has an amortized communication complexity of O(cMnk) bits, where cM denotes the number of multiplication gates in the arithmetic circuit, representing the function to be computed. Prior to our work, the most efficient optimally resilient, computationally secure AMPC protocol was due to Hirt et al. (ICALP 2008). The protocol offers an amortized communication complexity of O(cMn2k) bits.