Survey on Anonymity in Unstructured Peer-to-Peer Systems

Xiao, Renyi

doi:10.1007/s11390-008-9162-7

Cited by 19 publications

(5 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, we drop it, because this overlay uses either one-hop messages, messages supposed to reach all peers or messages routed towards a single destination. Moreover, TTL is easy to spoof, it creates problems with maintaining anonymity [15] and we already employ other ways for detecting repeated messages.…”

Section: Design Of the Overlaymentioning

confidence: 99%

Cryptography enhanced ad-hoc approach to P2P overlays

Zima

Hladká

2016

2016 International Conference on High Performance Computing &Amp; Simulation (HPCS)

View full text Add to dashboard Cite

Abstract-We address the problem of a secure direct communication of two arbitrary peers in a P2P network without knowing each other's IP addresses. An efficient solution to this problem will provide a practically usable way of communication to privacy-sensitive P2P applications. Traditionally, P2P architectures view this problem as a problem of mutual anonymity of a message sender and receiver, but usual solutions suffer from various inefficiencies or complexities. By looking at the problem from a perspective of an ad-hoc network, we are able to apply a familiar approach of multihop communication and ad-hoc routing algorithms to a P2P overlay. Introduced usage of a public key as a node's identifier adds further security features, including data integrity through digital signatures, or end-to-end encryption. Proposed P2P overlay has been successfully used for building a decentralised cryptocurrency exchange Coincer.

show abstract

Section: Design Of the Overlaymentioning

confidence: 99%

Cryptography enhanced ad-hoc approach to P2P overlays

Zima

Hladká

2016

2016 International Conference on High Performance Computing &Amp; Simulation (HPCS)

View full text Add to dashboard Cite

show abstract

“…This strategy can also be treated as a mechanism to exclude adversary from the system. Although some existing works have shown the possibility of importing trust strategy into P2P anonymous communications, they also face some challenges and open problems for practical use [20][21][22].…”

Section: Trust and Reputationmentioning

confidence: 99%

Anonymity analysis of P2P anonymous communication systems

Jia

Duan

Liu

et al. 2011

Computer Communications

View full text Add to dashboard Cite

“…These methods can be classi¿ed into three types: unimessagebased, replicated message-based, and split message-based [8]. For the unimessage-based approaches, they incur the lowest traffic overhead.…”

Section: Introductionmentioning

confidence: 99%

Network Coding-Based Mutual Anonymity Communication Protocol for Mobile P2P Networks

Wang

Chen

2012

2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications

View full text Add to dashboard Cite

To protect user privacy in mobile peer to peer (MP2P) networks, a network coding-based mutual anonymity communication protocol (NMA) is proposed. Our contributions are described as below. We first design a network coding scheme which can defend against various omniscient adversary attacks. Then a novel anonymous communication protocol is presented to meet the anonymity requirement for MP2P applications. The novel anonymous communication protocol is comprised of three steps: query issuance, reply-confirm and file delivery. They all employ the network coding scheme to split and encrypt the signaling and data information. The splitted fragments are flooded at a certain number of hops until some intermediate peers called agents, can collect enough fragments to recover the original information. Next, the agents forward the messages to their neighboring peers. For the query issuance, the neighboring peers forward the query message to the responders by random walk mechanism. For the rest steps, the data information is delivered along the reversed paths discovered by the way of onion routing plus buffer information in routing table. In the entire process, the identities and sensitive information about the initiator and responder are completely hidden. The advantages of the scheme lie in the fact that the network coding and mutli-agent can improve the load balance, the successful rate of information transmission and anonymity degree. The experimental results demonstrate that when the percentage of malicious peers is lower than 50%, the various performances of the NMA, including the response time and the success rate, outperform other mutual anonymity schemes.

show abstract

Survey on Anonymity in Unstructured Peer-to-Peer Systems

Cited by 19 publications

References 46 publications

Cryptography enhanced ad-hoc approach to P2P overlays

Cryptography enhanced ad-hoc approach to P2P overlays

Anonymity analysis of P2P anonymous communication systems

Network Coding-Based Mutual Anonymity Communication Protocol for Mobile P2P Networks

Contact Info

Product

Resources

About