3 research outputs found
A Probabilistic Analysis of Kademlia Networks
Kademlia 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 does it take to locate a node in the
network? To answer it, we introduce a random graph K and study how many steps
are needed to locate a given vertex in K using Kademlia's algorithm, which we
call the routing time. Two slightly different versions of K are studied. In the
first one, vertices of K are labelled with fixed IDs. In the second one,
vertices are assumed to have randomly selected IDs. In both cases, we show that
the routing time is about c*log(n), where n is the number of nodes in the
network and c is an explicitly described constant.Comment: ISAAC 201
Distributed Random Process for a Large-Scale Peer-to-Peer Lottery
Most online lotteries today fail to ensure the verifiability of the random
process and rely on a trusted third party. This issue has received little
attention since the emergence of distributed protocols like Bitcoin that
demonstrated the potential of protocols with no trusted third party. We argue
that the security requirements of online lotteries are similar to those of
online voting, and propose a novel distributed online lottery protocol that
applies techniques developed for voting applications to an existing lottery
protocol. As a result, the protocol is scalable, provides efficient
verification of the random process and does not rely on a trusted third party
nor on assumptions of bounded computational resources. An early prototype
confirms the feasibility of our approach