How to find and verify a trust path?
Peter Lebbing
peter at digitalbrains.com
Mon Sep 16 23:00:22 CEST 2013
On 16/09/13 22:37, Philip Jägenstedt wrote:
> Too bad. I guess one could do it by starting at the destination and
> following signatures back using a shortest path algorithm and a lot of
> requests to the keyserver, though.
Dijkstra's shortest path algorithm would amount to a breadth first search.
Keyserver operators might not like that, I dunno.
> How would an attacker create n independent paths without deceiving n people?
Errrrr..... by creating n keys and uploading them to the keyserver?
Peter.
--
I use the GNU Privacy Guard (GnuPG) in combination with Enigmail.
You can send me encrypted mail if you want some privacy.
My key is available at <http://digitalbrains.com/2012/openpgp-key-peter>
More information about the Gnupg-users
mailing list