東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Enhancing anonymity of anonymous P2P...

Tian, Guanyu.

FindBook

Google Book

Amazon

博客來

Enhancing anonymity of anonymous P2P content sharing systems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Enhancing anonymity of anonymous P2P content sharing systems./
作者:	Tian, Guanyu.
面頁冊數:	107 p.
附註:	Source: Dissertation Abstracts International, Volume: 75-10(E), Section: B.
Contained By:	Dissertation Abstracts International75-10B(E).
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3625974
ISBN:	9781321004700

Enhancing anonymity of anonymous P2P content sharing systems.
Tian, Guanyu.

Enhancing anonymity of anonymous P2P content sharing systems. - 107 p.

Source: Dissertation Abstracts International, Volume: 75-10(E), Section: B.

Thesis (Ph.D.)--The Florida State University, 2014.

This item must not be sold to any third party vendors.

Anonymous networks play a critical role in supporting free speech and user privacy on the Internet. Over the years, many fundamental algorithms and schemes have been proposed to facilitate the development of anonymous networks, including mix networks, onion routing, per-hop (source) address re-writing and message forwarding, and various cryptographic algorithms. In addition, many practical anonymous networks have been developed and some are deployed on the Internet. On the other hand, despite the adoption of these well-established high-level security schemes and algorithms in such networks, the fine-grained design and development decisions of such networks have not been thoroughly examined. As a consequence, vulnerabilities in existing anonymous networks have been continuously identified and existing anonymous networks have been constantly attacked.

ISBN: 9781321004700Subjects--Topical Terms:

626642
Computer Science.

Enhancing anonymity of anonymous P2P content sharing systems.
LDR:04904nmm a2200349 4500 001 2057248
005 20150610073818.5
008 170521s2014 ||||||||||||||||| ||eng d
020 $a 9781321004700
035 $a (MiAaPQ)AAI3625974
035 $a AAI3625974
040 $a MiAaPQ $c MiAaPQ
100 1 $a Tian, Guanyu. $3 3171068
245 1 0 $a Enhancing anonymity of anonymous P2P content sharing systems.
300 $a 107 p.
500 $a Source: Dissertation Abstracts International, Volume: 75-10(E), Section: B.
500 $a Adviser: Zhenhai Duan.
502 $a Thesis (Ph.D.)--The Florida State University, 2014.
506 $a This item must not be sold to any third party vendors.
520 $a Anonymous networks play a critical role in supporting free speech and user privacy on the Internet. Over the years, many fundamental algorithms and schemes have been proposed to facilitate the development of anonymous networks, including mix networks, onion routing, per-hop (source) address re-writing and message forwarding, and various cryptographic algorithms. In addition, many practical anonymous networks have been developed and some are deployed on the Internet. On the other hand, despite the adoption of these well-established high-level security schemes and algorithms in such networks, the fine-grained design and development decisions of such networks have not been thoroughly examined. As a consequence, vulnerabilities in existing anonymous networks have been continuously identified and existing anonymous networks have been constantly attacked.
520 $a In this dissertation we take a pragmatic approach to investigate how fine-grained design and development decisions may affect the anonymity strength of anonymous networks, and more importantly, how we can develop proper fine-grained decisions to improve the anonymity strength of anonymous networks. Throughout the course, we focus on Freenet, a popular peer-to-peer anonymous content sharing network. In the first part of the work, we thoroughly investigate the fine-grained decisions made in the Freenet project, including methods to prevent routing loop of content request messages, the handling of various messages in Freenet, and mechanisms for a Freenet node to populate and update its routing table. An effective traceback attack has been developed that can identify the originating machine of a content request message. That is, the anonymity of a content retriever can be broken in Freenet, even if only a single request message has been issued from the corresponding machine. The traceback attack exploited a few fine-grained design and development decisions made in Freenet, including the unique identifier (UID) based mechanism to prevent routing loops of content request messages.
520 $a In the second part of our work, we investigate mechanisms to improve the anonymity of Freenet. In particular, we have developed a simple and effective scheme named dynID to thwart the traceback attack on Freenet. In dynID, the UID associated with a content request message is dynamically changed at the beginning portion of the message forwarding path. As a consequence, an attacker can only trace back a content request message to the node where the UID value is last changed; it cannot uniquely determine the originating machine of the message. Importantly, dynID only has negligible impacts on the performance of Freenet in locating content on the network. For example, our simulation studies based on the original Freenet source code show that, for all content requests, we can successfully locate the corresponding requested content.
520 $a DynID prevents an attacker deterministically identifying the originator of a message request, but attackers can probabilistically trace back to the originator. In the third part of our work, we develop a solution, Reroute-On-Loop (ROL), to prevent leakage of routing information. ROL prevents an attacker from distinguishing a node that has seen a particular message from a node that has not seen the message. Our simulation studies show that this solution is effective and brings only minor performance impact on Freenet. We emphasize that if an attacker cannot distinguish a node that has seen a particular message from a node that has not seen the message, it will become extremely difficult for the attacker to carry out any kind of traceback attack.
520 $a The Freenet project has released a patch to mitigate the traceback attack developed in this dissertation. The Reroute-On-Loop solution in our work has also been considered by the Freenet project.
590 $a School code: 0071.
650 4 $a Computer Science. $3 626642
650 4 $a Information Science. $3 1017528
650 4 $a Engineering, General. $3 1020744
690 $a 0984
690 $a 0723
690 $a 0537
710 2 $a The Florida State University. $b Computer Science. $3 3171069
773 0 $t Dissertation Abstracts International $g 75-10B(E).
790 $a 0071
791 $a Ph.D.
792 $a 2014
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3625974