{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:46:16Z","timestamp":1756385176873,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031649530"},{"type":"electronic","value":"9783031649547"}],"license":[{"start":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T00:00:00Z","timestamp":1728950400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T00:00:00Z","timestamp":1728950400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-64954-7_18","type":"book-chapter","created":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T10:02:17Z","timestamp":1728900137000},"page":"345-368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Street Rep: A Privacy-Preserving Reputation Aggregation System"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Hauser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shirin","family":"Nilizadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Shoshitaishvili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ni","family":"Trieu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srivatsan","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Kruegel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Vigna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,15]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Aguilar-Melchor, C., Barrier, J., Fousse, L., Killijian, M.O.: Xpir: Private information retrieval for everyone. In: Proceedings on Privacy Enhancing Technologies, vol.\u00a02016, pp. 155\u2013174 (2016)","DOI":"10.1515\/popets-2016-0010"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Aguilar-Melchor, C., Barrier, J., Fousse, L., Killijian, M.O.: Xpir: private information retrieval for everyone. https:\/\/github.com\/XPIR-team\/XPIR (2016)","DOI":"10.1515\/popets-2016-0010"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Angel, S., Chen, H., Laine, K., Setty, S.: PIR with compressed queries and amortized query processing. In: 2018 IEEE Symposium on Security and Privacy (SP), pp. 962\u2013979 (2018). https:\/\/doi.org\/10.1109\/SP.2018.00062","DOI":"10.1109\/SP.2018.00062"},{"key":"18_CR4","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":"18_CR5","doi-asserted-by":"publisher","unstructured":"Chaum, D.: Blind signature system. In: Chaum, D. (ed.) Advances in Cryptology, pp. 153\u2013153. Springer, Cham (1984). https:\/\/doi.org\/10.1007\/978-1-4684-4730-9_14","DOI":"10.1007\/978-1-4684-4730-9_14"},{"issue":"6","key":"18_CR6","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM (JACM) 45(6), 965\u2013981 (1998)","journal-title":"J. ACM (JACM)"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptology 10(4), 233\u2013260 (1997). https:\/\/doi.org\/10.1007\/s001459900030","DOI":"10.1007\/s001459900030"},{"key":"18_CR8","unstructured":"Corrigan-Gibbs, H., Boneh, D.: PRIO: private, robust, and scalable computation of aggregate statistics. In: Proceedings of the 14th USENIX Conference on Networked Systems Design and Implementation, NSDI 2017, pp. 259-282. USENIX Association, USA (2017)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-36413-7_5","volume-title":"Security in Communication Networks","author":"Y Dodis","year":"2003","unstructured":"Dodis, Y., Reyzin, L.: On the power of claw-free permutations. In: Cimato, S., Persiano, G., Galdi, C. (eds.) SCN 2002. LNCS, vol. 2576, pp. 55\u201373. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36413-7_5"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1\u201312. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_1"},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption & how to play mental poker keeping secret all partial information. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, STOC 1882, pp. 365\u2013377. ACM, New York, NY, USA (1982). https:\/\/doi.org\/10.1145\/800070.802212","DOI":"10.1145\/800070.802212"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A \u201cparadoxical\u201d solution to the signature problem. In: Foundations of Computer Science, 1984. 25th Annual Symposium on, pp. 441\u2013448. IEEE (1984)","DOI":"10.1109\/SFCS.1984.715946"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/3-540-39799-X_29","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201985 Proceedings","author":"J Hastad","year":"1986","unstructured":"Hastad, J.: N using RSA with low exponent in a public key network. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 403\u2013408. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_29"},{"key":"18_CR14","unstructured":"Jonsson, J., Moriarty, K., Kaliski, B., Rusch, A.: Pkcs# 1: Rsa cryptography specifications version 2.2 (2016)"},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.dss.2004.07.006","volume":"41","author":"Z Lin","year":"2006","unstructured":"Lin, Z., Li, D., Janamanchi, B., Huang, W.: Reputation distribution and consumer-to-consumer online auction market structure: an exploratory study. Decis. Support Syst. 41(2), 435\u2013448 (2006)","journal-title":"Decis. Support Syst."},{"key":"18_CR16","unstructured":"Litzenberger, D.: Python cryptography toolkit. https:\/\/github.com\/dlitz\/pycrypto (2016)"},{"key":"18_CR17","unstructured":"Stross, C.: Accelerando. Ace (2005)"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Wolinsky, D.I., Syta, E., Ford, B.: Hang with your buddies to resist intersection attacks. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 1153\u20131166. ACM, New York, NY, USA (2013)","DOI":"10.1145\/2508859.2516740"},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Zhang, F., Maram, D., Malvai, H., Goldfeder, S., Juels, A.: Deco: liberating web data using decentralized oracles for TLS. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, CCS 2020, pp. 1919-1938. Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3372297.3417239","DOI":"10.1145\/3372297.3417239"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64954-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T10:07:43Z","timestamp":1728900463000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64954-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,15]]},"ISBN":["9783031649530","9783031649547"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64954-7_18","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2024,10,15]]},"assertion":[{"value":"15 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecureComm","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Privacy in Communication Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"securecomm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/securecomm.eai-conferences.org\/2023\/","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":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"180","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":"50","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":"28% - 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","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":"2","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)"}}]}}