Abstract
In any system of networks, such as the Internet, a network must take some measure of security into account when deciding whether to allow incoming traffic, and how to configure various filters when making routing decisions. Existing methods tend to rely on the quality of specific hosts in making such decisions, resulting in mostly reactive security policies. In this study we investigate the notion of reputation of a network, and focus on constructing mechanisms that incentivizes the participation of networks to provide information about themselves as well as others. Such information is collected by a centralized reputation agent, who then computes a reputation index for each network. We use a simple mechanism to demonstrate that not only a network has the incentive to provide information about itself (even though it is in general not true), but also that this information can help decrease the estimation error.
The work is partially supported by the NSF under grant CIF-0910765 and CNS-121768, and the U.S. Department of Commerce, National Institute of Standards and Technology (NIST) Technology Innovation Program (TIP) under Cooperative Agreement Number 70NANB9H9008.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Antonakakis, M., Perdisci, R., Dagon, D., Lee, W., Feamster, N.: Building a Dynamic Reputation System for DNS. In: 19th USENIX Security Symposium (August 2010)
Bailey, M., Cooke, E., Myrick, A., Sinha, S.: Practical Darknet Measurement. In: 40th Annual Conference on Information Sciences and Systems (March 2006)
DShield. How To Submit Your Firewall Logs To DShield (September 2011), http://isc.sans.edu/howto.html
Feldman, M., Lai, K., Stoica, I., Chuang, J.: Robust incentive techniques for peer-to-peer networks. In: ACM Conference on Electronic Commerce, pp. 102–111 (2004)
Hanaki, N., Peterhansl, A., Dodds, P., Watts, D.: Cooperation in evolving social networks. Management Science 53(7), 1036–1050 (2007)
Cisco Systems Inc. SpamCop Blocking List - SCBL (May 2011), http://www.spamcop.net/
Damballa Inc. Damballa Threat Reputation System (May 2011), http://www.damballa.com/
Team Cymru Inc. Malicious Activity Insight (May 2011), http://www.team-cymru.com/Services/Insight/
Kamvar, S., Schlosser, M.T., Molina, H.G.: The Eigentrust Algorithm for Reputation Management in P2P Networks. In: International Conference on World Wide Web, pp. 640–651 (2003)
Karir, M., Creyts, K., Mentley, N.: Towards Network Reputation - Analyzing the Makeup of RBLs. In: NANOGG52, Denver, CO (June 2011), http://www.merit.edu/networkresearch/papers/pdf/2011/NANOG52_reputation-nanog.pdf
Barracuda Networks. Barracuda Reputation Blocklist (May 2011), http://www.barracudacentral.org/
The SPAMHAUS project. SBL, XBL, PBL, ZEN Lists ( May 2011), http://www.spamhaus.org/
Ravoaja, A., Anceaume, E.: STORM: A Secure Overlay for P2P Reputation Management. In: International Conference on Self-Adaptive and Self-Organizing Systems, pp. 247–256 (2007)
ShadowServer. The ShadowServer Botnet C&C List (May 2011), http://www.shadowserver.org/
Zhang, Y., van der Schaar, M.: Peer-to-Peer Multimedia Sharing based on Social Norms. Elsevier Journal on Signal Processing: Image Communication Special Issue on Advances in Video Streaming for P2P Networks (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Ardabili, P.N., Liu, M. (2012). Establishing Network Reputation via Mechanism Design. In: Krishnamurthy, V., Zhao, Q., Huang, M., Wen, Y. (eds) Game Theory for Networks. GameNets 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 105. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35582-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-35582-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35581-3
Online ISBN: 978-3-642-35582-0
eBook Packages: Computer ScienceComputer Science (R0)