skip to main content
10.1145/1866886.1866896acmconferencesArticle/Chapter ViewAbstractPublication Pagesinsider-threatsConference Proceedingsconference-collections
research-article

ReDS: reputation for directory services in P2P systems

Published: 08 October 2010 Publication History

Abstract

P2P systems rely on directory services for locating peers with the desired content and services. Directory services are themselves decentralized, such as with distributed hash tables (DHTs) that allow for efficient locating of objects without a centralized directory. As a system distributed over a diverse set of untrusted nodes, however, directory services must be resilient to adversarial behavior by such malicious insiders. While redundancy-based DHTs such as Salsa and Halo mitigate the effects of adversarial behavior, they incur substantial overhead due to redundant lookups. We propose Reputation for Directory Services (ReDS), a framework for using reputation management to enhance the security and reduce the costs of redundancy-based DHTs in the face of insider attacks. We present ReDS designs for both Salsa and Halo, and we show that peers can significantly boost the success rates of directory lookups by considering past performance. For example, our simulations show that Salsa-ReDS can reduce lookup failure rates by up to 94%. We find that applying ReDS effectively cuts the redundancy required by both Salsa and Halo in half to get comparable results.

References

[1]
}}Akamai netsession interface. http://www.akamai.com/html/misc/akamai_client/netsession_interface_overview.htm.
[2]
}}N. Borisov, G. Danezis, P. Mittal, and P. Tabriz. Denial of service or denial of security? How attacks on reliability can compromise anonymity. In CCS, Oct. 2007.
[3]
}}George Danezis and Prateek Mittal. SybilInfer: Detecting sybil nodes using social networks, In NDSS, Feb. 2009.
[4]
}}Kevin Hoffman, David Zage, and Cristina Nita-Rotaru. A survey of attack and defense techniques for reputation systems. ACM Comput. Surv., 42(1):1--31, 2009.
[5]
}}Apu Kapadia and Nikos Triandopoulos. Halo: High-assurance locate for distributed hash tables. In NDSS, Feb. 2008.
[6]
}}B. Lagesse, M. Kumar, and M. Wright. Arex: An adaptive system for secure resource access. In P2P, Sep. 2008.
[7]
}}P. Mittal and N. Borisov. Information leaks in structured peer-to-peer anonymous communications. In CCS, Oct. 2008.
[8]
}}Arjun Nambiar and Matthew Wright. Salsa: a structured approach to large-scale anonymity. In CCS, Oct. 2006.
[9]
}}P2P telephony explained - for geeks only. http://www.skype.com/help/guides/p2pexplained/.
[10]
}}Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. ACM SIGCOMM Conference, Aug. 2001.
[11]
}}A. Tran, N. Hopper, and Y. Kim. Hashing it out in public: common failure modes of DHT-based anonymity schemes. In WPES, Nov. 2009.
[12]
}}Matthew Wright, Apu Kapadia, Mohan Kumar, and Apurv Dhadphale. ReDS: Reputation for directory services in P2P systems (extended abstract). In CSIIRW, Apr. 2010.
[13]
}}Haifeng Yu, Phillip B. Gibbons, Michael Kaminsky, and Feng Xiao. SybilLimit: A near-optimal social network defense against sybil attacks. In IEEE Symp. on Security and Privacy, May 2008.

Cited By

View all
  • (2018)RETRACTED ARTICLE: Load balancing in wireless networks using reputation-ReDS in the magnified distributed hash tableMultimedia Tools and Applications10.1007/s11042-018-5620-677:8(10347-10364)Online publication date: 1-Apr-2018
  • (2014)ReDSIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2013.23125:2(321-331)Online publication date: 1-Feb-2014

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
Insider Threats '10: Proceedings of the 2010 ACM workshop on Insider threats
October 2010
70 pages
ISBN:9781450300926
DOI:10.1145/1866886
  • General Chair:
  • Ehab Al-Shaer,
  • Program Chairs:
  • Brent Lagesse,
  • Craig Shue
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 October 2010

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. dhts
  2. peer-to-peer networks
  3. reputation

Qualifiers

  • Research-article

Conference

CCS '10
Sponsor:

Acceptance Rates

Insider Threats '10 Paper Acceptance Rate 7 of 14 submissions, 50%;
Overall Acceptance Rate 7 of 14 submissions, 50%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 23 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2018)RETRACTED ARTICLE: Load balancing in wireless networks using reputation-ReDS in the magnified distributed hash tableMultimedia Tools and Applications10.1007/s11042-018-5620-677:8(10347-10364)Online publication date: 1-Apr-2018
  • (2014)ReDSIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2013.23125:2(321-331)Online publication date: 1-Feb-2014

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media