Document Open Access Logo

Distributed Download from an External Data Source in Byzantine Majority Settings

Authors John Augustine , Soumyottam Chatterjee , Valerie King , Manish Kumar , Shachar Meir , David Peleg

PDF

File

Thumbnail PDF
PDF
LIPIcs.DISC.2025.9.pdf
  • Filesize: 0.94 MB
  • 22 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • Byzantine Fault Tolerance
  • Blockchain Oracle
  • Data Retrieval Model
  • Distributed Download

Metrics

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

Abstract

We consider the Download problem in the Data Retrieval Model, introduced in DISC'24, where a distributed set of peers, some of which may be Byzantine, seek to learn n bits of data stored at a trustworthy external data source. Each bit of data can be learned by a peer either through a direct and costly query of the source or through other peers that have already learned it; the goal is to design a collaborative protocol that reduces the query complexity defined as the maximum number of bits queried by any honest peer.
We begin with a randomized protocol for the Download problem that achieves optimal query complexity, up to a logarithmic factor. For a stronger "dynamic" adversary that can change the set of Byzantine peers from one round to the next, we achieve optimality (within log factors) for both query complexity (in expectation) and time complexity, but with larger messages. In broadcast communication, where all peers (including Byzantine peers) are required to send the same message to all peers, we achieve (up to log factors) an optimal trade-off between query complexity, time complexity, and message size with the dynamic adversary. All of our protocols can tolerate any constant fraction β < 1 of Byzantine peers.

Cite As Get BibTex

John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, and David Peleg. Distributed Download from an External Data Source in Byzantine Majority Settings. In 39th International Symposium on Distributed Computing (DISC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 356, pp. 9:1-9:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.DISC.2025.9

Author Details

John Augustine
  • Indian Institute of Technology Madras, India
Soumyottam Chatterjee
  • CISPA Helmholtz Center for Information Security, Saarbrückem, Germany
Valerie King
  • University of Victoria, Canada
Manish Kumar
  • Indian Institute of Technology Madras, India
Shachar Meir
  • Weizmann Institute of Science, Rehovot, Israel
David Peleg
  • Weizmann Institute of Science, Rehovot, Israel

Funding

  • Augustine, John: Supported by the Centre for Cybersecurity, Trust and Reliability (CyStar), IIT Madras.
  • Chatterjee, Soumyottam: Work done while at IIT Madras, supported by the Centre for Cybersecurity, Trust and Reliability (CyStar), IIT Madras.
  • Kumar, Manish: Supported by the Centre for Cybersecurity, Trust and Reliability (CyStar), IIT Madras.
  • Peleg, David: Venky Harinarayanan and Anand Rajaraman Visiting Chair Professor. The funds from this professorship enabled exchange visits between IIT Madras, India, and the Weizmann Institute of Science, Israel.

References

  1. N. Alhaddad, S. Das, S. Duan, L. Ren, M. Varia, Z. Xiang, and H. Zhang. Balanced byzantine reliable broadcast with near-optimal communication and improved computation. In Proc. ACM Symp. on Principles of Distributed Computing, pages 399-417, 2022. Google Scholar
  2. N. Alon, B. Awerbuch, Y. Azar, and B. Patt-Shamir. Tell me who I am: An interactive recommendation system. Theory Comput. Syst., 45:261-279, 2009. URL: https://doi.org/10.1007/S00224-008-9100-7.
  3. H. Attiya and J. Welch. Distributed computing: fundamentals, simulations, and advanced topics. Wiley, 2004. Google Scholar
  4. J. Augustine, J. Biju, S. Meir, D. Peleg, S. Ramachandran, and A. Thiruvengadam. Byzantine Resilient Distributed Computing on External Data. In 38th Symp. on Distributed Computing (DISC), pages 3:1-3:23, 2024. Google Scholar
  5. J. Augustine, S. Chatterjee, V. King, M. Kumar, S. Meir, and D. Peleg. Distributed download from an external data source in faulty majority settings. CoRR, abs/2412.19649, 2024. URL: https://doi.org/10.48550/arXiv.2412.19649.
  6. J. Augustine, S. Chatterjee, V. King, M. Kumar, S. Meir, and D. Peleg. Brief Announcement: Distributed Download from an External Data Source in Asynchronous faulty settings. In DISC, 2025. These proceedings. Google Scholar
  7. B. Awerbuch, Y. Azar, Z. Lotker, B. Patt-Shamir, and M. R. Tuttle. Collaborate with strangers to find own preferences. Theory Comput. Syst., 42:27-41, 2008. URL: https://doi.org/10.1007/S00224-007-9016-7.
  8. B. Awerbuch, A. Nisgav, and B. Patt-Shamir. Asynchronous active recommendation systems. In Proc. 11th Conf. on Principles of Distributed Systems OPODIS 2007, pages 48-61, 2007. Google Scholar
  9. G. Bracha. Asynchronous byzantine agreement protocols. Inf. & Computat., 75:130-143, 1987. URL: https://doi.org/10.1016/0890-5401(87)90054-X.
  10. L. Breidenbach, C. Cachin, A. Coventry, A. Juels, and A. Miller. Chainlink off-chain reporting protocol. Technical report, Chainlink Labs, 2021. Google Scholar
  11. A.Z. Broder and D. Dolev. Flipping coins in many pockets (byzantine agreement on uniformly random values). In 25th Symp. on Foundations of Computer Science, pages 157-170, 1984. Google Scholar
  12. M. Castro and B. Liskov. Practical byzantine fault tolerance. In 3rd Symp. on Operating Systems Design and Implementation, OSDI, pages 173-186. USENIX Assoc., 1999. Google Scholar
  13. P. Chakka, S. Joshi, A. Kate, J. Tobkin, and D. Yang. DORA: distributed oracle agreement with simple majority. CoRR, abs/2305.03903, 2023. URL: https://doi.org/10.48550/arXiv.2305.03903.
  14. D. Dolev and H. R. Strong. Authenticated algorithms for byzantine agreement. SIAM J. Computing, 12(4):656-666, 1983. URL: https://doi.org/10.1137/0212045.
  15. Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti Rad, and Morteza Zadimoghaddam. Collaborative scoring with dishonest participants. In Proceedings of the Twenty-Second Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '10, pages 41-49, New York, NY, USA, 2010. Association for Computing Machinery. URL: https://doi.org/10.1145/1810479.1810488.
  16. R. Impagliazzo and R. Williams. Communication complexity with synchronized clocks. In 25th IEEE Conf. on Computational Complexity, pages 259-269, 2010. Google Scholar
  17. L. Lamport. The part-time parliament. ACM Trans. Comput. Syst., 16:133-169, 1998. URL: https://doi.org/10.1145/279227.279229.
  18. L. Lamport, R. Shostak, and M. Pease. The byzantine generals problem. ACM Trans. Program. Lang. Syst., 4:382-401, July 1982. URL: https://doi.org/10.1145/357172.357176.
  19. L. Lamport, R. Shostak, and M. Pease. The byzantine generals problem. ACM Trans. Program. Lang. Syst., 4:382-401, 1982. URL: https://doi.org/10.1145/357172.357176.
  20. S. Micali and T. Rabin. Collective coin tossing without assumptions nor broadcasting. In CRYPTO, pages 253-266, 1991. Google Scholar
  21. A. Nisgav and B. Patt-Shamir. Finding similar users in social networks. Theor. Comp. Sys., 49:720-737, 2011. URL: https://doi.org/10.1007/S00224-010-9307-2.
  22. A. Nisgav and B. Patt-Shamir. Improved collaborative filtering. In 22nd ISAAC, pages 425-434, 2011. Google Scholar
  23. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228-234, April 1980. URL: https://doi.org/10.1145/322186.322188.
  24. M. O. Rabin. Randomized byzantine generals. In 24th FOCS, pages 403-409, 1983. 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