Nick Mathewson writes:
> [ text/plain ]
> Filename: 271-another-guard-selection.txt
> Title: Another algorithm for guard selection
> Author: Isis Lovecruft, George Kadianakis, Ola Bini, Nick Mathewson
> Created: 2016-07-11
> Supersedes: 259, 268
> Status: Open
>
FWIW, the development of this pr
Hi,
Nick Mathewson:
uniformly at random
What does this mean!
an adversary who had (k/N) of the network would deanonymize
F=(k/N)^2 of all circuits...
and after a given user had built C circuits, the attacker
would see them at least once with probability 1-(1-F)^C.
With large C, the attack
Filename: 271-another-guard-selection.txt
Title: Another algorithm for guard selection
Author: Isis Lovecruft, George Kadianakis, Ola Bini, Nick Mathewson
Created: 2016-07-11
Supersedes: 259, 268
Status: Open
0.0. Preliminaries
This proposal derives from proposals 259 and 268; it is meant to
