Network Agnostic Perfectly Secure MPC Against General Adversaries

Authors Ananya Appan , Anirudh Chandramouli , Ashish Choudhury

Thumbnail PDF


  • Filesize: 0.86 MB
  • 19 pages

Document Identifiers

Author Details

Ananya Appan
  • University of Illinois at Urbana Champaign, USA
Anirudh Chandramouli
  • Bar-Ilan University, Ramat Gan, Israel
Ashish Choudhury
  • International Institute of Information Technology, Bangalore, India

Cite AsGet BibTex

Ananya Appan, Anirudh Chandramouli, and Ashish Choudhury. Network Agnostic Perfectly Secure MPC Against General Adversaries. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 3:1-3:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)


In this work, we study perfectly-secure multi-party computation (MPC) against general (non-threshold) adversaries. Known protocols are secure against 𝒬^{(3)} and 𝒬^{(4)} adversary structures in a synchronous and an asynchronous network respectively. We address the existence of a single protocol which remains secure against 𝒬^{(3)} and 𝒬^{(4)} adversary structures in a synchronous and in an asynchronous network respectively, where the parties are unaware of the network type. We design the first such protocol against general adversaries. Our result generalizes the result of Appan, Chandramouli and Choudhury (PODC 2022), which presents such a protocol against threshold adversaries.

Subject Classification

ACM Subject Classification
  • Security and privacy → Information-theoretic techniques
  • Theory of computation → Distributed algorithms
  • Theory of computation → Cryptographic protocols
  • Theory of computation → Communication complexity
  • Verifiable Secret Sharing
  • Byzantine Agreement
  • Perfect Security


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. I. Abraham, D. Dolev, and J. Y. Halpern. An Almost-surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience. In PODC, pages 405-414. ACM, 2008. Google Scholar
  2. A. Appan, A. Chandramouli, and A. Choudhury. Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees. In PODC, pages 92-102. ACM, 2022. Google Scholar
  3. A. Appan, A. Chandramouli, and A. Choudhury. Revisiting the Efficiency of Asynchronous Multi Party Computation Against General Adversaries. In INDOCRYPT, volume 13774 of Lecture Notes in Computer Science, pages 223-248. Springer International Publishing, 2022. Google Scholar
  4. Ananya Appan, Anirudh Chandramouli, and Ashish Choudhury. Perfectly secure synchronous mpc with asynchronous fallback guarantees against general adversaries. Cryptology ePrint Archive, Paper 2022/1047, 2022. URL:
  5. B. Applebaum, E. Kachlon, and A. Patra. The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. In FOCS, pages 1277-1284. IEEE, 2020. Google Scholar
  6. R. Bacho, D. Collins, C. Liu-Zhang, and J. Loss. Network-Agnostic Security Comes for Free in DKG and MPC. Cryptology ePrint Archive, Paper 2022/1369, 2022. Google Scholar
  7. L. Bangalore, A. Choudhury, and A. Patra. The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited. J. ACM, 67(3):14:1-14:59, 2020. Google Scholar
  8. D. Beaver. Efficient Multiparty Protocols Using Circuit Randomization. In J. Feigenbaum, editor, CRYPTO, volume 576 of Lecture Notes in Computer Science, pages 420-432. Springer, 1991. Google Scholar
  9. M. Ben-Or, R. Canetti, and O. Goldreich. Asynchronous Secure Computation. In STOC, pages 52-61. ACM, 1993. Google Scholar
  10. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In STOC, pages 1-10. ACM, 1988. Google Scholar
  11. P. Berman, J. A. Garay, and K. J. Perry. Towards Optimal Distributed Consensus (Extended Abstract). In FOCS, pages 410-415. IEEE Computer Society, 1989. Google Scholar
  12. E. Blum, J. Katz, and J. Loss. Synchronous Consensus with Optimal Asynchronous Fallback Guarantees. In TCC, volume 11891 of Lecture Notes in Computer Science, pages 131-150. Springer, 2019. Google Scholar
  13. E. Blum, J. Katz, and J. Loss. Tardigrade: An Atomic Broadcast Protocol for Arbitrary Network Conditions. In ASIACRYPT, volume 13091 of Lecture Notes in Computer Science, pages 547-572. Springer, 2021. Google Scholar
  14. E. Blum, C. L. Zhang, and J. Loss. Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback. In CRYPTO, volume 12171 of Lecture Notes in Computer Science, pages 707-731. Springer, 2020. Google Scholar
  15. D. Chaum, C. Crépeau, and I. Damgård. Multiparty Unconditionally Secure Protocols (Extended Abstract). In STOC, pages 11-19. ACM, 1988. Google Scholar
  16. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract). In 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, USA, 21-23 October 1985, pages 383-395. IEEE Computer Society, 1985. Google Scholar
  17. A. Choudhury. Almost-Surely Terminating Asynchronous Byzantine Agreement Against General Adversaries with Optimal Resilience. In ICDCN, pages 167-176. ACM, 2023. Google Scholar
  18. A. Choudhury and N. Pappu. Perfectly-Secure Asynchronous MPC for General Adversaries (Extended Abstract). In INDOCRYPT, volume 12578 of Lecture Notes in Computer Science, pages 786-809. Springer, 2020. Google Scholar
  19. A. Choudhury and A. Patra. An Efficient Framework for Unconditionally Secure Multiparty Computation. IEEE Trans. Information Theory, 63(1):428-468, 2017. Google Scholar
  20. R. Cramer, I. Damgård, and U. M. Maurer. General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. In EUROCRYPT, volume 1807 of Lecture Notes in Computer Science, pages 316-334. Springer Verlag, 2000. Google Scholar
  21. G. Deligios, M. Hirt, and C. Liu-Zhang. Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous Fallback. In TCC, volume 13042 of Lecture Notes in Computer Science, pages 623-653. Springer, 2021. Google Scholar
  22. G. Deligios and C. Liu-Zhang. Synchronous Perfectly Secure Message Transmission with Optimal Asynchronous Fallback Guarantees. IACR Cryptol. ePrint Arch., page 1397, 2022. Google Scholar
  23. D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly Secure Message Transmission. J. ACM, 40(1):17-47, 1993. Google Scholar
  24. M. J. Fischer, N. A. Lynch, and M. Paterson. Impossibility of Distributed Consensus with One Faulty Process. J. ACM, 32(2):374-382, 1985. Google Scholar
  25. M. Fitzi and U. M. Maurer. Efficient Byzantine Agreement Secure Against General Adversaries. In DISC, volume 1499 of Lecture Notes in Computer Science, pages 134-148. Springer, 1998. Google Scholar
  26. D. Ghinea, C. Liu-Zhang, and R. Wattenhofer. Optimal Synchronous Approximate Agreement with Asynchronous Fallback. In PODC, pages 70-80. ACM, 2022. Google Scholar
  27. O. Goldreich, S. Micali, and A. Wigderson. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In A. V. Aho, editor, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA, pages 218-229. ACM, 1987. Google Scholar
  28. Martin Hirt and Ueli Maurer. Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In PODC, pages 25-34. ACM, 1997. Google Scholar
  29. Martin Hirt and Ueli Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology, 13(1):31-60, 2000. Google Scholar
  30. Martin Hirt and Daniel Tschudi. Efficient general-adversary multi-party computation. In ASIACRYPT, volume 8270 of Lecture Notes in Computer Science, pages 181-200. Springer, 2013. Google Scholar
  31. M. Ito, A. Saito, and T. Nishizeki. Secret Sharing Schemes Realizing General Access Structures). In Global Telecommunication Conference, Globecom, pages 99-102. IEEE Computer Society, 1987. Google Scholar
  32. M. V. N. Ashwin Kumar, K. Srinathan, and C. Pandu Rangan. Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries. In ACISP, volume 2384 of Lecture Notes in Computer Science, pages 497-512. Springer, 2002. Google Scholar
  33. K. Kursawe and F. C. Freiling. Byzantine Fault Tolerance on General Hybrid Adversary Structures. Technical Report, RWTH Aachen, 2005. Google Scholar
  34. U. M. Maurer. Secure Multi-party Computation Made Simple. In SCN, volume 2576 of Lecture Notes in Computer Science, pages 14-28. Springer, 2002. Google Scholar
  35. A. Momose and L. Ren. Multi-Threshold Byzantine Fault Tolerance. In CCS, pages 1686-1699. ACM, 2021. Google Scholar
  36. A. Patra and D. Ravi. On the Power of Hybrid Networks in Multi-Party Computation. IEEE Trans. Information Theory, 64(6):4207-4227, 2018. Google Scholar
  37. M. C. Pease, R. E. Shostak, and L. Lamport. Reaching Agreement in the Presence of Faults. J. ACM, 27(2):228-234, 1980. Google Scholar
  38. T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract). In STOC, pages 73-85. ACM, 1989. Google Scholar
  39. A. Shamir. How to Share a Secret. Commun. ACM, 22(11):612-613, 1979. Google Scholar
  40. A. C. Yao. Protocols for Secure Computations (Extended Abstract). In FOCS, pages 160-164. IEEE Computer Society, 1982. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail