-
Notifications
You must be signed in to change notification settings - Fork 445
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
trustworthy gossip: integrating gossip mechanisms with trust calculations #3690
Comments
IPv8/TCP (Trust Control Protocol). Game Theory direction title would be: using natural selection for the evolution of trust. Even more over-the-top: game theory of trust. illustration from done by the Prof. Nowak team at Harvard. Their Nature paper. This model is designed for population growth and wrong for trust. But perhaps it can be modified to model the growth of trust. |
A first version of the |
(posting here, as it seems the best fit for now) Any good, this related work? @qstokkink "Practical Homomorphic Encryption Over the Integers" |
@synctext not particularly. |
Gossip Overlay Security ConcernsTask DescriptionFind vulnerabilities in the Gossip overlay. Try to do the following:
Types of threatsAttacks which should be prevented:
Attacks which should be protected against (cannot be prevented):
Miscellaneous observations
|
Wireguard: related work on security, session cookies, DDoS protections and 4000 lines of beauty. Getting our layering model clear: IPv8 delivers UDP messages. Also a discovery services, bit of DHT lookup. Should it stay away from sessions and shared state? Brainstorming... |
If libtorrent channels work out, this could also be a good candidate to sync with libtorrent. |
Boostrap idea:
|
Best idea so far: Use a Polytomous Rasch model (Wikipedia) to reach a decision ( |
Title brainstorm: 'middleware for provably trustworthy information flow'.
|
Some of the relevant work: |
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
Related work called "safe gossip" by Maidsafe team, they did a badly executed, early, few million ICO. Push-pull gossip protocol. They use Scott Shenker approach from 2000.
struct Network {
pool: CpuPool,
// An mpsc channel sender for each node for giving new client messages to that node.
message_senders: Vec<mpsc::UnboundedSender<String>>,
// An mpsc channel receiver for getting the client messages and stats from the nodes.
stats_receiver: mpsc::UnboundedReceiver<(Id, Vec<String>, Statistics)>,
// The last set of client messages received via `stats_receiver` for each node.
received_messages: HashMap<Id, Vec<String>>,
// The last set of stats received via `stats_receiver` for each node.
stats: HashMap<Id, Statistics>,
// The futures for all nodes. When these return ready, that node has finished running.
node_futures: Vec<CpuFuture<(), Error>>,
// All messages sent in the order they were passed in. Tuple contains the message and the index
// of the node used to send.
client_messages: Vec<(String, usize)>,
// Message which when sent to a node via its `message_sender` indicates to the node that it
// should terminate.
termination_message: String,
} |
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
Related work: the I2P people also build a gossip overlay (they have 32k nodes). The Network-Database offers:
Floodfill is their networkDatabase update mechanism and seems vulnerable and under-documented.
Not unlike our community numbering they also have identifiers: |
Related work, also for the @alexander-stannat work. "RepuCoin: Your Reputation is Your Power". Show how to "grow" a reputation in mid-life and mature system. Quote: |
Related work:
|
Related work: |
2021 related work: BASALT: A Rock-Solid Foundation for Epidemic Consensus Algorithms in Very Large, Very Open Networks. Use also the idea of diversity to fight Sybils.
|
This thesis project explores making the connection between gossip and trust.
This work directly ties in with the mission of the lab Distributed Trust Design, see #3571. We are currently implementing incremental personalised pagerank #2805 and IPv8 distributed apps #2943.
This work shall demonstrate in 3 use-cases the linkage of IPv8 community gossip mechanism with trust calculations:
Sprint milestones:
Trustworthy_Gossip(suppress,delete,store,collect,spread)
Our #10 operational prototype from 2009 and 2013. Uses random graph walk:
The text was updated successfully, but these errors were encountered: