diff options
| author | Giulia Fanti <g.fanti@gmail.com> | 2018-08-14 00:40:40 -0400 |
|---|---|---|
| committer | Andrew Miller <socrates1024@gmail.com> | 2018-08-14 08:21:41 -0500 |
| commit | dfd59bb6cc6f4a939e626103e3c5e1a8b1036105 (patch) | |
| tree | 7a0838d828a6f47790b1d8b80edffe35b403bf05 /bip-0156.mediawiki | |
| parent | 9050ba70921532b4f64ccfde2f119f7f10fcb23c (diff) | |
rename figure filenames
Diffstat (limited to 'bip-0156.mediawiki')
| -rw-r--r-- | bip-0156.mediawiki | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/bip-0156.mediawiki b/bip-0156.mediawiki index 3ecdfbb..dde928a 100644 --- a/bip-0156.mediawiki +++ b/bip-0156.mediawiki @@ -66,7 +66,7 @@ Next, transactions are forwarded along this privacy graph during the "stem phase." Finally, messages are broadcast to the network during the "fluff phase" using the typical method of diffusion. -[[File:bip-dandelion/1-dandelion.png|framed|center|alt=An illustration of Dandelion routing|Figure 1]] +[[File:bip-0156/1-dandelion.png|framed|center|alt=An illustration of Dandelion routing|Figure 1]] Figure 1 In order to select the privacy graph in a decentralized manner, each node @@ -94,7 +94,7 @@ fingerprint attack allowing network-level botnet adversaries to achieve total deanonymization of the P2P network after observing less than ten transactions per node. -[[File:bip-dandelion/2-attack.png|framed|center|alt=An illustration of a fingerprint attack|Figure 2]] +[[File:bip-0156/2-attack.png|framed|center|alt=An illustration of a fingerprint attack|Figure 2]] Figure 2 During a fingerprint attack, a botnet-style adversary with knowledge of the @@ -104,7 +104,7 @@ attack, the adversary collects transactions at its spy nodes and matches these observations to the simulated fingerprints. Our simulations have shown that this attack results in devastating, network-wide deanonymization. -[[File:bip-dandelion/3-attack-plot.png|framed|center|alt=A plot illustrating total deanonymization|Figure 3]] +[[File:bip-0156/3-attack-plot.png|framed|center|alt=A plot illustrating total deanonymization|Figure 3]] Figure 3 To avoid this issue, we suggest "per-inbound-edge" routing. Each inbound peer is @@ -123,7 +123,7 @@ words, adversary knowledge is limited to the case of one observed message rather than a rich profile of multiple transaction paths. Dandelion also breaks the symmetry of diffusion, making the source of the transaction difficult to infer. -[[File:bip-dandelion/4-dandelion-plot.png|framed|center|alt=A plot illustrating limited deanonymization|Figure 4]] +[[File:bip-0156/4-dandelion-plot.png|framed|center|alt=A plot illustrating limited deanonymization|Figure 4]] Figure 4 After a transaction has traveled along a Dandelion stem for a random number of @@ -280,10 +280,10 @@ referencing Dandelion transactions. ==Implementation== A reference implementation is available at the following URL: -https://github.com/mablem8/bitcoin/tree/dandelion-feature-commits +https://github.com/dandelion-org/bitcoin/tree/dandelion-feature-commits All features have been compressed into a single commit at the following URL: -https://github.com/mablem8/bitcoin/tree/dandelion +https://github.com/dandelion-org/bitcoin/tree/dandelion ==Compatibility== |