Zero knowledge protocols and metadata resistant decentralised networks

[gpestana]

How can zero proof knowledge protocols help building metadata resistant and decentralised communication protocols?

[gpestana]

literature

• [ ] Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture (zk-SNARKS) paper

• [ ] Quadratic Span Programs and Succinct NIZKs without PCPs paper

• [ ] Simple verifiable protocol write up of a simple verifiable non-interactive zero-knowledge (NIZK) protocol for computational execution verification that only requires symmetric crypto txt-link

• [ ] MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions the work presents a XOR-homomorphic commitment scheme based on oblivious transfer, that can be use to cope with the problem of connecting the gates in the LEGO construction. paper

• [x] Routing in the Dark: Pitch Black shows how the Freenet darknet routing algorithm for decentralised restricted-routing topologies (e.g. friend-2-friend) can be attacked by low-resourced attackers, which may lead to severe damage of network content availability. paper, dissertation summary and notes

[gpestana]

in practice

1. mitigate the freenet swapping protocol attack: the Freenet swapping protocol for improving routing performance of restricted-routing DHT topologies is vulnerable to attacking nodes that lie about their neighbours and their existence. could a 0k protocol help mitigating this attack?

the problem: swapping protocol attack on friend-to-friend routing algorithm

ideas/notes:

• the protocol can be interactive (prover is in contact and interacting with verifier)
• while verification performance is important, it is not critical. the topology structure will take longer with a 0k protocol verification, but its upside - mitigating the attack - pays off.