Repository navigation
Closed
Labels
Description
Grades for With Honor graduation. So focus on a full scientific thesis. Graduation Fri 7 July 2023?
Brainstorm {proudly copied from Rohan issue}. Current main idea:
- Web3Trust: finding truth in a sea of misinformation
- Search algorithm: user searches for a certain hashtag, goal is to find relevant items
- Different focus, not machine learning, but trust, fraud, and spam.
- Not so simple trust-aware model: items have an association with multiple tags. Users crowd-source these associations of items and tags. Items have a certain popularity with users, influencing their relevance ranking. Finally, users have a position within the user-to-user trust graph. It is possible that the majority of users is evil and actively spreading false tags and misinformation. essence: assume the majority is evil. then solve, good luck ๐ค
- First papers to explore here: https://scholar.google.com/scholar?q=trust+framework+and+reputation
- Realise that Big Tech creates these things and never shares their tricks
- Thousands of the worlds best developers work in secret on secret algorithms to decide what is quality and what is spam, fraud, or misinformation.
- Academia is underfunded and has no deployment after 20+ years of trying. Except for Tribler obviously ๐
- ConTrib: Maintaining fairness in decentralized big tech alternatives by accounting work
- strongest possible reputation
- the pioneering 2001 paper
- Work towards something like this: Towards global Consensus on Trustย #3357 (comment)
- as early as 2001 it was published we need some sort of point system against freeriding, the Tribler lab tried to unify the idea of trust building and freeriding prevention.
- huuuge overview of trust as investigated in multi-agent community. Useful as a warning! This community explored lots mechanisms which are impossible to automate, let alone our requirement for a friction-less mechanism for building trust.
Other directions for inspiration:
- fundamentals of Web3: evolution of cooperation against monopolies, surveillance, and misinformation
- understand the German Math from the lab by an actual mathematician
- The most scientific line we have: evolution of cooperation
- Mathematical proof of something under all possible attacks
- Web3 architecture with an evolving formula to decide if agents are good or evil. (or gullible)
- possible idea: some peers helped you and helped others, you trust them more.
- Essential data structure: work graph {which agent helped another agent}
- Work graph is also subject to attacks, misreporting, lying, slandering, white washing, Sybil attacks, etc.
- Graph of trust is build up when you see helpful. Graph walks, exploration, discovery.
- Preferential treatment of most trusted peers
- Within a network of untrusted peers you discover trust vectors for trusted services.
- Alternative idea: peers with same preference for items (similarity graph)
OR
- Foundations of Web3 search with fraud, misinformation, and lawyer attacks.
- See prior work on Tag-based navigation with Web3 zero-server context by the lab from 16 years ago
- Prior federated ML work from lab
- Search algorithm: user searches for a certain tag, goal is to find relevant items
- Focus on the Web3 machine learning part.
- Define a good gradient decent approach, without sharing private info. For instance, ClickLog data.
- Overlap with msc student on learn-to-rank {not a problem, just awareness, problem big enough for team of students}
OR
- Quantification of decentralisation of Web3 and the old age of P2P
- All Web3 solutions have full central control or central servers
- Nice nostalgia assignment
- Nobody cares!
- Great formulation of {Web3} challenges by Prof. Verborgh:
Imagine a large and complex knowledge graph that cannot be stored in a single place, because of a variety of reasons
(practical, societal, legal or other). Instead, this knowledge graph is spread across multiple sources; perhaps to the
extent that every person has their own space where they store their own data. And there is no coordination of which
data is stored where, and how data is exposed. This is what we call a _decentralized knowledge graph_.
An additional complexity is that each piece of data in this graph can have different permissions associated with it:
not all data is public, and some of it can only be read or written by certain people.
OR
DAO cryptoeconomics. Warmly recommended is this cutting-edge of science stuff:
https://brian2509.github.io/test-123213/thresh-hold%20signatures/frost-implementations/
== crypto for creating an leaderless organisation scaling to billions of people and billions of treasury money.
First step: literature survey. Example from a while ago. 24 Oct target finish (start thesis 2 weeks early)
Reacted by Andrei Andreev
Activity
ThomasWerthenbach commentedon Sep 15, 2022
I have read through the existing papers, and am still of the opinion that trust in web3 is still my favorite direction. Over the last two weeks, I have spent much time looking for related work and have composed a self-use document in which all relevant papers I have read are stated and briefly summarized for later use.
The papers I have found can be divided into the following sections:
After having read the papers, I, as of now, do not know of any work where the user is capable of frictionlessly experiencing trust in web3 based on resource content alone. Many existing algorithms are based on the notion that agents can perform work for each other, and it can automatically be checked whether this work was actually performed. For resource content, the solution is not so trivial, as computers can not be trusted with automatically scanning content and determining its trustworthiness. The following methods have been proposed:
One of my own ideas (brainstorming): Use the duration spent accessing a certain resource as a metric to determine trustworthiness of a resource for a specific search query. Not much work has been performed on this method, but it does come with a few serious drawbacks:
I have more similar ideas, but they are all prone to Sybil attacks or require the notion of a 'session'.
Another thought: if we were to use a trust graph, true information might be classified as unreliable due to its distance from the user in the trust graph. Also, how does the user indicate who to trust? This can only be built dynamically if the user provides feedback on whether articles are trustworthy (AKA not friction-less)
Work document:
Literature_survey__explorate_literature_work_document.pdf
synctext commentedon Sep 15, 2022
Web3 with a trust framework for good, evil, truth, and misinformation
Web3 platform information and finance are under continuous relentless attack. We craft a future-proof architecture for trust in Web3.
We present the first first frictionless Web3 platform which autodetects trustworthiness based reports by strangers. We combine a privacy-first method for detecting content attention, peer-to-peer collaboration, explicit user feedback on misinformation, the user-to-user trust network, and use this to asses trustworthiness.
ToDo: try to make an axiomatic model of your model
Related: ATRank: An Attention-Based User Behavior Modeling Framework for Recommendation
Measurement: Youtube has deeply flawed autodetection: "The way that YouTube and a lot of platforms operate is they rely a lot of passive data collection in order to infer what your preferences are"
HN discussion on Youtube broken search; seems thesis topic "Web3 videos search" is unsolved.
Idea: to solve Sybil attacks the only thing we actually need is is "reputation staking". Users putting their own reputation on the line when claiming that a certain profile is real "I know this real person! this is not a fake identity". Instead of a social graph we have a "validity-of-personhood" graph. Mechanism to implement could be tamper-proof recording of "invite code sharing" and invite code acceptance. Could be thesis focus, dropping the tag complexity.
Social Turing Tests: Crowdsourcing Sybil Detection
synctext commentedon Sep 30, 2022
Tried to look online for you for more broader perspective on Web3 trust. This is 2019 ML stuff with theoretical grounding: Privacy Risks of Securing Machine Learning Models against Adversarial Examples.

Analyzing Federated Learning through an Adversarial Lens All by Patreek Mittal from Princeton: PAC-learning in the presence of evasion adversaries and 2022 work: Formulating Robustness Against Unforeseen Attacks
ThomasWerthenbach commentedon Sep 30, 2022
This iteration I spent mainly on reading more papers and made a start on the literature survey itself (see attached document).
I deliberately kept my approach to web3 trust somewhat broad, as we have not settled on a fixed thesis direction yet.
The current plan is to look at existing trust mechanisms and sybil defense mechanisms. It will also contain comparisons of different mechanisms and possible matches between sybil defense and trust mechanisms. Furthermore, we also define a common set of data structures to which all related works are mapped to ease comparison (e.g. we only define 1 trust graph structure to which all discussed mechanisms using trust graphs are mapped).
The idea of "reputation staking" seems very interesting. Although it makes me wonder:
The linked paper on social turing tests relies on a workforce actively checking entities, whereas we do not have such a trustworthy workforce (assume everyone is malicious).
I am not sure about the papers on ML stuff (ML is not my forte), although I could consider leaving the hardcore ML outside the scope of this thesis and work solely on trust between cluster nodes.
Take the attached document with a grain of salt, as it is merely a work document at the current stage.
Literature_survey.pdf
synctext commentedon Sep 30, 2022
[-]master thesis placeholder - ??? trust function, misinformation, novel model and algorithm, something[/-][+]master thesis placeholder - solving the online trust problem[/+]ThomasWerthenbach commentedon Oct 2, 2022
On using vouching in reputation mechanisms: I have read the document by Microsoft on their vouching mechanism. However, that work is not focused on a decentralized setting:
A possible model I thought of, which supports web3 deployment, might include the following axiomatic properties:
Some related work:
Idea: the possibility of a 'negative vouch': I am will to put some of my reputation at stake by saying that this person is not real. Although some incentive may be required for 'vouching negatively'.
ThomasWerthenbach commentedon Oct 4, 2022
Another idea. Less complex and (as far as I know) unexplored approach adopting a vouch graph:
Or, instead of the nodes that have vouched for exposed nodes having to perform the expensive task themselves:
if a node is exposed, all nodes that have vouched for this node lose their vouches.
synctext commentedon Oct 5, 2022
tip: deep analysis of why academia failed and only industry succeeded ?
Dmole commentedon Oct 13, 2022
Related; #3657
ThomasWerthenbach commentedon Oct 14, 2022
This iteration was spent mainly on (re)writing the literature survey. I have also read some more papers and plan to continue expanding on the current literature survey.
Thoughts/discussion points for next meeting:
Current progress:
Literature_survey.pdf
33 remaining items
[-]master thesis placeholder - solving the online trust problem[/-][+]master thesis placeholder - decentralised learning with security and unbounded scalability[/+]ThomasWerthenbach commentedon Apr 7, 2023
This sprint's update:
Experiment_plan
Thesis with problem description and draft structure
Other completed tasks:
Plan for next sprint:
Note: I took your advice into account to keep a single storyline and decided that we should indeed likely not focus too much novel weight relevance methods (as described in my previous sprint update).
synctext commentedon Apr 7, 2023
gossip-baseddecentralised learning has unbounded scalability?In this work, we experimentally demonstrate FoolsGoldโs inability to scale to an unbounded number of edge devices in federated learning and inept defensive capabilities against targeted poisoning attacks in decentralized learning.๐We suggest an improved version of FoolsGold, too small selling. Counter example of over-the-top arrogant selling: our algorithm provides superior performance in all known valid metrics, the original FoolsGold is degraded into a mere subcomponent of our grand vision for the future of AI.Density of 1 means that every honest node in the network is connected to an attack edge.have a classical Sybil cluster with varied amount of attack edges towards honest nodes. Epic sybil attack: 90% bad people. Trick: amount of attack edges for total system collapse (pollution success).ThomasWerthenbach commentedon Apr 28, 2023
Thesis update:
Thesis_28-04-2023.pdf
In this early draft, you can find the produced results up to now, as well as the current progress on the thesis text. Do we want to assign a upper page limit? If we are to include all information I would like to include, we will reach about 16 pages.
Other notes:
synctext commentedon Apr 28, 2023
sydle, not ideal. suggestions: SybilWall. Inspired by one of 10 ChatGPT suggestions (ShieldWall) after using prompt "what is a good name for a sybil-defence algorithm in decentralised algorithm, like Foolsgold and crum" (others: SybilShield, SybilBarrier, SybilFortress, SybilGuardian)Figure 6: Pairwise cosine similarity computation timeThese numbers are from the DAS6 high-performance compute cluster, therefore computational hardware of 1 million Euro is required to obtained these attack costs.D. The Sybil attackthis sub-section lacks the mathematical rigour of prior sub-sections.IV. THREAT MODEL AND PRELIMINARIESit actually exclusively contains 6 assumptions.In order to restrict the impact that any individual node may exercise on the network. This is a really big one. We assume the existence of an algorithm to reduce the global impact on the network of a single network address, network block, or latency-restricted geographical network attachment point.we define a parameter for SSP attacksseems more like opening text, as opposed to closure.Moreover, we integrate a probabilistic gossiping mechanism to for knowledge spreading, so you have a knowledge generator from raw info?threat model?Figure 9: Comparison of Sydle against different techniques on ฯ = 1. First compare your idea to all known algorithms, then also vary the dataset a bit.techniques on ฯ = 1feels quite artificial, drop either the 1 or 4 experiment and do a somewhat more realistic attackVII. ANALYSISone section earlier!ThomasWerthenbach commentedon May 22, 2023
This week's update:
Thesis draft
Additional remarks:
synctext commentedon May 22, 2023
In order to restrict the impact that any individual node may exercise on the network.This is a really big one. We assume the existence of an algorithm to reduce the global impact on the network of a single network address, network block, or latency-restricted geographical network attachment point.ThomasWerthenbach commentedon Jun 5, 2023
This week's update:
Thesis draft
Additional remarks:
synctext commentedon Jun 5, 2023
V. DESIGN OF SYBILWALLreadability for first-time readers is quite hard I believeA. Adopting FoolsGoldis this novel or incremental work?Sparse Sybil poisoning attack: It is conceivable that the probabilistic gossiping mechanism may be unable to disseminate knowledge to an extent that allows all attacked nodes to detect the presence of attack edges.Circular dependency for understanding. This littleIn short,requires understanding the upcoming detailed text.ThomasWerthenbach commentedon Jun 6, 2023
I have submitted the first thesis version for feedback to the thesis committee.
ThomasWerthenbach commentedon Jun 18, 2023
first version of defence presentation
synctext commentedon Jun 19, 2023
In short, SybilWall was designed to mitigate the three attack scenarios of the SSP attacktoo soon, circular dependency.ThomasWerthenbach commentedon Jun 26, 2023
Final thesis
arXiv submission