Secure and Trustable Distributed Aggregation based on Kademlia
This addresses secure aggregation for applications like voting protocols, though it appears incremental as it adapts existing Kademlia infrastructure.
The paper tackles the problem of confidential and robust distributed aggregation by proposing an algorithm based on Kademlia DHT, which ensures high confidentiality through pseudonymous peer communication and limits data breaches via distribution. Experimental results show O(n) complexity for n peers, enabling large-scale applications.
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.