Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Wireless Personal Communications
Erschienen in: Wireless Personal Communications 1/2014

01.11.2014

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

verfasst von: Imran Memon, Kamenyi Domenic, Hina Memon, Rizwan Akhtar, Wang Yong, Fengli Zhang

Erschienen in: Wireless Personal Communications | Ausgabe 1/2014

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.
Vorheriger Artikel On the Throughput Capacity of Cooperative Multi-hop Wireless Ad hoc Networks with Multi-flow
Nächster Artikel Design and Implementation to Authentication over a GSM System Using Certificate-Less Public Key Cryptography (CL-PKC)

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Literatur
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.CrossRef
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.CrossRef
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.CrossRef
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.CrossRef
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.MathSciNetCrossRef
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.CrossRef
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.CrossRef
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.
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.CrossRef
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.CrossRef
19.
Sen, S., & Wang, J. (2004). Analyzing peer-to-peer traffic across large networks. IEEE/ACM Transactions on Networking (ToN), 12(2), 219–232.CrossRef
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.
Metadaten
Titel
Rumor Riding: An Anonymity Approach for Decentralized Peer to Peer Systems
verfasst von
Imran Memon
Kamenyi Domenic
Hina Memon
Rizwan Akhtar
Wang Yong
Fengli Zhang
Publikationsdatum
01.11.2014
Verlag
Springer US
Erschienen in
Wireless Personal Communications / Ausgabe 1/2014
Print ISSN: 0929-6212
Elektronische ISSN: 1572-834X
DOI
https://doi.org/10.1007/s11277-014-1878-9

Weitere Artikel der Ausgabe 1/2014

Wireless Personal Communications 1/2014 Zur Ausgabe

OriginalPaper

A Non-cooperative Differential Game Model for Frequency Reuse Based Channel Allocation in Satellite Networks

OriginalPaper

Power Allocation and Transmission Period Selection for Device-to-Device Communication as an Underlay to Cellular Networks

OriginalPaper

A High Gain and Low Flicker Noise CMOS Mixer with Low Flicker Noise Corner Frequency Using Tunable Differential Active Inductor

BriefCommunication

Repeated Public Goods Game Mode for Trust Based P2P Networks

OriginalPaper

Lattice Sphere Decoding for Data Transmission Systems with Special Channel Matrices

OriginalPaper

Semiblind Channel Estimation for Multiuser MIMO-CDMA Systems with Orthogonal Space-Time Block Codes

Neuer Inhalt

    Bildnachweise