Byzantine Distributed Function Computation
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917949729669120 |
|---|---|
| author | Anilkumar, Hari Krishnan P. Sangwan, Neha Narayanan, Varun Prabhakaran, Vinod M. |
| author_facet | Anilkumar, Hari Krishnan P. Sangwan, Neha Narayanan, Varun Prabhakaran, Vinod M. |
| contents | We study the distributed function computation problem with $k$ users of which at most $s$ may be controlled by an adversary and characterize the set of functions of the sources the decoder can reconstruct robustly in the following sense -- if the users behave honestly, the function is recovered with high probability (w.h.p.); if they behave adversarially, w.h.p, either one of the adversarial users will be identified or the function is recovered with vanishingly small distortion. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_01522 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Byzantine Distributed Function Computation Anilkumar, Hari Krishnan P. Sangwan, Neha Narayanan, Varun Prabhakaran, Vinod M. Information Theory Cryptography and Security We study the distributed function computation problem with $k$ users of which at most $s$ may be controlled by an adversary and characterize the set of functions of the sources the decoder can reconstruct robustly in the following sense -- if the users behave honestly, the function is recovered with high probability (w.h.p.); if they behave adversarially, w.h.p, either one of the adversarial users will be identified or the function is recovered with vanishingly small distortion. |
| title | Byzantine Distributed Function Computation |
| topic | Information Theory Cryptography and Security |
| url | https://arxiv.org/abs/2503.01522 |