OdpornoÅÄ na bÅÄdy bizantyjskie w systemach peer-to-peer - Instytut ...
OdpornoÅÄ na bÅÄdy bizantyjskie w systemach peer-to-peer - Instytut ...
OdpornoÅÄ na bÅÄdy bizantyjskie w systemach peer-to-peer - Instytut ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
112 BIBLIOGRAFIA<br />
[LNBK02] D. Liben-Nowell, H. Balakrish<strong>na</strong>n, and D. Karger. A<strong>na</strong>lysis of the<br />
evolution of <strong>peer</strong>-<strong>to</strong>-<strong>peer</strong> systems. In In Proceedings of the Twenty-<br />
First Annual Symposium on Principles of Distributed Computing.,<br />
pages 233–242. ACM Press, 2002., 2002.<br />
[MM02]<br />
[MVO96]<br />
[PRR97]<br />
P. Maymounkov and D. Mazieres. Kademlia: A <strong>peer</strong>-<strong>to</strong>-<strong>peer</strong> information<br />
system based on the xor metric, 2002.<br />
Alfred J. Menezes, Scott A. Vans<strong>to</strong>ne, and Paul C. Van Oorschot.<br />
Handbook of Applied Cryp<strong>to</strong>graphy. CRC Press, Inc., 1996.<br />
C. Greg Plax<strong>to</strong>n, Rajmohan Rajaraman, and Andrea W. Richa. Accessing<br />
nearby copies of replicated objects in a distributed environment.<br />
In ACM Symposium on Parallel Algorithms and Architectures,<br />
pages 311–320, 1997.<br />
[RD01a] An<strong>to</strong>ny Rowstron and Peter Druschel. S<strong>to</strong>rage ma<strong>na</strong>gement and<br />
caching in PAST, a large-scale, persistent <strong>peer</strong>-<strong>to</strong>-<strong>peer</strong> s<strong>to</strong>rage utility.<br />
In 18th ACM Symposium on Operating Systems Principles<br />
(SOSP’01), pages 188–201, oct 2001.<br />
[RD01b]<br />
[REG + 03]<br />
[RFH + 00]<br />
[RSA77]<br />
[SGR97]<br />
An<strong>to</strong>ny I. T. Rowstron and Peter Druschel. Pastry: Scalable, decentralized<br />
object location, and routing for large-scale <strong>peer</strong>-<strong>to</strong>-<strong>peer</strong><br />
systems. In Middleware 2001: Proceedings of the IFIP/ACM Inter<strong>na</strong>tio<strong>na</strong>l<br />
Conference on Distributed Systems Platforms Heidelberg,<br />
pages 329–350. Springer-Verlag, 2001.<br />
S. Rhea, P. Ea<strong>to</strong>n, D. Geels, H. Weatherspoon, B. Zhao, and J. Kubia<strong>to</strong>wicz.<br />
Pond: The oceans<strong>to</strong>re pro<strong>to</strong>type. In Proceedings of the<br />
Conference on File and S<strong>to</strong>rage Technologies. USENIX, 2003.<br />
Sylvia Rat<strong>na</strong>samy, Paul Francis, Mark Handley, Richard Karp, and<br />
Scott Shenker. A scalable content addressable network. Technical<br />
Report TR-00-010, Berkeley, CA, 2000.<br />
R. L. Rivest, A. Shamir, and L. M. Adelman. A method for obtaining<br />
digital sig<strong>na</strong>tures and public-key cryp<strong>to</strong>systems. Technical Report<br />
MIT/LCS/TM-82, 1977.<br />
P F Syverson, D M Goldschlag, and M G Reed. Anonymous connections<br />
and onion routing. In IEEE Symposium on Security and<br />
Privacy, pages 44–54, Oakland, California, 4–7 1997.<br />
[Sha79] Adi Shamir. How <strong>to</strong> share a secret. Commun. ACM, 22(11):612–613,<br />
1979.
Change language