{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T02:12:28Z","timestamp":1772676748994,"version":"3.50.1"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61073015"],"award-info":[{"award-number":["61073015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2011CB302305"],"award-info":[{"award-number":["2011CB302305"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2012,1]]},"abstract":"<jats:p>Social trust and recommendation services are the most popular social rating systems today for service providers to learn about the social opinion or popularity of a product, item, or service, such as a book on Amazon, a seller on eBay, a story on Digg or a movie on Netflix. Such social rating systems are very convenient and offer alternative learning environments for decision makers, but they open the door for attackers to manipulate the social rating systems by selfishly promoting or maliciously demoting certain items. Although a fair amount of effort has been made to understand various risks and possible defense mechanisms to counter such attacks, most of the existing work to date has been devoted to studying specific types of attacks and their countermeasures. In this article, we argue that vulnerabilities in social rating systems and their countermeasures should be examined and analyzed in a systematic manner. We first give an overview of the common vulnerabilities and attacks observed in some popular social rating services. Next, we describe three types of attack strategies in two types of social rating systems, including a comprehensive theoretical analysis of their attack effectiveness and attack costs. Three context-aware countermeasures are then presented: (i) hiding user-item relationships, (ii) using confidence weight to distinguish popular and unpopular items, and (iii) incorporating time windows in trust establishment. We also provide an in-depth discussion on how these countermeasures can be used effectively to improve the robustness and trustworthiness of the social rating services.<\/jats:p>","DOI":"10.1145\/2078316.2078319","type":"journal-article","created":{"date-parts":[[2012,1,31]],"date-time":"2012-01-31T14:49:20Z","timestamp":1328021360000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Vulnerabilities and countermeasures in context-aware social rating services"],"prefix":"10.1145","volume":"11","author":[{"given":"Qinyuan","family":"Feng","sequence":"first","affiliation":[{"name":"Peking University, Beijing, China and Georgia Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Liu","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yafei","family":"Dai","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,2,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.99"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572033"},{"key":"e_1_2_1_3_1","unstructured":"Badger D. 2010. Amazon's top reviewers: The bookstore that corrupted hadleyburg. http:\/\/www. dancingbadger.com\/amareview.htm.  Badger D. 2010. Amazon's top reviewers: The bookstore that corrupted hadleyburg. http:\/\/www. dancingbadger.com\/amareview.htm."},{"key":"e_1_2_1_4_1","unstructured":"Brown J. and Morgan J. 2006. Reputation in online markets: Some negative feedback. IBER Working Paper University of California Berkeley CA.  Brown J. and Morgan J. 2006. Reputation in online markets: Some negative feedback. IBER Working Paper University of California Berkeley CA."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.06.027"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.49.10.1407.17308"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646334.687813"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316229"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.214"},{"key":"e_1_2_1_10_1","unstructured":"Feng Q. 2011. Research on malicious and multi-attribute problems in recommender systems Ph.D. dissertation.  Feng Q. 2011. Research on malicious and multi-attribute problems in recommender systems Ph.D. dissertation."},{"key":"e_1_2_1_11_1","volume-title":"Report: Glitch IDs anonymous Amazon reviewers","author":"Harmon A.","year":"2004"},{"key":"e_1_2_1_12_1","unstructured":"Hines M. 2007. Scammers gaming YouTube ratings for profit. InfoWorld. http:\/\/www.infoworld.com\/article\/07\/05\/16\/cybercrooks_gaming google_1.html.  Hines M. 2007. Scammers gaming YouTube ratings for profit. InfoWorld. http:\/\/www.infoworld.com\/article\/07\/05\/16\/cybercrooks_gaming google_1.html."},{"key":"e_1_2_1_13_1","unstructured":"Hoffman K. Zage D. and Nita-Rotaru C. 2007. A survey of attack and defense techniques for reputation systems. Tech. repo. CSD TR &num; 07-013 Purdue University.  Hoffman K. Zage D. and Nita-Rotaru C. 2007. A survey of attack and defense techniques for reputation systems. Tech. repo. CSD TR &num; 07-013 Purdue University."},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 15th Electronic Commerce Conference.","author":"Josang A."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935896"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1754393.1754397"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988726"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278366.1278372"},{"key":"e_1_2_1_19_1","unstructured":"Parsa A. 2009. Belkin's development rep is hiring people to write fake positive amazon reviews. http:\/\/www.thedailybackground.com\/2009\/01\/16\/exclusive-belkins-development-rep-is-hiringpeople-to-write-fake-positive-amazon-reviews\/2009.  Parsa A. 2009. Belkin's development rep is hiring people to write fake positive amazon reviews. http:\/\/www.thedailybackground.com\/2009\/01\/16\/exclusive-belkins-development-rep-is-hiringpeople-to-write-fake-positive-amazon-reviews\/2009."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/245108.245121"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10683-006-4309-2"},{"key":"e_1_2_1_22_1","unstructured":"Saleh K. 2008. An interview with Digg top user. http:\/\/www.invesp.com\/blog\/social-media\/an-interview-with-digg-top-user.html. Social Media.  Saleh K. 2008. An interview with Digg top user. http:\/\/www.invesp.com\/blog\/social-media\/an-interview-with-digg-top-user.html. Social Media."},{"key":"e_1_2_1_23_1","unstructured":"Sciretta P. 2008. IMDb watch are dark knight fanboys burying the godfather&quest; http:\/\/www.slashfilm.com\/2008\/07\/28\/imdb-watch-are-dark-knight-fanboys-burying-the-godfather\/.  Sciretta P. 2008. IMDb watch are dark knight fanboys burying the godfather&quest; http:\/\/www.slashfilm.com\/2008\/07\/28\/imdb-watch-are-dark-knight-fanboys-burying-the-godfather\/."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.04.003"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526725"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.154"},{"key":"e_1_2_1_27_1","unstructured":"Taobaozuan. 2010. http:\/\/www.taobaozuan.com.  Taobaozuan. 2010. http:\/\/www.taobaozuan.com."},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation. USENIX Association","author":"Tran N."},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Von Ahn L. Maurer B. McMillen C. Abraham D. and Blum M. 2008. reCAPTCHA: Human-based character Recognition via web security measures. Science 321 5895 1465--1468.  Von Ahn L. Maurer B. McMillen C. Abraham D. and Blum M. 2008. reCAPTCHA: Human-based character Recognition via web security measures. Science 321 5895 1465--1468.","DOI":"10.1126\/science.1160379"},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Vu L. Papaioannou T. and Aberer K. 2010. Impact of trust management and information sharing to adversarial cost in ranking systems. In IFIP Advances in Information and Communication Technology Trust Management IV 321 108--124.  Vu L. Papaioannou T. and Aberer K. 2010. Impact of trust management and information sharing to adversarial cost in ranking systems. In IFIP Advances in Information and Communication Technology Trust Management IV 321 108--124.","DOI":"10.1007\/978-3-642-13446-3_8"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639714.1639747"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.1318566"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-009-9277-5"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159945"},{"key":"e_1_2_1_35_1","unstructured":"Zarrella D. 2009. Not everything that can be counted counts. http:\/\/pistachioconsulting.com\/shortyawards-gaming\/.  Zarrella D. 2009. Not everything that can be counted counts. http:\/\/pistachioconsulting.com\/shortyawards-gaming\/."}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2078316.2078319","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2078316.2078319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:15Z","timestamp":1750241175000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2078316.2078319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["10.1145\/2078316.2078319"],"URL":"https:\/\/doi.org\/10.1145\/2078316.2078319","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1]]},"assertion":[{"value":"2010-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-02-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}