hello, i'm developing an anonymity application over at http://www.authnet.org/anonnet/. it uses the pipenet model, which roughly is a series of tunneled proxies.
one of the problems is node discovery, and anonymous key exchange. one solution i am mulling over is using a secret sharing protocol (legrande interpolating polynomial scheme [AC2 23.2]) for a pki. the assumption is made that a global identifier exists, such as an e-mail address, ipaddress or some such. to distribute your public-key you break the public-key into N parts, and insert those into random spots on the network (the network being something akin to freenet). to query a key, the indentifier is used to query the network. as the pieces of the shared secret come in, some mechanism is used to determine whether to use the key or not (a threshold on bad shared pieces). has this been explored here before. also, is it possible to create freenet documents that have the same key, but different data (i.e. the same identifier, but different parts of the shared secret)? answers, suggestions, comments? tia, Bill _______________________________________________ freenet-tech mailing list [EMAIL PROTECTED] http://lists.freenetproject.org/mailman/listinfo/tech
