Skip to main content
SpringerLink
Log in

Rumor Riding: An Anonymity Approach for Decentralized Peer to Peer Systems

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

The anonymizing peer to peer (P2P) system is frequently incurred additional expense in order to efficiency transfer and various systems execute to disguise the uniqueness privacy considerations issues for their users. Although, an anonymity technique mostly existing path base peer before transmits, it has pre-create an anonymous path. An information as well as maintenance transparency of path is a lot high. In this paper it has been proposed mutual anonymity rumor riding (RR) protocol for decentralization environment P2P systems. The very heavy load path construction carries by RR system using random walk mechanism for free initiate peers. We evaluate with before RSA based and also anonymity approach based on AES, RR get extra benefit of lower cryptographic overhead mostly to get anonymity using asymmetric cryptographic algorithm. We illustrate design and effectiveness during the simulations by trace driven. RR is very effect and efficient than previous protocols the experimental and analytical result shows us.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Sherwood, R., Bhattacharjee, B., & Srinivasan, A. P5: A protocol for scalable anonymous communi- cation. In Proceedings of IEEE symposium on security and privacy (S&P ’02) (pp. 53–65).

  2. Wright, M. K., Adler, M., Levine, B. N., & Shields, C. (2004). The predecessor attack: An analysis of a threat to anonymous communications systems. ACM Transactions on Information and System Security (TISSEC), 7(4), 489–522.

    Article  Google Scholar 

  3. Reiter, M. K., & Rubin, A. D. (1998). Crowds: Anonymity for web transactions. ACM Transactions on Information and System Security (TISSEC), 1(1), 66–92.

    Article  Google Scholar 

  4. Dingledine, R., Mathewson, N., & Syverson, P. (2004). Tor: The second-generation onion router. DTIC Document.

  5. Goldschlag, D., Reed, M., & Syverson, P. (1999). Onion routing. Communications of the ACM, 42(2), 39–41.

    Article  Google Scholar 

  6. Xiao, L., Xu, Z., & Zhang, X. (2003). Low-cost and reliable mutual anonymity protocols in peer-to-peer networks. Parallel and Distributed Systems, IEEE Transactions on, 14(9), 829–840.

    Article  Google Scholar 

  7. Liu, Y., Han, J., & Wang, J. (2011). Rumor riding: Anonymizing unstructured peer-to-peer systems. Parallel and Distributed Systems, IEEE Transactions on, 22(3), 464–475.

    Article  MathSciNet  Google Scholar 

  8. Bisnik, N., & Abouzeid, A. (2005). Modeling and analysis of random walk search algorithms in P2P networks. In Hot topics in peer-to-peer systems, 2005. HOT-P2P 2005. Second International Workshop on (pp. 95–103). IEEE.

  9. Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. (2006). Sybilguard: Defending against sybil attacks via social networks. ACM SIGCOMM Computer Communication Review, 36(4), 267–278.

    Article  Google Scholar 

  10. Zhu, Y., Fu, X., Bettati, R., & Zhao, W. (2007). Analysis of flow-correlation attacks in anonymity network. International Journal of Security and Networks, 2(1), 137–153.

    Article  Google Scholar 

  11. Han, J., & Liu, Y. (2006). Rumor riding: Anonymizing unstructured peer-to-peer systems. In Network protocols, 2006. ICNP’06. Proceedings of the 2006 14th IEEE international conference on (pp. 22–31). IEEE.

  12. Sherwood, R., Bhattacharjee, B., & Srinivasan, A. (2005). P 5: A protocol for scalable anonymous communication. Journal of Computer Security, 13(6), 839–876.

    Google Scholar 

  13. Levine, B. N., Reiter, M. K., Wang, C., & Wright, M. (2004). Timing attacks in low-latency mix systems. In Financial cryptography (pp. 251–265). Berlin: Springer.

  14. Mittal, P., & Borisov, N. (2008). Information leaks in structured peer-to-peer anonymous communication systems. In Proceedings of the 15th ACM conference on computer and communications security (pp. 267–278). ACM.

  15. Zhu, Y., Fu, X., Graham, B., Bettati, R., & Zhao, W. (2010). Correlation-based traffic analysis attacks on anonymity networks. Parallel and Distributed Systems, IEEE Transactions on, 21(7), 954–967.

    Article  Google Scholar 

  16. Mittal, P., Khurshid, A., Juen, J., Caesar, M., & Borisov, N. (2011). Stealthy traffic analysis of low-latency anonymous communication using throughput fingerprinting. In Proceedings of the 18th ACM conference on computer and communications security (pp. 215–226). ACM.

  17. Medina, A., Lakhina, A., Matta, I., & Byers, J. (2001). BRITE: An approach to universal topology generation. In Modeling, analysis and simulation of computer and telecommunication systems, 2001. Proceedings of the ninth international symposium on (pp. 346–353). IEEE.

  18. Xiang, Z., Zhang, Q., Zhu, W., Zhang, Z., & Zhang, Y.-Q. (2004). Peer-to-peer based multimedia distribution service. Multimedia, IEEE Transactions on, 6(2), 343–355.

    Article  Google Scholar 

  19. Sen, S., & Wang, J. (2004). Analyzing peer-to-peer traffic across large networks. IEEE/ACM Transactions on Networking (ToN), 12(2), 219–232.

    Article  Google Scholar 

  20. Liu, Y., Liu, X., Xiao, L., Ni, L. M., & Zhang, X. (2004). Location-aware topology matching in P2P systems. In INFOCOM 2004. Twenty-third annual joint conference of the IEEE computer and communications societies (Vol. 4, pp. 2220–2230). IEEE.

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Zhejiang University, Hangzhou , 310027, Zhejiang, China

    Imran Memon

  2. School of Computer Science and Engineering, University of Electronic Science and Technology, Chengdu , 611731, Sichuan, China

    Kamenyi Domenic, Wang Yong & Fengli Zhang

  3. Institute of Mathematics and Computer Science, University of Sindh, Jamshoro, Pakistan

    Hina Memon

  4. School of Communication and Information Engineering, University of Electronic Science and Technology, Chengdu , 610054, Sichuan, China

    Rizwan Akhtar

Authors
  1. Imran Memon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kamenyi Domenic
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hina Memon
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rizwan Akhtar
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Wang Yong
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Fengli Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Imran Memon.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Memon, I., Domenic, K., Memon, H. et al. Rumor Riding: An Anonymity Approach for Decentralized Peer to Peer Systems. Wireless Pers Commun 79, 647–660 (2014). https://doi.org/10.1007/s11277-014-1878-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-014-1878-9

Keywords

Search

Navigation