Secure and Trustable Distributed Aggregation based on Kademlia
St\'ephane Grumbach (DICE), Robert Riemann (DICE)

TL;DR
This paper introduces a secure, trustable distributed aggregation algorithm leveraging Kademlia DHT for confidentiality and robustness, suitable for large-scale applications like voting, with proven linear complexity.
Contribution
It presents a novel aggregation method based on Kademlia that enhances confidentiality and trustworthiness without solely relying on cryptography.
Findings
Complexity is O(n) for n peers, enabling large-scale deployment.
Supports a wide range of applications including complex voting protocols.
Reduces data breach risks through data and computation distribution.
Abstract
Aggregation of values that need to be kept confidential while guaranteeing the robustness of the process and the correctness of the result is required in an increasing number of applications. We propose an aggregation algorithm, which supports a large spectrum of potential applications including complex voting protocols. It relies on the distributed hash table Kademlia, used in BitTorrent, for pseudonymous communication between randomly predetermined peers to ensure a high degree of confidentiality which does not solely relies on cryptography. The distribution of data and computation limits the potential for data breaches, and reduces the need for institutional trust. Experimental results confirm the complexity of O(n) for n peers allowing for large-scale applications.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
