29 |
|
|
30 |
\keywords{Peer-to-Peer, P2P, security, distributed systems, hypermedia systems} |
\keywords{Peer-to-Peer, P2P, security, distributed systems, hypermedia systems} |
31 |
|
|
32 |
\avainsanat{Vertaisverkot, P2P, tietoturva, hajautetut järjestelmät, hypermedia-järjestelmät} |
\avainsanat{Vertaisverkot, P2P, tietoturva, hajautetut järjestelmät, hypermedia- |
33 |
|
järjestelmät} |
34 |
|
|
35 |
\contactinformation{\\ |
\contactinformation{\\ |
36 |
Hermanni Hyytiälä\\ |
Hermanni Hyytiälä\\ |
323 |
structured overlays have been proposed. |
structured overlays have been proposed. |
324 |
The list includes CAN \cite{ratnasamy01can}, Chord \cite{stoica01chord}, |
The list includes CAN \cite{ratnasamy01can}, Chord \cite{stoica01chord}, |
325 |
Kademlia \cite{maymounkov02kademlia}, Kelips \cite{gupta03kelips}, |
Kademlia \cite{maymounkov02kademlia}, Kelips \cite{gupta03kelips}, |
326 |
Koorde \cite{kaashoek03koorde}, ODHDHT \cite{naor03simpledht}, |
Koorde \cite{kaashoek03koorde}, Overlapping Distance Halving Distributed Hashtable |
327 |
Pastry \cite{rowston01pastry}, PeerNet \cite{eriksson03peernet}, |
(ODHDHT) \cite{naor03simpledht}, Pastry \cite{rowston01pastry}, PeerNet \cite{eriksson03peernet}, |
328 |
Skip Graphs \cite{AspnesS2003}, SkipNet \cite{harvey03skipnet2}, |
Skip Graphs \cite{AspnesS2003}, SkipNet \cite{harvey03skipnet2}, |
329 |
Symphony \cite{gurmeet03symphony}, SWAN \cite{bonsma02swan}, Tapestry |
Symphony \cite{gurmeet03symphony}, SWAN \cite{bonsma02swan}, Tapestry |
330 |
\cite{zhao01tapestry}, Viceroy \cite{malkhi02viceroy} and others \cite{freedman02trie}. |
\cite{zhao01tapestry}, Viceroy \cite{malkhi02viceroy} and others \cite{freedman02trie}. |
1313 |
|
|
1314 |
|
|
1315 |
|
|
1316 |
\parbox{90pt}{Query routing \cite{sit02securitycons}, \cite{aspnes02faultrouting}, \cite{castro02securerouting}, \cite{ratnasamy02routing}, \cite{gavoille01routing}, \cite{lynch02atomicdataaccess}} & |
\parbox{90pt}{Query routing \cite{sit02securitycons}, \cite{aspnes02faultrouting}, \cite{castro02securerouting}, \cite{ratnasamy02routing}, \cite{gavoille01routing}, |
1317 |
|
\cite{lynch02atomicdataaccess}, \cite{fiat02censorship}, \cite{saia02dynamicfaultcontentnetwork}, \cite{datar02butterflies}} & |
1318 |
\parbox{110pt}{Incorrect forwarding (hostile), incorrect routing (hostile)} & |
\parbox{110pt}{Incorrect forwarding (hostile), incorrect routing (hostile)} & |
1319 |
\parbox{110pt}{Query monitoring, cross check routing tables, verify routing tables, create routing table invariants} & |
\parbox{110pt}{Query monitoring, cross check routing tables, verify routing tables, create routing table invariants} & |
1320 |
\parbox{110pt}{Increases system complexity} |
\parbox{110pt}{Increases system complexity} |
1336 |
|
|
1337 |
|
|
1338 |
\parbox{90pt}{Spam attack \cite{naor03simpledht}} & |
\parbox{90pt}{Spam attack \cite{naor03simpledht}} & |
1339 |
\parbox{110pt}{Hostile entity creates false versions of data} & |
\parbox{110pt}{Hostile entity creates false versions of data, or gives wrong information about the data which entity is responsible for/knows about} & |
1340 |
\parbox{110pt}{Do not trust to single entity, get information from multiple entities, trust on majority's opinion} & |
\parbox{110pt}{Do not trust to single entity, get information from multiple entities, trust on majority's opinion} & |
1341 |
\parbox{110pt}{Easy to implement, creates more network traffic} |
\parbox{110pt}{Easy to implement, creates more network traffic} |
1342 |
\\ \hline |
\\ \hline |
1343 |
|
|
1344 |
|
|
1345 |
\parbox{90pt}{Resource spoofing} & |
\parbox{90pt}{Entity identification \cite{ajmani02conchord}, \cite{douceur02sybil}} & |
|
\parbox{110pt}{Hostile entity gives wrong information about the data which entity is responsible for/knows about} & |
|
|
\parbox{110pt}{Do not trust to single entity, get information from multiple entities, trust on majority's opinion} & |
|
|
\parbox{110pt}{Easy to implement, creates more network traffic} |
|
|
\\ \hline |
|
|
|
|
|
|
|
|
\parbox{90pt}{Entity identification \cite{ajmani02conchord}} & |
|
1346 |
\parbox{110pt}{Identify participating entities reliably and efficiently } & |
\parbox{110pt}{Identify participating entities reliably and efficiently } & |
1347 |
\parbox{110pt}{Digital signatures, key infrastructure} & |
\parbox{110pt}{Digital signatures, key infrastructure} & |
1348 |
\parbox{110pt}{Not practically realizable} |
\parbox{110pt}{Not practically realizable} |
1349 |
\\ \hline |
\\ \hline |
1350 |
|
|
1351 |
|
|
1352 |
\parbox{90pt}{Data integrity/authenticity \cite{dabek01widearea}} & |
\parbox{90pt}{Data integrity/authenticity \cite{fips-sha-1}, \cite{rivest96sdsi}, \cite{spkiworkinggroup}} & |
1353 |
\parbox{110pt}{Integrity/originality of data is unknown} & |
\parbox{110pt}{Integrity/originality of data is unknown} & |
1354 |
\parbox{110pt}{Cryptographic content hashes, key architectures} & |
\parbox{110pt}{Cryptographic content hashes, key architectures} & |
1355 |
\parbox{110pt}{For data integrity, there are working solutions, but for data authenticity, some of the solutions are partial, which may be practically realizable} |
\parbox{110pt}{For data integrity, there are working solutions, but for data authenticity, some of the solutions are partial, which may be practically realizable} |
1356 |
\\ \hline |
\\ \hline |
1357 |
|
|
1358 |
|
|
1359 |
\parbox{90pt}{Anonymity \cite{tarzan:ccs9}, \cite{pub00}, \cite{clarke00freenet}, \cite{reiter98crowds}, \cite{352607},\cite{502002}} & |
\parbox{90pt}{Anonymity \cite{dingledine00free}, \cite{tarzan:ccs9}, \cite{pub00}, \cite{clarke00freenet}, \cite{reiter98crowds}, \cite{352607},\cite{502002}} & |
1360 |
\parbox{110pt}{Anonymity cannot be provided in all cases} & |
\parbox{110pt}{Anonymity cannot be provided in all cases} & |
1361 |
\parbox{110pt}{Remailers, pre-routing} & |
\parbox{110pt}{Remailers, pre-routing} & |
1362 |
\parbox{110pt}{Total anonymity cannot be provided yet} |
\parbox{110pt}{Total anonymity cannot be provided yet} |
1364 |
|
|
1365 |
|
|
1366 |
\parbox{90pt}{Malicious peers \cite{sit02securitycons}, \cite{castro02securerouting}} & |
\parbox{90pt}{Malicious peers \cite{sit02securitycons}, \cite{castro02securerouting}} & |
1367 |
\parbox{110pt}{How to identify malicious peers in the system} & |
\parbox{110pt}{How to identify malicious peers in the system ?} & |
1368 |
\parbox{110pt}{Create invariants for peer behavior, verify invariants, self-certifying data} & |
\parbox{110pt}{Create invariants for peer behavior, verify invariants, self-certifying data} & |
1369 |
\parbox{110pt}{Partial solutions, self-certifying data most reliable} |
\parbox{110pt}{Partial solutions, self-certifying data most reliable} |
1370 |
\\ \hline |
\\ \hline |
1391 |
\\ \hline |
\\ \hline |
1392 |
|
|
1393 |
|
|
1394 |
\parbox{90pt}{External security threats} & |
\parbox{90pt}{External security threats \cite{grahamp2psecurity}} & |
1395 |
\parbox{110pt}{Viruses, trojans, sniffers} & |
\parbox{110pt}{Viruses, trojans, sniffers} & |
1396 |
\parbox{110pt}{Data integrity/authenticity, distributed anti virus software} & |
\parbox{110pt}{Data integrity/authenticity, distributed anti virus software} & |
1397 |
\parbox{110pt}{Not much research has been done on this} |
\parbox{110pt}{Not much research has been done on this} |
1428 |
|
|
1429 |
\endfoot |
\endfoot |
1430 |
|
|
1431 |
\parbox{90pt}{Web indexing and searching \cite{li03feasibility}, \cite{Bhattacharjee03resultcache}, \cite{362692}, \cite{CuencaAcuna2002DSIWorkshop}, \cite{rhea02probabilistic}, \cite{joseph02neurogrid}, \cite{crespo02semanticoverlay}, \cite{joseph02p2players}, \cite{chord:om_p-meng}} & |
\parbox{90pt}{Web indexing and searching \cite{li03feasibility}, \cite{Bhattacharjee03resultcache}, \cite{362692}, \cite{CuencaAcuna2002DSIWorkshop}, |
1432 |
|
\cite{rhea02probabilistic}, \cite{joseph02neurogrid}, \cite{crespo02semanticoverlay}, \cite{joseph02p2players}, \cite{chord:om_p-meng}, |
1433 |
|
\cite{wittengigabytes}, \cite{338634}} & |
1434 |
\parbox{110pt}{Perform Web like searches in Peer-to-Peer network} & |
\parbox{110pt}{Perform Web like searches in Peer-to-Peer network} & |
1435 |
\parbox{110pt}{Data compression, view trees, bloom filters and its variations, gap compression, index intersection optimizations, clustering} & |
\parbox{110pt}{Data compression, view trees, bloom filters and its variations, gap compression, index intersection optimizations, clustering} & |
1436 |
\parbox{110pt}{Effective but complex solutions, some compromises have to be done (decrease result quality, modify overlay's structure), more research needed} |
\parbox{110pt}{Effective but complex solutions, some compromises have to be done (decrease result quality, modify overlay's structure), more research needed} |
1437 |
\\ \hline |
\\ \hline |
1438 |
|
|
1439 |
|
|
1440 |
\parbox{90pt}{Efficient and scalable data discovery \cite{lv02searchreplication}, \cite{osokine02distnetworks}, \cite{yang02improvingsearch}, \cite{lv02gnutellascalable}, \cite{ganesan02yappers}, \cite{adamic02localsearch}, \cite{adamic01powerlawsearch}, \cite{ripeanu02mappinggnutella}, \cite{milgram67smallworld}, \cite{adamic99small}, \cite{ramanathan02goodpeers}, \cite{kleinberg99small}, \cite{nips02-Kleinberg}, \cite{zhang02using}, \cite{watts00dynamics}} & |
\parbox{90pt}{Efficient and scalable data discovery \cite{lv02searchreplication}, \cite{osokine02distnetworks}, \cite{yang02improvingsearch}, \cite{lv02gnutellascalable}, |
1441 |
|
\cite{ganesan02yappers}, \cite{adamic02localsearch}, \cite{adamic01powerlawsearch}, \cite{ripeanu02mappinggnutella}, \cite{milgram67smallworld}, \cite{adamic99small}, |
1442 |
|
\cite{ramanathan02goodpeers}, \cite{kleinberg99small}, \cite{nips02-Kleinberg}, \cite{zhang02using}, \cite{watts00dynamics}, \cite{karger02findingnearest}, |
1443 |
|
\cite{brinkmann02compactplacement}, \cite{rhea02probabilistic}, \cite{castro02networkproximity}, \cite{ng02predicting}, \cite{pias03lighthouse}} & |
1444 |
\parbox{110pt}{Find resources efficiently, if resource exists (loosely structured)} & |
\parbox{110pt}{Find resources efficiently, if resource exists (loosely structured)} & |
1445 |
\parbox{110pt}{Super peers, peer clusters, caching techniques} & |
\parbox{110pt}{Super peers, peer clusters, caching techniques} & |
1446 |
\parbox{110pt}{More efficient, less network traffic, not comparable to the efficiency of tightly structured systems} |
\parbox{110pt}{More efficient, less network traffic, not comparable to the efficiency of tightly structured systems} |
1448 |
|
|
1449 |
|
|
1450 |
\parbox{90pt}{Richness of queries \cite{harren02complex}, \cite{ansaryefficientbroadcast03}, \cite{andrzejak02rangequeries}} & |
\parbox{90pt}{Richness of queries \cite{harren02complex}, \cite{ansaryefficientbroadcast03}, \cite{andrzejak02rangequeries}} & |
1451 |
\parbox{110pt}{Query languages should be more powerful} & |
\parbox{110pt}{Query languages should be more powerful in tightly structured overlays} & |
1452 |
\parbox{110pt}{SQL-like queries} & |
\parbox{110pt}{SQL-like queries} & |
1453 |
\parbox{110pt}{Hard to implement, increases system complexity, not much research has been done} |
\parbox{110pt}{Hard to implement, increases system complexity, not much research has been done} |
1454 |
\\ \hline |
\\ \hline |
1455 |
|
|
1456 |
|
|
1457 |
\parbox{90pt}{Robustness \cite{datar02butterflies}, \cite{saia02dynamicfaultcontentnetwork}, \cite{fiat02censorship}, \cite{aspnes02faultrouting}, \cite{albert-00-tolerance}} & |
\parbox{90pt}{Robustness \cite{datar02butterflies}, \cite{saia02dynamicfaultcontentnetwork}, \cite{fiat02censorship}, \cite{aspnes02faultrouting}, \cite{albert-00-tolerance}, \cite{libennowell01observations}} & |
1458 |
\parbox{110pt}{How well system performs under hostile attacks/in the case of severe failure ?} & |
\parbox{110pt}{How well system performs under hostile attacks/in the case of severe failure ?} & |
1459 |
\parbox{110pt}{Self-tuning, backup links, use diverse routing paths, power-law networks/properties} & |
\parbox{110pt}{Self-tuning, backup links, use diverse routing paths, power-law networks/properties} & |
1460 |
\parbox{110pt}{Working solutions} |
\parbox{110pt}{Working solutions} |
1514 |
\parbox{110pt}{Creates more overhead/space requirements per peer} |
\parbox{110pt}{Creates more overhead/space requirements per peer} |
1515 |
\\ \hline |
\\ \hline |
1516 |
|
|
1517 |
\parbox{90pt}{Fail Stop} & |
\parbox{90pt}{Fail Stop \cite{rowston03controlloingreliability}, \cite{zhang03somo}} & |
1518 |
\parbox{110pt}{A faulty peer stops working} & |
\parbox{110pt}{A faulty peer stops working} & |
1519 |
\parbox{110pt}{Failure detectors, informing algorithms} & |
\parbox{110pt}{Failure detectors, informing algorithms} & |
1520 |
\parbox{110pt}{Creates more network traffic, peer's information can be outdated, failure detectors not reliable} |
\parbox{110pt}{Creates more network traffic, peer's information can be outdated, failure detectors not reliable} |
1566 |
\\ \hline |
\\ \hline |
1567 |
|
|
1568 |
|
|
1569 |
\parbox{90pt}{Lack of motivation to cooperate \cite{golle01incentivesp2p}} & |
\parbox{90pt}{Lack of motivation to cooperate \cite{golle01incentivesp2p}, \cite{ngan03enforcefile}, \cite{shneidman03rationality}} & |
1570 |
\parbox{110pt}{All participants do not behave like they should be, instead they go for own profit} & |
\parbox{110pt}{All participants do not behave like they should be, instead they go for own profit} & |
1571 |
\parbox{110pt}{Different reputation methods} & |
\parbox{110pt}{Different reputation methods} & |
1572 |
\parbox{110pt}{No real world experience in a wide scale} |
\parbox{110pt}{No real world experience in a wide scale} |
1573 |
\\ \hline |
\\ \hline |
1574 |
|
|
1575 |
|
|
1576 |
\parbox{90pt}{Heterogeneity \cite{saroiu02measurementstudyp2p}, \cite{brinkmann02compactplacement}, \cite{zhao02brocade},\cite{gurmeet03symphony}} & |
\parbox{90pt}{Heterogeneity \cite{saroiu02measurementstudyp2p}, \cite{brinkmann02compactplacement}, \cite{zhao02brocade},\cite{gurmeet03symphony}, \cite{rowston03controlloingreliability}} & |
1577 |
\parbox{110pt}{There are different kind of peers in the system, in light of bandwidth and computing power} & |
\parbox{110pt}{There are different kind of peers in the system, in light of bandwidth and computing power} & |
1578 |
\parbox{110pt}{Super peers (loosely structured), clusters (loosely structured) additional layer upon tighty structured systems, structure itself is simple (tighty structured)} & |
\parbox{110pt}{Super peers (loosely structured), clusters (loosely structured) additional layer upon tighty structured systems, structure itself is simple (tighty structured)} & |
1579 |
\parbox{110pt}{Working solutions, increases system complexity (additional layer)} |
\parbox{110pt}{Working solutions, increases system complexity (additional layer)} |
1587 |
\\ \hline |
\\ \hline |
1588 |
|
|
1589 |
|
|
1590 |
\parbox{90pt}{Comprehensive simulations/analysis of Peer-to-Peer network} & |
\parbox{90pt}{Comprehensive simulations or analysis of Peer-to-Peer system} & |
1591 |
\parbox{110pt}{Ability to simulate whole Peer-to-Peer network's usage patterns, network traffics, flux state etc.} & |
\parbox{110pt}{Ability to simulate whole Peer-to-Peer network's usage patterns, network traffics, flux state etc.} & |
1592 |
\parbox{110pt}{Use same techniques as simulating/analyzing the Internet} & |
\parbox{110pt}{Use same techniques as simulating/analyzing the Internet} & |
1593 |
\parbox{110pt}{Only small subsets of Peer-to-Peer networks has been analysed, because of ad hoc properties of network, more powerful solutions needed} |
\parbox{110pt}{Only small subsets of Peer-to-Peer networks has been analysed, because of ad hoc properties of network, more powerful solutions needed} |