Re: Official Debian digital 'branding' of debs
>>"Nicolás" == Nicolás Lichtmaier <firstname.lastname@example.org> writes:
Nicolás> If someone hacked where the sec-ring would be stored, he
Nicolás> would be able to do anything to the distribution
Not if the keyring had a detatched signature from the master key.
Nicolás> anyway. There's always a single point of failure.
Yes. But we can make the singke point f failure much, much,
harder to exploit. And publicize that single point, and blast any
compromise across the net.
Just because there always is a single point of failure does
not mean that all public key security is worthless, or that all
schemes are equally insecure.
Proof techniques #1: Proof by Induction. This technique is used on
equations with "_n" in them. Induction techniques are very
popular, even the military used them. SAMPLE: Proof of induction
without proof of induction. We know it's true for _n equal to 1.
Now assume that it's true for every natural number less than _n.
_N is arbitrary, so we can take _n as large as we want. If _n
is sufficiently large, the case of _n+1 is trivially equivalent, so
the only important _n are _n less than _n. We can take _n =
_n (from above), so it's true for _n+1 because it's just about
_n. QED. (QED translates from the Latin as "So what?")
Manoj Srivastava <email@example.com> <http://www.debian.org/%7Esrivasta/>
Key C7261095 fingerprint = CB D9 F4 12 68 07 E4 05 CC 2D 27 12 1D F5 E8 6E