Secure and trustable distributed aggregation based on Kademlia

Authors: Riemann, Robert and Grumbach, Stéphane

Website DOI Slides Download


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 }\backslashlandau{\backslashlog n}} for }n} peers allowing for large-scale applications.

Citation (Chicago Manual of Style 17th edition)

Riemann, Robert, and Stéphane Grumbach. 2017. “Secure and Trustable Distributed Aggregation Based on Kademlia.” In IFIP Advances in Information and Communication Technology, edited by F. Martinelli and S. De Capitani di Vimercati, 502:171–85. Rome, May 4, Rome: Springer.


  // file: 'riemann2017rome.bib'
  address = {Rome},
  author = {Riemann, Robert and Grumbach, St{\'{e}}phane},
  booktitle = {IFIP Advances in Information and Communication Technology},
  chapter = {12},
  doi = {10.1007/978-3-319-58469-0_12},
  editor = {Martinelli, F. and {De Capitani di Vimercati}, S.},
  isbn = {978-3-319-58468-3},
  keywords = {DHT,Distributed aggregation,Privacy,Trust},
  month = may,
  pages = {171--185},
  publisher = {Springer},
  title = {{Secure and trustable distributed aggregation based on Kademlia}},
  url = {},
  x-download = {},
  volume = {502},
  year = {2017},
  date = {2017-05-04},
  x-slides = {}