Skip to Main content Skip to Navigation
Conference papers

Secure and Trustable Distributed Aggregation based on Kademlia

Robert Riemann 1, 2 Stéphane Grumbach 1, 2
2 DICE - Data on the Internet at the Core of the Economy
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
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.
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Robert Riemann Connect in order to contact the contributor
Submitted on : Wednesday, May 31, 2017 - 10:07:00 PM
Last modification on : Wednesday, July 8, 2020 - 12:43:27 PM
Long-term archiving on: : Wednesday, September 6, 2017 - 1:50:19 PM


Files produced by the author(s)



Robert Riemann, Stéphane Grumbach. Secure and Trustable Distributed Aggregation based on Kademlia. ICT Systems Security and Privacy Protection: 32nd IFIP TC 11 International Conference, May 2017, Rome, Italy. pp.171-185, ⟨10.1007/978-3-319-58469-0_12⟩. ⟨hal-01529326v1⟩



Record views


Files downloads