{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:13:03Z","timestamp":1750219983564,"version":"3.41.0"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T00:00:00Z","timestamp":1677456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CIF: 1763734, RI: 2200410"],"award-info":[{"award-number":["CIF: 1763734, RI: 2200410"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-21-1-0090"],"award-info":[{"award-number":["FA9550-21-1-0090"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000142212181"],"award-info":[{"award-number":["N000142212181"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2023,2,27]]},"abstract":"<jats:p>There are a number of forums where people participate under pseudonyms. One example is peer review, where the identity of reviewers for any paper is confidential. When participating in these forums, people frequently engage in \"batching\": executing multiple related tasks (e.g., commenting on multiple papers) at nearly the same time. Our empirical analysis shows that batching is common in two applications we consider -- peer review and Wikipedia edits. In this paper, we identify and address the risk of deanonymization arising from linking batched tasks. To protect against linkage attacks, we take the approach of adding delay to the posting time of batched tasks. We first show that under some natural assumptions, no delay mechanism can provide a meaningful differential privacy guarantee. We therefore propose a \"one-sided\" formulation of differential privacy for protecting against linkage attacks. We design a mechanism that adds zero-inflated uniform delay to events and show it can preserve privacy. We prove that this noise distribution is in fact optimal in minimizing expected delay among mechanisms adding independent noise to each event, thereby establishing the Pareto frontier of the trade-off between the expected delay for batched and unbatched events. Finally, we conduct a series of experiments on Wikipedia and Bitcoin data that corroborate the practical utility of our algorithm in obfuscating batching without introducing onerous delay to a system.<\/jats:p>","DOI":"10.1145\/3579335","type":"journal-article","created":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T23:50:57Z","timestamp":1677801057000},"page":"1-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Batching of Tasks by Users of Pseudonymous Forums: Anonymity Compromise and Protection"],"prefix":"10.1145","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1818-6387","authenticated-orcid":false,"given":"Alexander","family":"Goldberg","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7671-2624","authenticated-orcid":false,"given":"Giulia","family":"Fanti","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5158-9677","authenticated-orcid":false,"given":"Nihar B.","family":"Shah","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,3,2]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Sep.","author":"Alsabah M.","year":"2016","unstructured":"M. Alsabah and I. Goldberg. Performance and security improvements for tor: A survey. ACM Comput. Surv., 49(2), Sep. 2016."},{"key":"e_1_2_1_2_1","unstructured":"Bitcoin Wiki. https:\/\/en.bitcoin.it\/wiki\/Transaction#Input. Accessed on November 3 2022."},{"key":"e_1_2_1_3_1","unstructured":"Bitcoin Wiki. https:\/\/en.bitcoin.it\/wiki\/Common-input-ownership_heuristic. Accessed on November 3 2022."},{"key":"e_1_2_1_4_1","volume-title":"Address reuse. https:\/\/en.bitcoin.it\/wiki\/Address_reuse","author":"Wiki Bitcoin","year":"2021","unstructured":"Bitcoin Wiki. Address reuse. https:\/\/en.bitcoin.it\/wiki\/Address_reuse, 2021. Accessed on April 21, 2021."},{"key":"e_1_2_1_5_1","volume-title":"R. Gutierrez-Osuna, G. Mark, and I. Pavlidis. Emotional Footprints of Email Interruptions, page 1--12","author":"Blank C.","year":"2020","unstructured":"C. Blank, S. Zaman, A. Wesley, P. Tsiamyrtzis, D. R. Da Cunha Silva, R. Gutierrez-Osuna, G. Mark, and I. Pavlidis. Emotional Footprints of Email Interruptions, page 1--12. Association for Computing Machinery, New York, NY, USA, 2020."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834716"},{"key":"e_1_2_1_8_1","volume-title":"AAAI Privacy-Preserving Artificial Intelligence (PPAI-21) workshop","author":"Ding W.","year":"2020","unstructured":"W. Ding, N. B. Shah, and W. Wang. On the privacy-utility tradeoff in peer-review data analysis. In AAAI Privacy-Preserving Artificial Intelligence (PPAI-21) workshop, 2020."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA465464"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_2_1_11_1","volume-title":"The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci., 9(3--4):211--407, aug","author":"Dwork C.","year":"2014","unstructured":"C. Dwork and A. Roth. The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci., 9(3--4):211--407, aug 2014."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592451.1592456"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1809400.1809413"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2998181.2998273"},{"key":"e_1_2_1_15_1","volume-title":"Manuscript, 2013","author":"Ge H.","year":"2021","unstructured":"H. Ge, M. Welling, and Z. Ghahramani. A Bayesian model for calibrating conference review scores. Manuscript, 2013. Available online http:\/\/mlg.eng.cam.ac.uk\/hong\/unpublished\/nips-review-model.pdf Last accessed: April 4, 2021."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875258"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2624023"},{"key":"e_1_2_1_18_1","volume-title":"ICLR workshop on ML Evaluation Standards","author":"Jecmen S.","year":"2022","unstructured":"S. Jecmen, N. B. Shah, F. Fang, and V. Conitzer. Tradeoffs in preventing manipulation in paper bidding for reviewer assignment. In ICLR workshop on ML Evaluation Standards, 2022."},{"key":"e_1_2_1_19_1","volume-title":"NeurIPS","author":"Jecmen S.","year":"2020","unstructured":"S. Jecmen, H. Zhang, R. Liu, N. B. Shah, V. Conitzer, and F. Fang. Mitigating manipulation in peer review via randomized reviewer assignments. In NeurIPS, 2020."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2261131"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2685505"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.27"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00049"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.chb.2014.11.005"},{"key":"e_1_2_1_25_1","volume-title":"Jan","author":"Kushlev K.","year":"2015","unstructured":"K. Kushlev and E. W. Dunn. Stop checking email so often, Jan 2015."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1086\/683652"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27809-2_25"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3429776"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2858036.2858262"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/Trustcom\/BigDataSE\/ICESS.2017.280"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2896384"},{"key":"e_1_2_1_32_1","volume-title":"Nov","author":"Moore K.","year":"2021","unstructured":"K. Moore. How to improve productivity with time batching. Monday blog, Nov 2021. Accessed on April 25, 2022."},{"key":"e_1_2_1_33_1","volume-title":"Forbes Magazine, 2021","author":"Murphy M.","year":"2022","unstructured":"M. Murphy. If you haven't tried time batching, you'll be shocked at how quickly it improves your productivity and happiness. Forbes Magazine, 2021. Accessed on April 25, 2022."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.12554"},{"key":"e_1_2_1_35_1","volume-title":"Multidisciplinary Workshop on Advances in Preference Handling","author":"Roos M.","year":"2012","unstructured":"M. Roos, J. Rothe, J. Rudolph, B. Scheuermann, and D. Stoyan. A statistical approach to calibrating the scores of biased reviewers: The linear vs. the nonlinear model. In Multidisciplinary Workshop on Advances in Preference Handling, 2012."},{"key":"e_1_2_1_36_1","volume-title":"experiments, and computational solutions in peer review (extended version). https:\/\/www.cs.cmu.edu\/~nihars\/preprints\/SurveyPeerReview.pdf Shorter version published in the Communications of the ACM","author":"Shah N. B.","year":"2022","unstructured":"N. B. Shah. An overview of challenges, experiments, and computational solutions in peer review (extended version). https:\/\/www.cs.cmu.edu\/~nihars\/preprints\/SurveyPeerReview.pdf Shorter version published in the Communications of the ACM., 2022."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/11863908_2"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132783"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815417"},{"key":"e_1_2_1_40_1","unstructured":"T. N. Vijaykumar. Potential organized fraud in on-going asplos reviews Nov 2020."},{"key":"e_1_2_1_41_1","volume-title":"AAMAS","author":"Wang J.","year":"2019","unstructured":"J. Wang and N. B. Shah. Your 2 is my 1, your 3 is my 9: Handling arbitrary miscalibrations in ratings. In AAMAS, 2019."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2009.tm08651"},{"key":"e_1_2_1_43_1","volume-title":"Sockpuppetry - alternative accounts. Wikipedia TOS","author":"Service Wikipedia Terms","year":"2022","unstructured":"Wikipedia Terms of Service. Sockpuppetry - alternative accounts. Wikipedia TOS, 2022. Accessed on April 28,2022."},{"key":"e_1_2_1_44_1","volume-title":"ICML","author":"Wu R.","year":"2021","unstructured":"R. Wu, C. Guo, F. Wu, R. Kidambi, L. van der Maaten, and K. Weinberger. Making paper reviewing robust to bid manipulation attacks. In ICML, 2021."}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579335","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3579335","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3579335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:27Z","timestamp":1750182567000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,27]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2,27]]}},"alternative-id":["10.1145\/3579335"],"URL":"https:\/\/doi.org\/10.1145\/3579335","relation":{},"ISSN":["2476-1249"],"issn-type":[{"type":"electronic","value":"2476-1249"}],"subject":[],"published":{"date-parts":[[2023,2,27]]},"assertion":[{"value":"2023-03-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}