OdpornoÅÄ na bÅÄdy bizantyjskie w systemach peer-to-peer - Instytut ...

More documents

Recommendations

Info

112 BIBLIOGRAFIA [LNBK02] D. Liben-Nowell, H. Balakrishnan, and D. Karger. Analysis of the evolution of peer-to-peer systems. In In Proceedings of the Twenty- First Annual Symposium on Principles of Distributed Computing., pages 233–242. ACM Press, 2002., 2002. [MM02] [MVO96] [PRR97] P. Maymounkov and D. Mazieres. Kademlia: A peer-to-peer information system based on the xor metric, 2002. Alfred J. Menezes, Scott A. Vanstone, and Paul C. Van Oorschot. Handbook of Applied Cryptography. CRC Press, Inc., 1996. C. Greg Plaxton, Rajmohan Rajaraman, and Andrea W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In ACM Symposium on Parallel Algorithms and Architectures, pages 311–320, 1997. [RD01a] Antony Rowstron and Peter Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In 18th ACM Symposium on Operating Systems Principles (SOSP’01), pages 188–201, oct 2001. [RD01b] [REG + 03] [RFH + 00] [RSA77] [SGR97] Antony I. T. Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Middleware 2001: Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, pages 329–350. Springer-Verlag, 2001. S. Rhea, P. Eaton, D. Geels, H. Weatherspoon, B. Zhao, and J. Kubiatowicz. Pond: The oceanstore prototype. In Proceedings of the Conference on File and Storage Technologies. USENIX, 2003. Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content addressable network. Technical Report TR-00-010, Berkeley, CA, 2000. R. L. Rivest, A. Shamir, and L. M. Adelman. A method for obtaining digital signatures and public-key cryptosystems. Technical Report MIT/LCS/TM-82, 1977. P F Syverson, D M Goldschlag, and M G Reed. Anonymous connections and onion routing. In IEEE Symposium on Security and Privacy, pages 44–54, Oakland, California, 4–7 1997. [Sha79] Adi Shamir. How to share a secret. Commun. ACM, 22(11):612–613, 1979.
BIBLIOGRAFIA 113 [Sho00] Victor Shoup. Practical threshold signatures. Lecture Notes in Computer Science, 1807:207, 2000. [SM02] Emil Sit and Robert Morris. Security considerations for peer-topeer distributed hash tables. In IPTPS ’01: Revised Papers from the First International Workshop on Peer-to-Peer Systems, pages 261–269. Springer-Verlag, 2002. [SMK + 01] Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proceedings of the 2001 ACM SIGCOMM Conference, pages 149–160, 2001. [Ste99] W. Richard Stevens. UNIX network programming, volume 1,2 (2nd ed.). Prentice Hall PTR, 1999. [Tan95] Andrew S. Tanenbaum. Distributed operating systems. Prentice- Hall, Inc., Upper Saddle River, NJ, USA, 1995. [TS01] [ZHS + 03] [ZvRM02] Andrew S. Tanenbaum and Maarten Van Steen. Distributed Systems: Principles and Paradigms. Prentice Hall PTR, 2001. Ben Y. Zhao, Ling Huang, Jeremy Stribling, Sean C. Rhea, Anthony D Joseph, and John D. Kubiatowicz. Tapestry: A global-scale overlay for rapid service deployment. IEEE Journal on Selected Areas in Communications, 2003. Special Issue on Service Overlay Networks, to appear. Lidong Zhou, Robbert van Renesse, and Michael Marsh. Implementing ipv6 as a peer-to-peer overlay network. In SRDS ’02: Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems (SRDS’02), page 347, Washington, DC, USA, 2002. IEEE Computer Society.
Page 1:
Politechnika Warszawska Wydział El
Page 4 and 5:
4 SPIS TREŚCI 3.4 Algorytm SC-ABC
Page 6 and 7:
6 Rozdział 1. Wprowadzenie tyjskic
Page 8 and 9:
8 Rozdział 1. Wprowadzenie • Bez
Page 10 and 11:
10 Rozdział 1. Wprowadzenie torren
Page 12 and 13:
12 Rozdział 1. Wprowadzenie Zalety
Page 14 and 15:
14 Rozdział 1. Wprowadzenie Proxy
Page 17 and 18:
Rozdział 2 Architektury systemów
Page 19 and 20:
19 Overlay level A B C TCP TCP TCP
Page 21 and 22:
2.2 Ustrukturalizowane systemy peer
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
2.3 Architektura systemów Chord i
Page 29 and 30:
2.3 Architektura systemów Chord i
Page 31 and 32:
2.4 Bezpieczeństwo w systemach pee
Page 33 and 34:
2.4 Bezpieczeństwo w systemach pee
Page 35 and 36:
Rozdział 3 Bezpieczne bizantyjskie
Page 37 and 38:
3.1 Problem bizantyjskich generał
Page 39 and 40:
3.2 Replikacja z uwzględnieniem b
Page 41 and 42:
3.3 Algorytm BFT 41 C 0 1 2 pre-pre
Page 43 and 44:
3.3 Algorytm BFT 43 2. Replika gł
Page 45 and 46:
3.3 Algorytm BFT 45 3.3.4 Proaktywn
Page 47 and 48:
3.4 Algorytm SC-ABC 47 pracy nie za
Page 49 and 50:
3.4 Algorytm SC-ABC 49 Rysunek 3.3:
Page 51 and 52:
3.4 Algorytm SC-ABC 51 Secure Causa
Page 53 and 54:
3.4 Algorytm SC-ABC 53 będzie pode
Page 55 and 56:
3.5 Podsumowanie 55 3.5 Podsumowani
Page 57 and 58:
3.5 Podsumowanie 57 Protokół 3.5.
Page 59:
3.5 Podsumowanie 59 Protokół 3.5.
Page 62 and 63: 62 Rozdział 4. Tolerowanie bizanty
Page 85 and 86: Rozdział 5 Projekt systemu Pastor
Page 87 and 88: 5.1 Projekt systemu 87 wykonaniem k
Page 89 and 90: 5.1 Projekt systemu 89 5.1.3 Postar
Page 91 and 92: 5.1 Projekt systemu 91 4 MyPastCont
Page 93 and 94: 5.1 Projekt systemu 93 wydajność,
Page 95: 5.2 Podsumowanie 95 wchodzą w skł
Page 98 and 99: 98 Dodatek A. Elementy teorii graf
Page 104 and 105: 104 Dodatek B. Uzgadnianie w asynch
Page 106 and 107: 106 Dodatek B. Uzgadnianie w asynch
Page 109 and 110: Bibliografia [ADS02] [CC] J. Aspnes
Page 111: BIBLIOGRAFIA 111 [DZDS03] [FLP85] [
show all

OdpornoÅÄ na bÅÄdy bizantyjskie w systemach peer-to-peer - Instytut ...

Create successful ePaper yourself

Delete template?

Save as template?

OdpornoÅÄ na bÅÄdy bizantyjskie w systemach peer-to-peer - Instytut ...