You might take a look at these papers: http://www.eecs.harvard.edu/~mema/courses/cs264/papers/samsara-sosp2003.pdf http://discovery.ucl.ac.uk/14962/1/14962.pdf http://discovery.ucl.ac.uk/19490/1/19490.pdf
On Fri, Jul 13, 2012 at 11:33 AM, Morten Olsen Lysgaard <[email protected]>wrote: > A year ago I researched DHTs quite extensively. I found them vastly > interesting for a long time dream of mine. A time-shared cooperative > storage network. A system, where public files can be stored. > At the time i was thinking a gigantic music storage service which would > let people stream songs from other peers as long as they contributed back. > > I implemented Chord in Haskell and with it a replicated and fault tolerant > storage layer, but then I realized that I had no knowledge of securing this > DHT. I didn't even know what security would mean on such a network. How do > you prevent malicious nodes from destroying all the data, or creating a > million peers. How do you enforce good behavior so that people share their > disk space and bandwidth? All these questions popped up in my head. > > TLDR; I'm wondering if anyone here have experience with, or know of, > techniques for securing the function of structured overlay networks with no > central authority. I find this problem really really hard. > > I would be really for any advise, research literature, concrete > implementation or anything in between that you guys think would be relevant. > > -- > Morten > ______________________________**_________________ > p2p-hackers mailing list > [email protected] > http://lists.zooko.com/**mailman/listinfo/p2p-hackers<http://lists.zooko.com/mailman/listinfo/p2p-hackers> > -- Tony Arcieri
_______________________________________________ p2p-hackers mailing list [email protected] http://lists.zooko.com/mailman/listinfo/p2p-hackers
