bluesky AT lists.ibiblio.org
Subject: Global-Scale Distributed Storage Systems
List archive
- From: Wei Dai <weidai AT weidai.com>
- To: Global-Scale Distributed Storage Systems <bluesky AT franklin.metalab.unc.edu>
- Subject: Re: weak secure IDs
- Date: Sun, 29 Sep 2002 18:20:20 -0400
On Sun, Sep 29, 2002 at 06:12:02PM -0400, Wei Dai wrote:
> To generate an ID, first generate a public key P and compute its secure
> hash K = H(P). Then find ID_b such that H(b | K | ID_b) shares a b-bit
> prefix with K. Join the system using ID_b as your level-b secure ID. Now,
> using a low-priority thread, for i from b+1 to the length of K, find ID_i
> such that H(i | K | ID_i) shares a i-bit prefix with K. When a new ID_i
> found, withdraw from the system and rejoin using ID_i (which has level-i
> security).
Sorry, H(ID_i) should be used as the actual ID (i.e., logical address for
routing purposes), ID_i is to be kept to prove H(ID_i)'s validity.
-
weak secure IDs,
Wei Dai, 09/29/2002
- <Possible follow-up(s)>
- Re: weak secure IDs, Wei Dai, 09/29/2002
- Re: weak secure IDs, Zooko, 09/30/2002
- Re: weak secure IDs, Wei Dai, 09/30/2002
Archive powered by MHonArc 2.6.24.