Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings

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

doi:10.1145/3732772.3733526

Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings

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

Indian Institute of Technology Madras
University of Victoria BC
Weizmann Institute of Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 (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 maximum number of bits queried by any one peer ("query complexity"). We achieve optimal query complexity in a synchronous fully connected network with resilience to any constant fraction β < 1 of Byzantine peers, under varying assumptions regarding time and message size.A full version of the paper is available at [2].

Original language	English
Title of host publication	PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing
Publisher	Association for Computing Machinery
Pages	166-168
Number of pages	3
ISBN (Electronic)	9798400718854
DOIs	https://doi.org/10.1145/3732772.3733526
State	Published - 13 Jun 2025
Externally published	Yes
Event	44th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2025 - Huatulco, Mexico Duration: 16 Jun 2025 → 20 Jun 2025

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
Volume	Part of F216205

Conference

Conference	44th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2025
Country/Territory	Mexico
City	Huatulco
Period	16/06/25 → 20/06/25

Bibliographical note

Publisher Copyright:
© 2025 Copyright held by the owner/author(s).

Keywords

blockchain oracle
byzantine fault tolerance
data retrieval model
distributed download

Access to Document

10.1145/3732772.3733526

Cite this

Augustine, J., Chatterjee, S., King, V., Kumar, M., Meir, S., & Peleg, D. (2025). Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings. In PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing (pp. 166-168). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; Vol. Part of F216205). Association for Computing Machinery. https://doi.org/10.1145/3732772.3733526

Augustine, John ; Chatterjee, Soumyottam ; King, Valerie et al. / Brief Announcement : Distributed Download from an External Data Source in Byzantine Majority Settings. PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2025. pp. 166-168 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

@inproceedings{d59cbb11a7384dafa337506e81582973,

title = "Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings",

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 (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 maximum number of bits queried by any one peer ({"}query complexity{"}). We achieve optimal query complexity in a synchronous fully connected network with resilience to any constant fraction β < 1 of Byzantine peers, under varying assumptions regarding time and message size.A full version of the paper is available at [2].",

keywords = "blockchain oracle, byzantine fault tolerance, data retrieval model, distributed download",

author = "John Augustine and Soumyottam Chatterjee and Valerie King and Manish Kumar and Shachar Meir and David Peleg",

note = "Publisher Copyright: {\textcopyright} 2025 Copyright held by the owner/author(s).; 44th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2025 ; Conference date: 16-06-2025 Through 20-06-2025",

year = "2025",

month = jun,

day = "13",

doi = "10.1145/3732772.3733526",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "166--168",

booktitle = "PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing",

}

Augustine, J, Chatterjee, S, King, V, Kumar, M, Meir, S & Peleg, D 2025, Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings. in PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, vol. Part of F216205, Association for Computing Machinery, pp. 166-168, 44th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2025, Huatulco, Mexico, 16/06/25. https://doi.org/10.1145/3732772.3733526

Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings. / Augustine, John; Chatterjee, Soumyottam; King, Valerie et al.
PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2025. p. 166-168 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; Vol. Part of F216205).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Brief Announcement

T2 - 44th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2025

AU - Augustine, John

AU - Chatterjee, Soumyottam

AU - King, Valerie

AU - Kumar, Manish

AU - Meir, Shachar

AU - Peleg, David

PY - 2025/6/13

Y1 - 2025/6/13

N2 - 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 (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 maximum number of bits queried by any one peer ("query complexity"). We achieve optimal query complexity in a synchronous fully connected network with resilience to any constant fraction β < 1 of Byzantine peers, under varying assumptions regarding time and message size.A full version of the paper is available at [2].

AB - 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 (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 maximum number of bits queried by any one peer ("query complexity"). We achieve optimal query complexity in a synchronous fully connected network with resilience to any constant fraction β < 1 of Byzantine peers, under varying assumptions regarding time and message size.A full version of the paper is available at [2].

KW - blockchain oracle

KW - byzantine fault tolerance

KW - data retrieval model

KW - distributed download

UR - https://www.scopus.com/pages/publications/105026963326

U2 - 10.1145/3732772.3733526

DO - 10.1145/3732772.3733526

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:105026963326

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 166

EP - 168

BT - PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

Y2 - 16 June 2025 through 20 June 2025

ER -

Augustine J, Chatterjee S, King V, Kumar M, Meir S, Peleg D. Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings. In PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery. 2025. p. 166-168. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). doi: 10.1145/3732772.3733526

Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this