2017
DOI: 10.1007/978-3-319-58469-0_12
|View full text |Cite
|
Sign up to set email alerts
|

Secure and Trustable Distributed Aggregation Based on Kademlia

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 … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 23 publications
0
2
0
Order By: Relevance
“…In this system, each node has enough knowledge to be able to proceed with query routing using low-latency paths. Recent work on Kademlia has been oriented towards analyzing the resilience against failing nodes and communication channels [61] and secure and trustable distribution aggregation [57]. Viceroy [90] is another P2P system whose relevance lies on being the first P2P system to combine a constant degree with a logarithmic diameter, while still preserving fairness and minimizing congestion.…”
Section: Distributed Hash Tables In P2p Systemsmentioning
confidence: 99%
“…In this system, each node has enough knowledge to be able to proceed with query routing using low-latency paths. Recent work on Kademlia has been oriented towards analyzing the resilience against failing nodes and communication channels [61] and secure and trustable distribution aggregation [57]. Viceroy [90] is another P2P system whose relevance lies on being the first P2P system to combine a constant degree with a logarithmic diameter, while still preserving fairness and minimizing congestion.…”
Section: Distributed Hash Tables In P2p Systemsmentioning
confidence: 99%
“…However, individual nodes are solely responsible for aggregating and forwarding contributions from their respective subtrees; a single node failure can thus severely the protocol. Finally, Grumbach et al [23] use a mechanism similar to binomial swap forests with the native underlying trees of the Kademlia DHT [35]. In particular, it is the first system tackling aggregation with some Byzantine nodes.…”
Section: Tree-based Solutionsmentioning
confidence: 99%