Secure and Trustable Distributed Aggregation Based on Kademlia

@inproceedings{Grumbach2017SecureAT,
  title={Secure and Trustable Distributed Aggregation Based on Kademlia},
  author={St{\'e}phane Grumbach and Robert Riemann},
  booktitle={SEC},
  year={2017}
}
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… 
Towards Trustworthy Online Voting: Distributed Aggregation of Confidential Data. (Confiance dans le vote en ligne : Agrégation distribuée de données confidentielles)
TLDR
The ambition of this thesis is to reduce the need for trust in both authorities and technology and explore methods for large-scale data aggregations, that ensure a high degree of confidentiality and rely neither on trusted third parties nor solely on cryptography.
Distributed Random Process for a Large-Scale Peer-to-Peer Lottery
TLDR
It is argued that the security requirements of online lotteries are similar to those of online voting, and a novel distributed online lottery protocol is proposed that applies techniques developed for voting applications to an existing lottery protocol that does not rely on a trusted third party nor on assumptions of bounded computational resources.
Distributed Random Process for a Large-Scale Peer-to-Peer Lottery
TLDR
It is argued that the security requirements of online lotteries are similar to those of online voting, and a novel distributed online lottery protocol is proposed that applies techniques developed for voting applications to an existing lottery protocol that does not rely on a trusted third party nor on assumptions of bounded computational resources.
Handel: Practical Multi-Signature Aggregation for Large Byzantine Committees
TLDR
Handel, a Byzantine fault tolerant aggregation protocol that allows for the quick aggregation of cryptographic signatures over a WAN, is presented, as an open source Go library with a flexible design to support any associative and commutative aggregation function.
Intelligent query processing in P2P networks: Semantic issues and routing algorithms
TLDR
This article examines the main existing algorithms for query routing in unstructured P2P networks in which semantic aspects play a major role, associated with a taxonomy of P1P networks based on their degree of decentralization and the different approaches adopted to exploit the available semantic aspects.

References

SHOWING 1-10 OF 25 REFERENCES
S/Kademlia: A practicable approach towards secure key-based routing
  • I. Baumgart, S. Mies
  • Computer Science
    2007 International Conference on Parallel and Distributed Systems
  • 2007
TLDR
A secure key-based routing protocol based on Kademlia that has a high resilience against common attacks by using parallel lookups over multiple disjoint paths, limiting free nodeld generation with crypto puzzles and introducing a reliable sibling broadcast is introduced.
Scalable and Secure Aggregation in Distributed Networks
TLDR
This work presents a distributed protocol that requires only a communication complexity of $O(n\log^3 n)$, which it is proved is near-optimal and ensures perfect security against a computationally-bounded adversary.
Efficient and Decentralized Polling Protocol for General Social Networks
TLDR
A family of social graphs that satisfy what is called the m-broadcasting property where m is not greater than the minimum node degree are defined and show their structures enable low communication cost and constitute necessary and sufficient condition to ensure vote privacy and limit the impact of dishonest users on the accuracy of the polling output.
Scalable and Secure Polling in Dynamic Distributed Networks
TLDR
SPP (Secure and Private Polling), the first distributed polling protocol requiring only a communication complexity of O(n log3 n), is presented, which is proved is near-optimal and ensures perfect security against a computationally-bounded adversary.
DECA: A Hierarchical Framework for DECentralized Aggregation in DHTs
TLDR
This paper presents an aggregation protocol that fuses the fault-resilience of gossip algorithms with the scalability of trees and simulation results show that this algorithm is capable to cope with the distributed and unreliable nature of P2P networks.
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
TLDR
This paper shows that a widely used dlog-based DKG protocol suggested by Pedersen does not guarantee a uniformly random distribution of generated keys, and presents a new protocol which proves to satisfy the security requirements from DKG protocols and ensures a uniform distribution of the generated keys.
Bitcoin: A Peer-to-Peer Electronic Cash System
TLDR
This work proposes a solution to the double-spending problem using a peer-to-peer network, where the network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof- of-work.
Decentralized polling with respectable participants
A Probabilistic Analysis of Kademlia Networks
Kademlia [3] is currently the most widely used searching algorithm in p2p (peer-to-peer) networks. This work studies an essential question about Kademlia from a mathematical perspective: how long
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
TLDR
A peer-to-peer distributed hash table with provable consistency and performance in a fault-prone environment is described using a novel XOR-based metric topology that simplifies the algorithm and facilitates the proof.
...
...