[146363] in cryptography@c2.net mail archive
Re: [Cryptography] Implementations, attacks on DHTs, Mix Nets?
daemon@ATHENA.MIT.EDU (James A. Donald)
Sun Aug 25 23:59:30 2013
X-Original-To: cryptography@metzdowd.com
Date: Mon, 26 Aug 2013 11:22:23 +1000
From: "James A. Donald" <jamesd@echeque.com>
To: cryptography@metzdowd.com
In-Reply-To: <07cb01cea1f8$2ec2c200$8c484600$@huitema.net>
Reply-To: jamesd@echeque.com
Errors-To: cryptography-bounces+crypto.discuss=bloom-picayune.mit.edu@metzdowd.com
On 2013-08-26 11:04 AM, Christian Huitema wrote:
> Of course the data can be signed, encrypted, etc. But the rule of the game
> is that the adversary can manufacture as many peers as they want --
> something known as the Sybil attack. They can then perform various forms of
> denial.
We need, and have not designed, a good distributed reputation system,
resting on Zooko's triangle and a large global hash tree that provides
an unfalsifiable past history of the past conduct of key holders.
Such a global hash tree requires, like bitcoin, a solution to the
Byzantine Generals Problem - a known hard problem that is nonetheless
soluble.
A distributed reputation system can also provide things like debt based
money that provides an incentive for seeding - for providing storage of
interesting content as well as an incentive for upload bandwidth of
interesting content. Bittorrent provides an upload bandwidth incentive,
but no storage incentive.
_______________________________________________
The cryptography mailing list
cryptography@metzdowd.com
http://www.metzdowd.com/mailman/listinfo/cryptography
