{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:01:24Z","timestamp":1742997684746,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030236953"},{"type":"electronic","value":"9783030236960"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23696-0_22","type":"book-chapter","created":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T23:23:13Z","timestamp":1562023393000},"page":"429-447","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A New Approach to Modelling Centralised Reputation Systems"],"prefix":"10.1007","author":[{"given":"Lydia","family":"Garms","sequence":"first","affiliation":[]},{"given":"Elizabeth A.","family":"Quaglia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,29]]},"reference":[{"key":"22_CR1","unstructured":"Amazon\u2019s third-party sellers ship record-breaking 2 billion items in 2014, but merchant numbers stay flat. https:\/\/techcrunch.com\/2015\/01\/05\/amazon-third-party-sellers-2014\/. Accessed 1 Apr 2019"},{"key":"22_CR2","unstructured":"Travis kalanick says uber has 40 million monthly active riders. https:\/\/techcrunch.com\/2016\/10\/19\/travis-kalanick-says-uber-has-40-million-monthly-active-riders\/. Accessed 1 Apr 2019"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-70630-4_13","volume-title":"Privacy Enhancing Technologies","author":"E Androulaki","year":"2008","unstructured":"Androulaki, E., Choi, S.G., Bellovin, S.M., Malkin, T.: Reputation systems for anonymous networks. In: Borisov, N., Goldberg, I. (eds.) PETS 2008. LNCS, vol. 5134, pp. 202\u2013218. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70630-4_13"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1007\/3-540-39200-9_38","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"M Bellare","year":"2003","unstructured":"Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 614\u2013629. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_38"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Ashby, V. (ed.) ACM CCS 93, 3\u20135 November 1993, pp. 62\u201373. ACM Press, Fairfax (1993)","DOI":"10.1145\/168588.168596"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-30574-3_11","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"M Bellare","year":"2005","unstructured":"Bellare, M., Shi, H., Zhang, C.: Foundations of group signatures: the case of dynamic groups. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 136\u2013153. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30574-3_11"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-14577-3_35","volume-title":"Financial Cryptography and Data Security","author":"J Bethencourt","year":"2010","unstructured":"Bethencourt, J., Shi, E., Song, D.: Signatures of reputation. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 400\u2013407. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14577-3_35"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-662-47854-7_29","volume-title":"Financial Cryptography and Data Security","author":"J Bl\u00f6mer","year":"2015","unstructured":"Bl\u00f6mer, J., Juhnke, J., Kolb, C.: Anonymous and publicly linkable reputation systems. In: B\u00f6hme, R., Okamoto, T. (eds.) FC 2015. LNCS, vol. 8975, pp. 478\u2013488. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47854-7_29"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56\u201373. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_4"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D Boneh","year":"2008","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol. 21(2), 149\u2013177 (2008)","journal-title":"J. Cryptol."},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-39555-5_7","volume-title":"Applied Cryptography and Network Security","author":"J Bootle","year":"2016","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Ghadafi, E., Groth, J.: Foundations of fully dynamic group signatures. In: Manulis, M., Sadeghi, A.-R., Schneider, S. (eds.) ACNS 2016. LNCS, vol. 9696, pp. 117\u2013136. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39555-5_7"},{"key":"22_CR12","unstructured":"Brickell, E.F., Camenisch, J., Chen, L.: Direct anonymous attestation. In: Atluri, V., Pfitzmann, B., McDaniel, P. (eds.) ACM CCS 2004, 25\u201329 October 2004, pp. 132\u2013145. ACM Press, Washington (2004)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Chen, L., Drijvers, M., Lehmann, A., Novick, D., Urian, R.: One TPM to bind them all: fixing TPM 2.0 for provably secure anonymous attestation. In: 2017 IEEE Symposium on Security and Privacy, SP, pp. 901\u2013920. IEEE (2017)","DOI":"10.1109\/SP.2017.22"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-45572-3_1","volume-title":"Trust and Trustworthy Computing","author":"J Camenisch","year":"2016","unstructured":"Camenisch, J., Drijvers, M., Lehmann, A.: Anonymous attestation using the strong Diffie Hellman assumption revisited. In: Franz, M., Papadimitratos, P. (eds.) Trust 2016. LNCS, vol. 9824, pp. 1\u201320. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45572-3_1"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-662-49387-8_10","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"J Camenisch","year":"2016","unstructured":"Camenisch, J., Drijvers, M., Lehmann, A.: Universally composable direct anonymous attestation. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9615, pp. 234\u2013264. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49387-8_10"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1991","author":"D Chaum","year":"1991","unstructured":"Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257\u2013265. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_22"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/11958239_13","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"C Delerabl\u00e9e","year":"2006","unstructured":"Delerabl\u00e9e, C., Pointcheval, D.: Dynamic fully anonymous short group signatures. In: Nguyen, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol. 4341, pp. 193\u2013210. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11958239_13"},{"key":"22_CR18","unstructured":"Kaafarani, A.E., Katsumata, S., Solomon, R.: Anonymous reputation systems achieving full dynamicity from lattices. In: Twenty-Second International Conference on Financial Cryptography and Data Security (forthcoming)"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Garms, L., Martin, K., Ng, S.-L.: Reputation schemes for pervasive social networks with anonymity. In: Proceedings of the fifteenth International Conference on Privacy, Security and Trust (PST 2017), IEEE (2017)","DOI":"10.1109\/PST.2017.00044"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Garms, L., Quaglia, E.A.: A new approach to modelling centralised reputation systems. Cryptology ePrint Archive, Report 2019\/453 (2019). https:\/\/eprint.iacr.org\/2019\/453","DOI":"10.1007\/978-3-030-23696-0_22"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-319-61204-1_15","volume-title":"Applied Cryptography and Network Security","author":"S Ling","year":"2017","unstructured":"Ling, S., Nguyen, K., Wang, H., Xu, Y.: Lattice-based group signatures: achieving full dynamicity with ease. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 293\u2013312. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_15"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-46513-8_14","volume-title":"Selected Areas in Cryptography","author":"A Lysyanskaya","year":"2000","unstructured":"Lysyanskaya, A., Rivest, R.L., Sahai, A., Wolf, S.: Pseudonym systems. In: Heys, H., Adams, C. (eds.) SAC 1999. LNCS, vol. 1758, pp. 184\u2013199. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46513-8_14"},{"issue":"7","key":"22_CR23","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.cose.2009.05.005","volume":"28","author":"FG M\u00e1rmol","year":"2009","unstructured":"M\u00e1rmol, F.G., P\u00e9rez, G.M.: Security threats scenarios in trust and reputation models for distributed systems. Comput. Secur. 28(7), 545\u2013556 (2009)","journal-title":"Comput. Secur."},{"key":"22_CR24","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2014.0316","author":"S-L Ng","year":"2016","unstructured":"Ng, S.-L., Martin, K., Chen, L., Li, Q.: Private reputation retrieval in public - a privacy-aware announcement scheme for vanets. IET Inf. Secur. (2016). https:\/\/doi.org\/10.1049\/iet-ifs.2014.0316","journal-title":"IET Inf. Secur."},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-24747-0_9","volume-title":"Trust Management","author":"E Pavlov","year":"2004","unstructured":"Pavlov, E., Rosenschein, J.S., Topol, Z.: Supporting privacy in decentralized additive reputation systems. In: Jensen, C., Poslad, S., Dimitrakos, T. (eds.) iTrust 2004. LNCS, vol. 2995, pp. 108\u2013119. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24747-0_9"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Petrlic, R., Lutters, S., Sorge, C.: Privacy-preserving reputation management. In: Proceedings of the 29th Annual ACM Symposium on Applied Computing, SAC 2014, pp. 1712\u20131718. ACM, New York (2014)","DOI":"10.1145\/2554850.2554881"},{"key":"22_CR27","unstructured":"Scott, M.: Pairing implementation revisited. Cryptology ePrint Archive, Report 2019\/077 (2019). https:\/\/eprint.iacr.org\/2019\/077"},{"key":"22_CR28","unstructured":"Zhai, E., Wolinsky, D.I., Chen, R., Syta, E., Teng, C., Ford, B.: AnonRep: towards tracking-resistant anonymous reputation. In: 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2016), pp. 583\u2013596. USENIX Association (2016)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23696-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:26:24Z","timestamp":1710260784000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23696-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030236953","9783030236960"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23696-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"29 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/africacrypt2019.aui.ma\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}