Brief announcement: Asynchronous verifiable information dispersal with near-optimal communication. (English) Zbl 07824292
Milani, Alessia (ed.) et al., Proceedings of the 41st ACM symposium on principles of distributed computing, PODC ’22, Salerno, Italy, July 25–29, 2022. New York, NY: Association for Computing Machinery (ACM). 418-420 (2022).
Keywords:
asynchronous networks; asynchronous verifiable information dispersal; communication complexity; lower boundsReferences:
| [1] | Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, and Haibin Zhang. 2022 a. Asynchronous Verifiable Information Dispersal with Near-Optimal Communication. Cryptology ePrint Archive . |
| [2] | Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, and Haibin Zhang. 2022 b. Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation. In PODC . |
| [3] | Nicolas Alhaddad, Sisi Duan, Mayank Varia, and Haibin Zhang. 2021. Succinct Erasure Coding Proof Systems. Cryptology ePrint Archive . |
| [4] | Michael Ben-Or, Ran Canetti, and Oded Goldreich. 1993. Asynchronous secure computation. In STOC. 52-61. · Zbl 1310.68044 |
| [5] | Christian Cachin and Stefano Tessaro. 2005. Asynchronous verifiable information dispersal. In SRDS. IEEE, 191-201. |
| [6] | James Hendricks, Gregory R Ganger, and Michael K Reiter. 2007. Verifying distributed erasure-coded data. In PODC. 139-146. · Zbl 1283.68108 |
| [7] | Ari Juels and Burton S Kaliski Jr. 2007. PORs: Proofs of retrievability for large files. In CCS. 584-597. |
| [8] | Michael O Rabin. 1990. The information dispersal algorithm and its applications. In Sequences. Springer, 406-419. · Zbl 0687.68010 |
| [9] | Irving S Reed and Gustave Solomon. 1960. Polynomial codes over certain finite fields. Journal of the society for industrial and applied mathematics , Vol. 8, 2 (1960), 300-304. · Zbl 0099.34403 |
| [10] | Lei Yang, Seo Jin Park, Mohammad Alizadeh, Sreeram Kannan, and David Tse. 2022. DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks. In NSDI . |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
