{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T11:02:53Z","timestamp":1777806173734,"version":"3.51.4"},"reference-count":55,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCS"],"published-print":{"date-parts":[[2022,1,20]]},"abstract":"<jats:p>When peers rate each other, they may rate inaccurately to boost their own reputation or unfairly lower another\u2019s. This could be mitigated by having a reputation server incentivise accurate ratings with a reward. However, assigning rewards becomes challenging when ratings are anonymous, since the reputation server cannot tell which peers to reward for rating accurately. To address this, we propose an anonymous peer rating system in which users can be rewarded for accurate ratings, and we formally define its model and security requirements. In our system ratings are rewarded in batches, so that users claiming their rewards only reveal they authored one in this batch of ratings. To ensure the anonymity set of rewarded users is not reduced, we also split the reputation server into two entities, the Rewarder, who knows which ratings are rewarded, and the Reputation Holder, who knows which users were rewarded. We give a provably secure construction satisfying all the security properties required. For our construction we use a modification of a Direct Anonymous Attestation scheme to ensure that peers can prove their own reputation when rating others, and that multiple feedback on the same subject can be detected. We then use Linkable Ring Signatures to enable peers to be rewarded for their accurate ratings, while still ensuring that ratings are anonymous. Our work results in a system which allows accurate ratings to be rewarded, whilst still providing anonymity of ratings with respect to the central entities managing the system.<\/jats:p>","DOI":"10.3233\/jcs-200113","type":"journal-article","created":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T14:56:17Z","timestamp":1636124177000},"page":"109-165","source":"Crossref","is-referenced-by-count":0,"title":["Anonymity and rewards in peer rating systems1"],"prefix":"10.1177","volume":"30","author":[{"given":"Lydia","family":"Garms","sequence":"first","affiliation":[{"name":"IMDEA Software Institute, Spain. E-mail:\u00a0Lydia.Garms@imdea.org"},{"name":"Information Security Group, Royal Holloway, University of London, UK. E-mails:\u00a0S.Ng@rhul.ac.uk,\u00a0Elizabeth.Quaglia@rhul.ac.uk"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siaw-Lynn","family":"Ng","sequence":"additional","affiliation":[{"name":"Information Security Group, Royal Holloway, University of London, UK. E-mails:\u00a0S.Ng@rhul.ac.uk,\u00a0Elizabeth.Quaglia@rhul.ac.uk"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elizabeth\u00a0A.","family":"Quaglia","sequence":"additional","affiliation":[{"name":"Information Security Group, Royal Holloway, University of London, UK. E-mails:\u00a0S.Ng@rhul.ac.uk,\u00a0Elizabeth.Quaglia@rhul.ac.uk"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giulia","family":"Traverso","sequence":"additional","affiliation":[{"name":"Ernst&Young, Switzerland. E-mail:\u00a0giulia.traverso@ey.ch.com"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/JCS-200113_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_13"},{"key":"10.3233\/JCS-200113_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70630-4_13"},{"key":"10.3233\/JCS-200113_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_10"},{"key":"10.3233\/JCS-200113_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45682-1_33"},{"key":"10.3233\/JCS-200113_ref5","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bellare, H.\u00a0Shi and C.\u00a0Zhang, Foundations of group signatures: The case of dynamic groups, in: CT-RSA 2005, A.\u00a0Menezes, ed., LNCS, Vol.\u00a03376, Springer, Heidelberg, 2005, pp.\u00a0136\u2013153.","DOI":"10.1007\/978-3-540-30574-3_11"},{"issue":"3","key":"10.3233\/JCS-200113_ref6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10207-013-0191-z","article-title":"Anonymous attestation with user-controlled linkability","volume":"12","author":"Bernhard","year":"2013","journal-title":"Int. J. Inf. Secur."},{"key":"10.3233\/JCS-200113_ref7","doi-asserted-by":"crossref","unstructured":"J.\u00a0Bethencourt, E.\u00a0Shi and D.\u00a0Song, Signatures of reputation, in: FC 2010, R.\u00a0Sion, ed., LNCS, Vol.\u00a06052, Springer, Heidelberg, 2010, pp.\u00a0400\u2013407.","DOI":"10.1007\/978-3-642-14577-3_35"},{"key":"10.3233\/JCS-200113_ref8","doi-asserted-by":"crossref","unstructured":"J.\u00a0Bl\u00f6mer, J.\u00a0Bobolz, D.\u00a0Diemert and F.\u00a0Eidens, Updatable anonymous credentials and applications to incentive systems, in: ACM CCS 2019, ACM Press, 2019, pp.\u00a01671\u20131685.","DOI":"10.1145\/3319535.3354223"},{"key":"10.3233\/JCS-200113_ref9","doi-asserted-by":"crossref","unstructured":"J.\u00a0Bl\u00f6mer, F.\u00a0Eidens and J.\u00a0Juhnke, Practical, anonymous, and publicly linkable universally-composable reputation systems, in: CT-RSA 2018, N.P.\u00a0Smart, ed., LNCS, Vol.\u00a010808, Springer, Heidelberg, 2018, pp.\u00a0470\u2013490.","DOI":"10.1007\/978-3-319-76953-0_25"},{"key":"10.3233\/JCS-200113_ref10","doi-asserted-by":"crossref","unstructured":"J.\u00a0Bl\u00f6mer, J.\u00a0Juhnke and C.\u00a0Kolb, Anonymous and publicly linkable reputation systems, in: FC 2015, R.\u00a0B\u00f6hme and T.\u00a0Okamoto, eds, LNCS, Vol.\u00a08975, Springer, Heidelberg, 2015, pp.\u00a0478\u2013488.","DOI":"10.1007\/978-3-662-47854-7_29"},{"key":"10.3233\/JCS-200113_ref11","doi-asserted-by":"crossref","unstructured":"J.\u00a0Bobolz, F.\u00a0Eidens, S.\u00a0Krenn, D.\u00a0Slamanig and C.\u00a0Striecks, Privacy-preserving incentive systems with highly efficient point-collection, in: Proceedings of the 2020 ACM Asia Conference on Computer and Communications Security, 2020.","DOI":"10.1145\/3320269.3384769"},{"key":"10.3233\/JCS-200113_ref12","doi-asserted-by":"crossref","unstructured":"E.F.\u00a0Brickell, J.\u00a0Camenisch and L.\u00a0Chen, Direct anonymous attestation, in: ACM CCS 2004, V.\u00a0Atluri, B.\u00a0Pfitzmann and P.\u00a0McDaniel, eds, ACM Press, 2004, pp.\u00a0132\u2013145.","DOI":"10.1145\/1030083.1030103"},{"key":"10.3233\/JCS-200113_ref13","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/j.future.2018.01.018","article-title":"Collaborative circuit designs using the CRAFT repository","volume":"94","author":"Brinckman","year":"2019","journal-title":"Future Generation Computer Systems"},{"key":"10.3233\/JCS-200113_ref14","doi-asserted-by":"crossref","unstructured":"J.\u00a0Camenisch, M.\u00a0Drijvers and A.\u00a0Lehmann, Universally composable direct anonymous attestation, in: PKC 2016, Part\u00a0II, C.M.\u00a0Cheng, K.M.\u00a0Chung, G.\u00a0Persiano and B.Y.\u00a0Yang, eds, LNCS, Vol.\u00a09615, Springer, Heidelberg, 2016, pp.\u00a0234\u2013264.","DOI":"10.1007\/978-3-662-49387-8_10"},{"key":"10.3233\/JCS-200113_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_25"},{"key":"10.3233\/JCS-200113_ref16","doi-asserted-by":"crossref","unstructured":"J.\u00a0Camenisch, M.\u00a0Kohlweiss, A.\u00a0Rial and C.\u00a0Sheedy, Blind and anonymous identity-based encryption and authorised private searches on public key encrypted data, in: PKC 2009, S.\u00a0Jarecki and G.\u00a0Tsudik, eds, LNCS, Vol.\u00a05443, Springer, Heidelberg, 2009, pp.\u00a0196\u2013214.","DOI":"10.1007\/978-3-642-00468-1_12"},{"key":"10.3233\/JCS-200113_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"10.3233\/JCS-200113_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_8"},{"key":"10.3233\/JCS-200113_ref19","doi-asserted-by":"crossref","unstructured":"D.\u00a0Chaum and E.\u00a0van Heyst, Group signatures, in: EUROCRYPT\u201991, D.W.\u00a0Davies, ed., LNCS, Vol.\u00a0547, Springer, Heidelberg, 1991, pp.\u00a0257\u2013265.","DOI":"10.1007\/3-540-46416-6_22"},{"key":"10.3233\/JCS-200113_ref20","doi-asserted-by":"crossref","unstructured":"L.\u00a0Chen, Q.\u00a0Li, K.M.\u00a0Martin and S.L.\u00a0Ng, A\u00a0privacy-aware reputation-based announcement scheme for vanets, in: Wireless Vehicular Communications (WiVeC), 2013 IEEE 5th International Symposium on, IEEE, 2013, pp.\u00a01\u20135.","DOI":"10.1109\/wivec.2013.6698222"},{"issue":"4","key":"10.3233\/JCS-200113_ref21","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1049\/iet-ifs.2014.0316","article-title":"Private reputation retrieval in public\u00a0\u2013 a privacy-aware announcement scheme for vanets","volume":"11","author":"Chen","year":"2017","journal-title":"IET Information Security"},{"key":"10.3233\/JCS-200113_ref22","doi-asserted-by":"crossref","unstructured":"J.\u00a0Chuang, Designing incentive mechanisms for peer-to-peer systems, in: 1st IEEE International Workshop on Grid Economics and Business Models, 2004. GECON 2004, IEEE, 2004, pp.\u00a067\u201381.","DOI":"10.1109\/GECON.2004.1317584"},{"key":"10.3233\/JCS-200113_ref23","doi-asserted-by":"publisher","first-page":"72427","DOI":"10.1109\/ACCESS.2018.2880297","article-title":"Sphinx: A colluder-resistant trust mechanism for collaborative intrusion detection","volume":"6","author":"Cordero","year":"2018","journal-title":"IEEE Access"},{"key":"10.3233\/JCS-200113_ref24","doi-asserted-by":"crossref","unstructured":"C.\u00a0Dellarocas, Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior, in: Proceedings of the 2nd ACM Conference on Electronic Commerce, 2001.","DOI":"10.1145\/352871.352889"},{"key":"10.3233\/JCS-200113_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45748-8_24"},{"key":"10.3233\/JCS-200113_ref26","doi-asserted-by":"crossref","unstructured":"A.\u00a0El Kaafarani, S.\u00a0Katsumata and R.\u00a0Solomon, Anonymous reputation systems achieving full dynamicity from lattices, in: Proceedings of the 22nd International Conference on Financial Cryptography and Data Security (FC), 2018.","DOI":"10.1007\/978-3-662-58387-6_21"},{"key":"10.3233\/JCS-200113_ref27","doi-asserted-by":"crossref","unstructured":"A.\u00a0Fiat and A.\u00a0Shamir, How to prove yourself: Practical solutions to identification and signature problems, in: CRYPTO\u201986, A.M.\u00a0Odlyzko, ed., LNCS, Vol.\u00a0263, Springer, Heidelberg, 1987, pp.\u00a0186\u2013194.","DOI":"10.1007\/3-540-47721-7_12"},{"issue":"16","key":"10.3233\/JCS-200113_ref28","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","article-title":"Pairings for cryptographers","volume":"156","author":"Galbraith","year":"2008","journal-title":"Discrete Applied Mathematics"},{"key":"10.3233\/JCS-200113_ref29","doi-asserted-by":"crossref","unstructured":"L.\u00a0Garms, K.M.\u00a0Martin and S.L.\u00a0Ng, Reputation schemes for pervasive social networks with anonymity, in: Proceedings of the Fifteenth International Conference on Privacy, Security and Trust (PST 2017), IEEE, 2017, pp.\u00a01\u20136.","DOI":"10.1109\/PST.2017.00044"},{"key":"10.3233\/JCS-200113_ref30","doi-asserted-by":"crossref","unstructured":"L.\u00a0Garms, S.L.\u00a0Ng, E.A.\u00a0Quaglia and G.\u00a0Traverso, Anonymity and rewards in peer rating systems, in: SCN 20, LNCS, Springer, Heidelberg, 2020, pp.\u00a0277\u2013297.","DOI":"10.1007\/978-3-030-57990-6_14"},{"key":"10.3233\/JCS-200113_ref31","doi-asserted-by":"crossref","unstructured":"L.\u00a0Garms and E.A.\u00a0Quaglia, A\u00a0new approach to modelling centralised reputation systems, in: AFRICACRYPT 19, J.\u00a0Buchmann, A.\u00a0Nitaj and T.\u00a0Rachidi, eds, LNCS, Vol.\u00a011627, Springer, Heidelberg, 2019, pp.\u00a0429\u2013447.","DOI":"10.1007\/978-3-030-23696-0_22"},{"key":"10.3233\/JCS-200113_ref32","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.eswa.2019.02.010","article-title":"Designing and implementing a collaborative health knowledge system","volume":"126","author":"Giannoulis","year":"2019","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"10.3233\/JCS-200113_ref34","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","article-title":"A\u00a0digital signature scheme secure against adaptive chosen-message attacks","volume":"17","author":"Goldwasser","year":"1988","journal-title":"SIAM Journal on Computing"},{"key":"10.3233\/JCS-200113_ref35","doi-asserted-by":"crossref","unstructured":"G.\u00a0Hartung, M.\u00a0Hoffmann, M.\u00a0Nagel and A.\u00a0Rupp, BBA+: Improving the security and applicability of privacy-preserving point collection, in: ACM CCS 2017, B.M.\u00a0Thuraisingham, D.\u00a0Evans, T.\u00a0Malkin and D.\u00a0Xu, eds, ACM Press, 2017, pp.\u00a01925\u20131942.","DOI":"10.1145\/3133956.3134071"},{"key":"10.3233\/JCS-200113_ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ARES.2013.107"},{"issue":"1","key":"10.3233\/JCS-200113_ref37","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/1592451.1592452","article-title":"A\u00a0survey of attack and defense techniques for reputation systems","volume":"42","author":"Hoffman","year":"2009","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"10.3233\/JCS-200113_ref39","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1515\/popets-2016-0016","article-title":"Black-box accumulation: Collecting incentives in a privacy-preserving way","volume":"2016","author":"Jager","year":"2016","journal-title":"PoPETs"},{"key":"10.3233\/JCS-200113_ref40","unstructured":"A.\u00a0J\u00f8sang and J.\u00a0Golbeck, Challenges for robust trust and reputation systems, in: 5th International Workshop on Security and Trust Management (STM 2009), 2009."},{"key":"10.3233\/JCS-200113_ref41","doi-asserted-by":"crossref","unstructured":"B.\u00a0Libert, K.G.\u00a0Paterson and E.A.\u00a0Quaglia, Anonymous broadcast encryption: Adaptive security and efficient constructions in the standard model, in: PKC 2012, M.\u00a0Fischlin, J.\u00a0Buchmann and M.\u00a0Manulis, eds, LNCS, Vol.\u00a07293, Springer, Heidelberg, 2012, pp.\u00a0206\u2013224.","DOI":"10.1007\/978-3-642-30057-8_13"},{"key":"10.3233\/JCS-200113_ref42","doi-asserted-by":"crossref","unstructured":"J.K.\u00a0Liu, V.K.\u00a0Wei and D.S.\u00a0Wong, Linkable spontaneous anonymous group signature for ad hoc groups (extended abstract), in: ACISP 04, H.\u00a0Wang, J.\u00a0Pieprzyk and V.\u00a0Varadharajan, eds, LNCS, Vol.\u00a03108, Springer, Heidelberg, 2004, pp.\u00a0325\u2013335.","DOI":"10.1007\/978-3-540-27800-9_28"},{"key":"10.3233\/JCS-200113_ref43","doi-asserted-by":"crossref","unstructured":"A.\u00a0Lysyanskaya, R.L.\u00a0Rivest, A.\u00a0Sahai and S.\u00a0Wolf, Pseudonym systems, in: SAC 1999, H.M.\u00a0Heys and C.M.\u00a0Adams, eds, LNCS, Vol.\u00a01758, Springer, Heidelberg, 1999, pp.\u00a0184\u2013199.","DOI":"10.1007\/3-540-46513-8_14"},{"issue":"7","key":"10.3233\/JCS-200113_ref44","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.cose.2009.05.005","article-title":"Security threats scenarios in trust and reputation models for distributed systems","volume":"28","author":"M\u00e1rmol","year":"2009","journal-title":"Computers & Security"},{"key":"10.3233\/JCS-200113_ref45","doi-asserted-by":"publisher","DOI":"10.1109\/Trustcom.2015.423"},{"key":"10.3233\/JCS-200113_ref46","doi-asserted-by":"publisher","DOI":"10.1109\/WETICE.2016.55"},{"key":"10.3233\/JCS-200113_ref47","doi-asserted-by":"crossref","unstructured":"P.\u00a0Paillier, Public-key cryptosystems based on composite degree residuosity classes, in: EUROCRYPT\u201999, J.\u00a0Stern, ed., LNCS, Vol.\u00a01592, Springer, Heidelberg, 1999, pp.\u00a0223\u2013238.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"10.3233\/JCS-200113_ref48","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2005.1558565"},{"key":"10.3233\/JCS-200113_ref49","doi-asserted-by":"crossref","unstructured":"E.\u00a0Pavlov, J.S.\u00a0Rosenschein and Z.\u00a0Topol, Supporting privacy in decentralized additive reputation systems, in: International Conference on Trust Management, Springer, 2004, pp.\u00a0108\u2013119.","DOI":"10.1007\/978-3-540-24747-0_9"},{"key":"10.3233\/JCS-200113_ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2554850.2554881"},{"key":"10.3233\/JCS-200113_ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85735-8_8"},{"key":"10.3233\/JCS-200113_ref52","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45682-1_32"},{"key":"10.3233\/JCS-200113_ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16441-5_14"},{"key":"10.3233\/JCS-200113_ref54","doi-asserted-by":"publisher","DOI":"10.1145\/2994539.2994546"},{"key":"10.3233\/JCS-200113_ref55","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2006.286695"},{"key":"10.3233\/JCS-200113_ref56","doi-asserted-by":"crossref","unstructured":"G.\u00a0Traverso, D.\u00a0Butin, J.A.\u00a0Buchmann and A.\u00a0Palesandro, Coalition-resistant peer rating for long-term confidentiality, in: 2018 16th Annual Conference on Privacy, Security and Trust (PST), 2018, pp.\u00a01\u201310.","DOI":"10.1109\/PST.2018.8514218"},{"key":"10.3233\/JCS-200113_ref57","unstructured":"E.\u00a0Zhai, D.I.\u00a0Wolinsky, R.\u00a0Chen, E.\u00a0Syta, C.\u00a0Teng and B.\u00a0Ford, AnonRep: Towards tracking-resistant anonymous reputation, in: 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 16), USENIX Association, 2016, pp.\u00a0583\u2013596."}],"container-title":["Journal of Computer Security"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JCS-200113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:45:34Z","timestamp":1777495534000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospress&doi=10.3233\/JCS-200113"}},"subtitle":[],"editor":[{"given":"Clemente","family":"Galdi","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Kolesnikov","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2022,1,20]]},"references-count":55,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/jcs-200113","relation":{},"ISSN":["1875-8924","0926-227X"],"issn-type":[{"value":"1875-8924","type":"electronic"},{"value":"0926-227X","type":"print"}],"subject":[],"published":{"date-parts":[[2022,1,20]]}}}