What’s the scuttlebutt on Secure Gossip ?. Robbert van Renesse. Secure Gossip or Gossip for Security?. Secure gossip: making sure probabilistic guarantees hold in the face of malicious behavior
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
What’s the scuttlebutt on Secure Gossip?
Robbert van Renesse
movement from former to latter?
But there’s always public key signatures…
(See RFC3092 for FOOBAR origins)
Erdös & Rényi: if probability of link is high enough, graph will be connected with high probability
Chung & Lu: such a graph will have logarithmic diameter
k chosen such that correct members form a connected graph with high probability
But what about crashed members???
With probabilistic real-time bounds…
Accuse and rebut
Monitor and suspect
EACH COMPONENT IS
(Answer: we don’t have to)
2t + 1 rings:
Each member can only accuse its 2t + 1 successors
t chosen such that each member has no more than t Byzantine predecessors whp
t + 1 rings enabled
t rings disabled
Recursive relation (without base case) complicates correctness proof…
Fireflies have on/off behavior and use mimicry to dupe and devour related species…
Large enough so that the probability of having more than t Byzantine predecessors is smaller than
E(problem) = 1
Disclaimer: PlanetLab results are not repeatable and biased