{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:00:43Z","timestamp":1783576843952,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T00:00:00Z","timestamp":1636675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484808","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:27Z","timestamp":1636805127000},"page":"2705-2721","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":75,"title":["Asynchronous Data Dissemination and its Applications"],"prefix":"10.1145","author":[{"given":"Sourav","family":"Das","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhuolun","family":"Xiang","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ling","family":"Ren","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331629"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467914"},{"key":"e_1_3_2_2_3_1","unstructured":"Nicolas Alhaddad Mayank Varia and Haibin Zhang. 2021. High-Threshold AVSS with Optimal Communication Complexity. Cryptology ePrint Archive Report 2021\/118. (2021). https:\/\/eprint.iacr.org\/2021\/118."},{"key":"e_1_3_2_2_4_1","volume-title":"Cryptographers' Track at the RSA Conference","author":"Backes Michael","unstructured":"Michael Backes, Amit Datta, and Aniket Kate. 2013. Asynchronous computational VSS with reduced communication complexity. In Cryptographers' Track at the RSA Conference. Springer, 259--276."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354207"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167109"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198088"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Adithya Bhat Nibesh Shrestha Aniket Kate and Kartik Nayak. 2021. RandPiper--Reconfiguration-Friendly Random Beacons with Quadratic Communication. In (To appear) Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security .","DOI":"10.1145\/3460120.3484574"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36288-6_3"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1346796.1346799"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/647097.717005"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586124"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2005.9"},{"key":"e_1_3_2_2_17_1","unstructured":"Ran Canetti. 1996. Studies in secure multiparty computation and applications. Ph.D. Dissertation. Citeseer."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61204-1_27"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/296806.296824"},{"key":"e_1_3_2_2_21_1","volume-title":"Annual International Cryptology Conference. Springer, 89--105","author":"Chaum David","year":"1992","unstructured":"David Chaum and Torben Pryds Pedersen. 1992. Wallet databases with observers. In Annual International Cryptology Conference. Springer, 89--105."},{"key":"e_1_3_2_2_22_1","first-page":"906","article-title":"Optimally-resilient Unconditionally-secure Asynchronous Multi-party Computation Revisited","volume":"2020","author":"Choudhury Ashish","year":"2020","unstructured":"Ashish Choudhury. 2020. Optimally-resilient Unconditionally-secure Asynchronous Multi-party Computation Revisited. IACR Cryptol. ePrint Arch., Vol. 2020 (2020), 906.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_23_1","volume-title":"Irene Miriam Isaac, and Ling Ren","author":"Das Sourav","year":"2021","unstructured":"Sourav Das, Vinith Krishnan, Irene Miriam Isaac, and Ling Ren. 2021. SPURT: Scalable Distributed Randomness Beacon with Transparent Setup. Cryptology ePrint Archive, Report 2021\/100. (2021). https:\/\/eprint.iacr.org\/2021\/100."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243812"},{"key":"e_1_3_2_2_26_1","volume-title":"Conference on the theory and application of cryptographic techniques. Springer, 186--194","author":"Fiat Amos","year":"1986","unstructured":"Amos Fiat and Adi Shamir. 1986. How to prove yourself: Practical solutions to identification and signature problems. In Conference on the theory and application of cryptographic techniques. Springer, 186--194."},{"key":"e_1_3_2_2_27_1","volume-title":"Proceedings of the 1st ACM Conference on Advances in Financial Technologies. 214--228","author":"Adam Gka","year":"2019","unstructured":"Adam Gka gol, Damian Le'sniak, Damian Straszak, and Micha\u0142 'Swike tek. 2019. Aleph: Efficient atomic broadcast in asynchronous networks with byzantine nodes. In Proceedings of the 1st ACM Conference on Advances in Financial Technologies. 214--228."},{"key":"e_1_3_2_2_28_1","volume-title":"A new algorithm for decoding Reed-Solomon codes. Communications, information and network security","author":"Gao Shuhong","unstructured":"Shuhong Gao. 2003. A new algorithm for decoding Reed-Solomon codes. Communications, information and network security. Springer, 55--68."},{"key":"e_1_3_2_2_29_1","volume-title":"Efficient Asynchronous Byzantine Agreement without Private Setups. arXiv preprint arXiv:2106.07831","author":"Gao Yingzi","year":"2021","unstructured":"Yingzi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. 2021. Efficient Asynchronous Byzantine Agreement without Private Setups. arXiv preprint arXiv:2106.07831 (2021)."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417262"},{"key":"e_1_3_2_2_31_1","volume-title":"International Workshop on Selected Areas in Cryptography. Springer, 294--308","author":"Heidarvand Somayeh","year":"2008","unstructured":"Somayeh Heidarvand and Jorge L Villar. 2008. Public verifiability from pairings in secret sharing schemes. In International Workshop on Selected Areas in Cryptography. Springer, 294--308."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281122"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3423364"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354238"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405707"},{"key":"e_1_3_2_2_38_1","volume-title":"The theory of error correcting codes","author":"MacWilliams Florence Jessie","unstructured":"Florence Jessie MacWilliams and Neil James Alexander Sloane. 1977. The theory of error correcting codes. Vol. 16. Elsevier."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/358746.358762"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_2_2_41_1","volume-title":"Improved Extension Protocols for Byzantine Broadcast and Agreement. In 34th International Symposium on Distributed Computing (DISC","author":"Nayak Kartik","year":"2020","unstructured":"Kartik Nayak, Ling Ren, Elaine Shi, Nitin H Vaidya, and Zhuolun Xiang. 2020. Improved Extension Protocols for Byzantine Broadcast and Agreement. In 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_2_42_1","volume-title":"International Conference on Information Theoretic Security. Springer, 74--92","author":"Patra Arpita","year":"2009","unstructured":"Arpita Patra, Ashish Choudhary, and C Pandu Rangan. 2009. Efficient statistical asynchronous verifiable secret sharing with optimal resilience. In International Conference on Information Theoretic Security. Springer, 74--92."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-013-9172-7"},{"key":"e_1_3_2_2_44_1","volume-title":"Annual international cryptology conference","author":"Pedersen Torben Pryds","unstructured":"Torben Pryds Pedersen. 1991. Non-interactive and information-theoretic secure verifiable secret sharing. In Annual international cryptology conference. Springer, 129--140."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68339-9_33"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_2_47_1","volume-title":"WEWoRC 2005--Western European Workshop on Research in Cryptology","author":"Ruiz Alexandre","unstructured":"Alexandre Ruiz and Jorge L Villar. 2005. Publicly verifiable secret sharing from Paillier's cryptosystem. In WEWoRC 2005--Western European Workshop on Research in Cryptology. Gesellschaft f\u00fcr Informatik eV."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/646764.703956"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_2_50_1","first-page":"633","article-title":"Error correction for algebraic block codes. (Dec. 30 1986)","volume":"4","author":"Welch Lloyd R","year":"1986","unstructured":"Lloyd R Welch and Elwyn R Berlekamp. 1986. Error correction for algebraic block codes. (Dec. 30 1986). US Patent 4,633,470.","journal-title":"US Patent"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"crossref","unstructured":"Thomas Yurek Licheng Luo Jaiden Fairoze Aniket Kate and Andrew K Miller. 2021. hbACSS: How to Robustly Share Many Secrets. (2021) 159 pages.","DOI":"10.14722\/ndss.2022.23120"}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event Republic of Korea","acronym":"CCS '21","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484808","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:46:14Z","timestamp":1763498774000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":52,"alternative-id":["10.1145\/3460120.3484808","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484808","relation":{},"subject":[],"published":{"date-parts":[[2021,11,12]]},"assertion":[{"value":"2021-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}