[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
-----BEGIN PGP SIGNED MESSAGE-----
At 02:25 AM 12/9/97 -0200, Ed Gerck wrote:
>-> That closes the loop.
>A loop can only be closed between like quantities.
>Here, you are equating apples (trust relationships of the root-keys with
>each other and with the issuer) with speedboats (trust relationships of
>the root-keys with the verifier, by itself), so there is no "loop of
it's apparent that we're using different English dictionaries in this
discussion. I doubt it's worth continuing this discussion, as long as our
Weltanschauungen remain so different.
To me, there are not apples and speedboats. Rather, there is authorization
which is injected by the verifier into a so-called root key and passed
from that root key through certificates, possibly constrained or restricted,
into the eventual request where it is delivered to the verifier as part of a
request for some kind of action. This model of trust computation fits all
known certification examples. Even though it is foreign to X.509 thinking,
in particular, it applies to X.509. The authorization in this example flows
in a loop (circuit) from verifier back to verifier. To use an electical
example, the verifier has both battery and ammeter.
-----BEGIN PGP SIGNATURE-----
Version: PGP for Personal Privacy 5.5.3
-----END PGP SIGNATURE-----
- No Subject
- From: Ed Gerck <firstname.lastname@example.org>