Document Open Access Logo

Brief Announcement: Single-Round Broadcast: Impossibility, Feasibility, and More

Authors Zhelei Zhou , Bingsheng Zhang , Hong-Sheng Zhou , Kui Ren

PDF

File

Thumbnail PDF
PDF
LIPIcs.DISC.2025.66.pdf
  • Filesize: 0.98 MB
  • 7 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Security and privacy → Cryptography
  • Computing methodologies → Distributed algorithms
Keywords
  • Broadcast
  • Security with abort
  • Round optimality

Metrics

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

Abstract

Broadcast is a fundamental primitive that plays an important role in secure Multi-Party Computation (MPC) area. In this work, we revisit the broadcast with selective abort (hereafter, short for broadcast) proposed by Goldwasser and Lindell (DISC 2002; JoC 2005) and study the round complexity of broadcast under different setup assumptions. Our findings are summarized as follows:  
- We formally prove that 1-round broadcast is impossible under various widely-used setup assumptions (e.g., plain model, random oracle model, and common reference string model, etc.), even if we consider the static security and the stand-alone framework. More concretely, we formalize a notion called consistent oracle to capture these setups, and prove that our impossibility holds under the consistent oracle. Our impossibility holds in both honest majority setting and dishonest majority setting.
- We show that 1-round broadcast protocol is possible in the Universal Composition (UC) framework, by assuming stateful trusted hardwares. Our protocol can be proven secure against all-but-one adaptive and malicious corruptions. We bypass our impossibility result since our stateful trusted hardwares do not satisfy the definition of consistent oracle.
- We provide an application of 1-round broadcast: we construct the first 1-round multiple-verifier zero-knowledge (which is a special case of MPC) protocol, without assuming the broadcast hybrid world.

Cite As Get BibTex

Zhelei Zhou, Bingsheng Zhang, Hong-Sheng Zhou, and Kui Ren. Brief Announcement: Single-Round Broadcast: Impossibility, Feasibility, and More. In 39th International Symposium on Distributed Computing (DISC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 356, pp. 66:1-66:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.DISC.2025.66

Author Details

Zhelei Zhou
  • Zhejiang University, Hangzhou, China
Bingsheng Zhang
  • Zhejiang University, Hangzhou, China
Hong-Sheng Zhou
  • Virginia Commonwealth University, Richmond, VA, USA
Kui Ren
  • Zhejiang University, Hangzhou, China

Funding

  • Zhang, Bingsheng: Supported by the National Natural Science Foundation of China (Grant No. 62232002) and Input Output (iohk.io).
  • Zhou, Hong-Sheng: Supported in part by NSF grant CNS-1801470 and a VCU Research Quest grant.

References

  1. Prabhanjan Ananth, Arka Rai Choudhuri, and Abhishek Jain. A new approach to round-optimal secure multiparty computation. In CRYPTO 2017. Google Scholar
  2. Benny Applebaum, Eliran Kachlon, and Arpita Patra. Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: Trading NIZKs with honest majority - (extended abstract). In CRYPTO 2022. Google Scholar
  3. Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain Yael Tauman Kalai, Dakshita Khurana, and Amit Sahai. Promise zero knowledge and its applications to round optimal MPC. In CRYPTO 2018. Google Scholar
  4. Mihir Bellare and Silvio Micali. Non-interactive oblivious transfer and applications. In CRYPTO 1989. Google Scholar
  5. Elette Boyle, Niv Gilboa, Yuval Ishai, and Ariel Nof. Sublinear GMW-style compiler for MPC with preprocessing. In CRYPTO 2021. Google Scholar
  6. Zvika Brakerski, Shai Halevi, and Antigoni Polychroniadou. Four round secure computation without setup. In TCC 2017. Google Scholar
  7. Mike Burmester and Yvo Desmedt. Broadcast interactive proofs (extended abstract). In EUROCRYPT 1991. Google Scholar
  8. Ran Canetti. Security and composition of multiparty cryptographic protocols. In Journal of Cryptology 2000. Google Scholar
  9. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In FOCS 2001. Google Scholar
  10. Ran Canetti, Yevgeniy Dodis, Rafael Pass, and Shabsi Walfish. Universally composable security with global setup. In TCC 2007. Google Scholar
  11. Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, and Rafail Ostrovsky. Round optimal secure multiparty computation from minimal assumptions. In TCC 2020. Google Scholar
  12. Michele Ciampi, Divya Ravi, Luisa Siniscalchi, and Hendrik Waldner. Round-optimal multi-party computation with identifiable abort. In EUROCRYPT 2022. Google Scholar
  13. Ivan Damgård, Valerio Pastro, Nigel P. Smart, and Sarah Zakarias. Multiparty computation from somewhat homomorphic encryption. In CRYPTO 2012. Google Scholar
  14. Yevgeniy Dodis, Victor Shoup, and Shabsi Walfish. Efficient constructions of composable commitments and zero-knowledge proofs. In CRYPTO 2008. Google Scholar
  15. Oded Goldreich. Foundations of cryptography, volume 2. Google Scholar
  16. Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or A completeness theorem for protocols with honest majority. In STOC 1987. Google Scholar
  17. Shafi Goldwasser and Yehuda Lindell. Secure computation without agreement. In DISC 2002. Google Scholar
  18. Shafi Goldwasser and Yehuda Lindell. Secure multi-party computation without agreement. In Journal of Cryptology 2005. Google Scholar
  19. Dennis Hofheinz, Jörn Müller-Quade, and Dominique Unruh. Universally composable zero-knowledge arguments and commitments from signature cards. In Central European Conference on Cryptology 2005. Google Scholar
  20. Yuval Ishai, Dakshita Khurana, Amit Sahai, and Akshayaram Srinivasan. On the round complexity of black-box secure MPC. In CRYPTO 2021. Google Scholar
  21. Yuval Ishai, Dakshita Khurana, Amit Sahai, and Akshayaram Srinivasan. Round-optimal black-box MPC in the plain model. In CRYPTO 2023. Google Scholar
  22. Jonathan Katz, Ueli Maurer, Björn Tackmann, and Vassilis Zikas. Universally composable synchronous computation. In TCC 2013. Google Scholar
  23. Leslie Lamport, Robert E. Shostak, and Marshall C. Pease. The byzantine generals problem. In ACM Trans. Program. Lang. Syst. 1982. Google Scholar
  24. Matt Lepinski, Silvio Micali, and Abhi Shelat. Fair-zero knowledge. In TCC 2005. Google Scholar
  25. Tal Rabin and Michael Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In STOC 1989. Google Scholar
  26. Andrew Chi-Chih Yao. Protocols for secure computations (extended abstract). In FOCS 1982. Google Scholar
  27. Zhelei Zhou, Bingsheng Zhang, Hong-Sheng Zhou, and Kui Ren. Single-input functionality against a dishonest majority: Practical and round-optimal. In PKC 2025. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact