Secure and Trustable Distributed Aggregation based on Kademlia - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Secure and Trustable Distributed Aggregation based on Kademlia

Stéphane Grumbach
Robert Riemann


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.
Fichier principal
Vignette du fichier
449885_1_En_12_Chapter.pdf (439.5 Ko) Télécharger le fichier

Dates and versions

hal-01529326 , version 1 (31-05-2017)
hal-01529326 , version 2 (08-08-2017)



Stéphane Grumbach, Robert Riemann. Secure and Trustable Distributed Aggregation based on Kademlia. 32th IFIP International Conference on ICT Systems Security and Privacy Protection (SEC), May 2017, Rome, Italy. pp.171-185, ⟨10.1007/978-3-319-58469-0_12⟩. ⟨hal-01529326v2⟩
293 View
319 Download



Gmail Facebook X LinkedIn More