弹性P2P匿名路由：合作方案与安全性分析

28 浏览量更新于2024-07-15 收藏 220KB PDF 举报

"采用协作方案的弹性P2P匿名路由方法" 在P2P(Peer-to-Peer)网络中，匿名路由是一种重要的技术，它允许网络中的节点进行通信时保持其身份的匿名性，以保护用户的隐私。然而，由于P2P网络的特性，节点流失（node churn）是一个显著的问题，这会导致匿名路径的脆弱性增加，从而引起消息丢失和通信失败。为了解决这一挑战，研究人员提出了一种采用协作方案的弹性P2P匿名路由方法。该方法的核心在于结合了基于友好邻居的激励机制（Friendly Neighbor-based Incentive, FNI）和重新加密（Re-encryption）机制。FNI机制旨在通过激励机制促进对等体之间的合作，鼓励它们转发其他对等体的消息，同时建立更多的连接，从而增强网络的连通性和性能。在这种机制下，只有表现稳定、行为良好的节点才会被选为中继节点，以确保匿名路径的持久性和可靠性。重新加密机制则针对可能故障的中继节点设计，当某些节点由于流失或其他原因无法正常工作时，这个机制可以动态地将数据包重定向到其他可用节点，以实现对不同节点可用性的弹性处理。这保证了即使在网络中存在大量节点流失的情况下，路由过程也能保持稳定，减少消息丢失的风险。安全结果分析和仿真测试显示，这种采用协作方案的P2P匿名路由方法显著提高了路由的弹性，能够在保持低延迟的同时，有效地控制通信开销。这不仅提高了网络的整体性能，也增强了用户隐私保护的能力，使得P2P匿名通信更加可靠和安全。总结来说，这篇研究工作提出了一个创新的解决方案，通过FNI和重新加密机制的协同作用，成功地解决了P2P网络中因节点流失带来的匿名路由问题。这种方法为未来设计更稳定、高效且安全的P2P匿名网络提供了有价值的理论依据和技术支持。

The rest of the paper is organized as follows. Section 2 reviews the existing P2P

anonymous routing schemes. Our approach is presented in Section 3. We present the

anonymity analysis of our approach in Section 4. In section 5, we employ the

simulation to demonstrate the effectiveness of our approach. We conclude the paper

with future research directions in Section 6.

2 Related Work

Most anonymous routing protocols can be categorized into mix-based and multicast-

based types. Mix-based systems [Chaum 1981] achieve anonymity by applying the

redirection technique such as Tor [Dingledine et al. 2004], while multicast-based

systems achieve anonymity by employing multicasting technique such as P5

[Sherwood et al. 2005], Hordes [Shields et al. 2000] and APFS [Scarlata et al. 2001].

As P2P networks are becoming appealing platforms for constructing anonymous

systems, a number of P2P-based anonymous systems have been proposed. Tarzan

[Freedman et al. 2002] and MorphMix [Rennhard et al. 2002] achieve anonymity by

applying layered encryption and multi-hop routing approaches. In contrast, Crowds

[Reiter et al. 1998] achieves anonymity by applying probabilistic random forwarding

scheme. Although P2P-based anonymous systems aim to achieve more anonymity,

the performance is degraded due to the node churn in P2P networks, which makes

anonymous paths fragile and short-lived.

To improve the performance of P2P networks, several incentive mechanisms

have been proposed. [Sun et al. 2004] proposed a simple Selfish Link-based

InCentive (SLIC) approach for unstructured P2P file sharing systems where nodes in

exchange for better services are encouraged to share more data, give more capacity to

neighbor nodes’ queries, and add new overlay links. To rate neighbor nodes

efficiently, several incentive mechanisms have been proposed recently. [Barth et al.

2008] proposed a complete distributed solution to the transit price negotiation

problem with incomplete information. [Wu et al. 2008] proposed the approach to rank

retrieval systems in the condition of partial relevance judgments. Such incentive

mechanisms need to be studied further for being employed in anonymous network.

To make anonymous paths resilient to node failures, TAP [Zhu et al. 2004] and

Cashmere [Zhuang et al. 2005] decouple paths from fixed relay nodes and use a group

of nodes in structured P2P networks [Rowstron et al. 2001] to mask single relay node

failures by sharing group keys among group members. The main limitation of such

systems is that group members must share some secrecy such as group keys. In order

to avoid such limitation, the re-encryption mechanism combined with key exchange

protocols can be used. [Ateniese et al. 2006] proposed an improved proxy re-

encryption scheme allowing third-parties (proxies) to alter a ciphertext which has

been encrypted for one party to be decrypted later by another. [Jeong et al. 2008]

proposed an efficient parallel key exchange protocol among multiple parties and

[Hwang et al. 2008] proposed the secure CL-PKE scheme to withstand malicious key

generation centre attack.

MuON [Bansod et al. 2008] is a mutual anonymity system that uses epidemic-

style data dissemination to handle network dynamics in unstructured P2P networks.

Zhu et al. [Zhu et al. 2007] proposed a message redundancy scheme to mask node

failures by employing erasure coding and path redundancy approaches. Although such

1799

Luo J., Wang X., Yang M.: A Resilient P2P Anonymous Routing Approach ...

剩余14页未读，继续阅读

weixin_38680475

粉丝: 6
资源: 933

弹性P2P匿名路由：合作方案与安全性分析

带宽自适应的P2P网络路由协议

论文研究-自适应的P2P网络路由方法研究.pdf

利用空间格网划分的P2P Delaunay网络路由方法 (2012年)

网络游戏-可运营P2P网络应用路由系统及其路由实现方法.zip

基于P2P的路由查询机制 (2008年)

基于P2P的无线Mesh网中SIP服务器协作方案.pdf

支付分享-P2P支付类型与路由方案设计1

P2P匿名通信系统中激励机制的研究

P2P匿名通信系统匿名度量研究

P2P匿名通信系统的信息熵匿名度量研究

最新资源