{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T17:48:33Z","timestamp":1773078513144,"version":"3.50.1"},"reference-count":32,"publisher":"Emerald","issue":"5","license":[{"start":{"date-parts":[[2007,10,2]],"date-time":"2007-10-02T00:00:00Z","timestamp":1191283200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,10,2]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>The purpose of this paper is to present a P2P network security pricing model that promotes more secure online information sharing in P2P networks through the creation of networks with increased resistance to malicious code propagation. Online information sharing is at an all\u2010time high partly due to the recent growth in, and use of, online peer\u2010to\u2010peer (P2P) networks.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>The model integrates current research findings in incentive compatible network pricing with recent developments in complex network theory. File download prices in P2P networks are linked to network security using a graph theory measurement called the Pearson coefficient. The Pearson coefficient indicates a structural dimension of scale\u2010free networks (scale\u2010free networks like the internet) called preferential attachment. Preferential attachment refers to the network property where the probability for a node to connect to a new node is greater if the new node already has a high number of connections.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>The P2P network security pricing model concept is illustrated to show how the model functions to create more secure P2P networks.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Research limitations\/implications<\/jats:title><jats:p>Future research in P2P network security pricing should focus on testing the model presented in this paper by numerical experiments and simulation including the tracking of malicious code propagation on networks grown under the pricing model.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>The P2P network security pricing model demonstrated here is a different approach to network security that has a strong potential to impact on the future security of P2P and other computer based networks.<\/jats:p><\/jats:sec>","DOI":"10.1108\/14684520710832351","type":"journal-article","created":{"date-parts":[[2007,10,13]],"date-time":"2007-10-13T07:06:20Z","timestamp":1192259180000},"page":"682-693","source":"Crossref","is-referenced-by-count":4,"title":["Protecting online information sharing in peer\u2010to\u2010peer (P2P) networks"],"prefix":"10.1108","volume":"31","author":[{"given":"Daniel O.","family":"Rice","sequence":"first","affiliation":[]}],"member":"140","reference":[{"key":"key2022031820320011200_b1","doi-asserted-by":"crossref","unstructured":"Agre, P. (2003), \u201cP2P and the promise of internet equality\u201d, Communications of the ACM, Vol. 46 No. 2, pp. 39\u201042.","DOI":"10.1145\/606272.606298"},{"key":"key2022031820320011200_b2","unstructured":"Barabasi, A. (2003), Linked: How Everything is Connected to Everything Else and What It Means for Business, Science, and Everyday Life, Penguin, New York, NY."},{"key":"key2022031820320011200_b3","unstructured":"Bollobas, B. (2001), Random Graphs, Cambridge University Press, Cambridge."},{"key":"key2022031820320011200_b4","doi-asserted-by":"crossref","unstructured":"Chang, D. and Young, C. (2005), \u201cInfection dynamics on the internet\u201d, Computers and Security, Vol. 24, pp. 280\u20106.","DOI":"10.1016\/j.cose.2005.03.004"},{"key":"key2022031820320011200_b6","doi-asserted-by":"crossref","unstructured":"Chung, F. and Lu, L. (2006), Complex Graphs and Networks, American Mathematical Society (AMS), Providence, RI.","DOI":"10.1090\/cbms\/107"},{"key":"key2022031820320011200_b7","doi-asserted-by":"crossref","unstructured":"Cocchi, R., Estrin, D., Shenker, S. and Zhang, L. (1993), \u201cPricing in computer networks: motivation, formulation, and example\u201d, ACM\/IEEE Transactions on Networking, Vol. 1 No. 6, pp. 614\u201027.","DOI":"10.1109\/90.266050"},{"key":"key2022031820320011200_b8","unstructured":"Cybergeography (2007), Graph, available at: www.cybergeography.org (accessed March 15, 2007)."},{"key":"key2022031820320011200_b9","doi-asserted-by":"crossref","unstructured":"Doyle, J., Alderson, D., Li, L., Low, S., Roughan, M., Shalunov, S., Tanaka, R. and Willinger, W. (2005), \u201cThe robust yet fragile nature of the internet\u201d, The Proceedings of the National Academy of Sciences (PNAS), Vol. 102 No. 41, pp. 14497\u2010502.","DOI":"10.1073\/pnas.0501426102"},{"key":"key2022031820320011200_b10","unstructured":"Ebel, H., Mielsch, L. and Bornholdt, S. (2002), \u201cScale\u2010free topology of e\u2010mail networks\u201d, arXiv.cond\u2010mat\/0201476v2, available at: http:\/\/arxiv.org\/PS_cache\/cond\u2010mat\/pdf\/0201\/0201476v2.pdf."},{"key":"key2022031820320011200_b11","unstructured":"F\u2010Secure (2005), F\u2010Secure Virus Descriptions: P2P\u2010Worm, F\u2010Secure Computer Virus Information Pages, available at: www.f\u2010secure.com\/v\u2010descs\/p2pworm.shtml (accessed November 17, 2005)."},{"key":"key2022031820320011200_b12","unstructured":"Gehrke, N. and Seidenfaden, L. (2004), \u201cInside peer\u2010to\u2010peer \u2013 some theory and an empirical analysis of a file sharing network\u201d, Proceedings of the Tenth Americas Conference on Information Systems, New York, NY, pp. 4006\u201016."},{"key":"key2022031820320011200_b13","unstructured":"Gupta, A., Stahl, D. and Whinston, A. (1996), \u201cEconomic issues in electronic commerce\u201d, in Kalakota, R. and Whinston, A.B. (Eds), Readings in Electronic Commerce, Economic Issues in Electronic Commerce, Addison\u2010Wesley, Reading, MA, pp. 197\u2010228."},{"key":"key2022031820320011200_b14","doi-asserted-by":"crossref","unstructured":"Gupta, A., Stahl, D. and Whinston, A. (1999), \u201cThe economics of network management\u201d, Communications of the ACM, Vol. 42 No. 9, pp. 57\u201063.","DOI":"10.1145\/315762.315772"},{"key":"key2022031820320011200_b15","doi-asserted-by":"crossref","unstructured":"Gupta, A., Linden, L., Stahl, D. and Whinston, A. (2001), \u201cBenefits and costs of adopting usage\u2010based pricing in a subnetwork\u201d, Information Technology and Management, Vol. 2 No. 2, pp. 175\u201091.","DOI":"10.1023\/A:1011413602155"},{"key":"key2022031820320011200_b16","doi-asserted-by":"crossref","unstructured":"Henderson, T., Crowcroft, J. and Bhatti, S. (2001), \u201cCongestion pricing: paying your way in communication networks\u201d, IEEE internet Computing, Vol. 5 No. 5, pp. 85\u20109.","DOI":"10.1109\/4236.957899"},{"key":"key2022031820320011200_b17","unstructured":"Kariaginnis, T., Broido, A., Brownlee, N., Claffy, K. and Faloutsos, M. (2004), \u201cIs P2P dying or just hiding?\u201d, Proceedings of the GLOBECOM 2004 Conference, IEEE Computer Society Press, Dallas, TX."},{"key":"key2022031820320011200_b18","unstructured":"LIRMM (2007), Graph of the LIRMM Co\u2010Author Matrix, available at: www.lirmm.fr\u223cboutin\/research.html (accessed March 15, 2007)."},{"key":"key2022031820320011200_b19","unstructured":"Mackie\u2010Mason, J. and Varian, H. (1995), \u201cPricing the internet\u201d, in Kahin, B. and Keller, J. (Eds), Public Access to the internet, The MIT Press, Cambridge, MA, pp. 269\u2010314."},{"key":"key2022031820320011200_b20","doi-asserted-by":"crossref","unstructured":"Newman, M. (2001), \u201cThe structure of scientific collaboration networks\u201d, Proceedings of the National Academy of Science, Vol. 98, pp. 404\u20109.","DOI":"10.1073\/pnas.98.2.404"},{"key":"key2022031820320011200_b21","doi-asserted-by":"crossref","unstructured":"Newman, M. (2002a), \u201cAssortative mixing in networks\u201d, Physical Review Letters, Vol. 89 No. 20, id. 208701.","DOI":"10.1103\/PhysRevLett.89.208701"},{"key":"key2022031820320011200_b22","unstructured":"Newman, M. (2002b), \u201cRandom graphs as models of networks\u201d, arXiv.cond\u2010mat\/0202208v1, available at: www.arxiv.org\/abs\/cond\u2010mat\/0202208v1."},{"key":"key2022031820320011200_b23","unstructured":"Odlyzko, A. (1997), \u201cA modest proposal for preventing internet congestion\u201d, DIMACS Technical Report 97\u201068, Center for Discrete Mathematics and Theoretical Computer Science."},{"key":"key2022031820320011200_b24","doi-asserted-by":"crossref","unstructured":"Pastor\u2010Satorras, R. and Vespignani, A. (2003), \u201cEpidemics and immunization in scale\u2010free networks\u201d, in Bornholdt, S. and Schuster, H. (Eds), Handbook of Graphs and Networks: from the Genome to the internet, Wiley\u2010VCH, Darmstadt, pp. 111\u201030.","DOI":"10.1002\/3527602755.ch5"},{"key":"key2022031820320011200_b25","unstructured":"Patch, K. (2003), \u201cSocial networks sturdier than \u2018Net\u2019\u201d, The Latest Technology Research News, available at: www.TRNmag.com (accessed March 3, 2007)."},{"key":"key2022031820320011200_b26","unstructured":"Schneier, B. (2003), Beyond Fear: Thinking Sensibly about Security in an Uncertain World, Copernicus Books, New York, NY."},{"key":"key2022031820320011200_b27","doi-asserted-by":"crossref","unstructured":"Shoder, D. and Fischbach, K. (2003), \u201cPeer\u2010to\u2010peer prospects, the P2P design philosophy needs far more detail before we can appreciate a clear picture of its potential\u201d, Communications of the ACM, Vol. 46 No. 2, pp. 27\u20109.","DOI":"10.1145\/606272.606294"},{"key":"key2022031820320011200_b28","doi-asserted-by":"crossref","unstructured":"Spencer, J. (2006), \u201cBeyond file sharing \u2013 commerce in peer\u2010to\u2010peer networks: surveying the landscape\u201d, Journal of internet Commerce, Vol. 5 No. 2, pp. 1\u201019.","DOI":"10.1300\/J179v05n02_01"},{"key":"key2022031820320011200_b29","unstructured":"Symantec (2006) Vol. 10, Symantec internet Security Report: Trends for January 2006\u2010June 2006, in Turner, D. and Entwisle, S. (Eds), Vol. 10, available at: www.symantec.com (accessed March 15th, 2007)."},{"key":"key2022031820320011200_b30","unstructured":"Taylor, R. and Subramaniam, N. (2004), \u201cNetworking in the new millennium: business applications for peer\u2010to\u2010peer and grid computing\u201d, Proceedings of the Tenth Americas Conference on Information Systems, New York, NY, pp. 4017\u201024."},{"key":"key2022031820320011200_b31","doi-asserted-by":"crossref","unstructured":"Watts, D. (1999), Small Worlds: The Dynamics of Networks between Order and Randomness, Princeton Studies in Complexity, Princeton University Press, Princeton, NJ.","DOI":"10.1515\/9780691188331"},{"key":"key2022031820320011200_b32","unstructured":"Watts, D. (2003), Six Degrees: The Science of a Connected Age, Norton Press, New York, NY."},{"key":"key2022031820320011200_frg5","unstructured":"Chen, Q., Chang, H., Govindan, R., Jamin, S., Shenker, S.J. and Willinger, W. (2002), \u201cThe origin of power laws in internet topologies revisited\u201d, Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE Computer Society."}],"container-title":["Online Information Review"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/14684520710832351","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/14684520710832351\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/14684520710832351\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:40:53Z","timestamp":1753404053000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/oir\/article\/31\/5\/682-693\/314594"}},"subtitle":["A proposal for a P2P network security pricing model"],"short-title":[],"issued":{"date-parts":[[2007,10,2]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2007,10,2]]}},"alternative-id":["10.1108\/14684520710832351"],"URL":"https:\/\/doi.org\/10.1108\/14684520710832351","relation":{},"ISSN":["1468-4527"],"issn-type":[{"value":"1468-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2007,10,2]]}}}