Batching of Tasks by Users of Pseudonymous Forums: Anonymity Compromise and Protection

Author:

Goldberg Alexander1ORCID,Fanti Giulia1ORCID,Shah Nihar B.1ORCID

Affiliation:

1. Carnegie Mellon University, Pittsburgh, PA, USA

Abstract

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.

Funder

National Science Foundation

Air Force Office of Scientific Research

Office of Naval Research

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications,Hardware and Architecture,Safety, Risk, Reliability and Quality,Computer Science (miscellaneous)

Reference44 articles.

1. M. Alsabah and I. Goldberg . Performance and security improvements for tor: A survey. ACM Comput. Surv., 49(2) , Sep. 2016 . M. Alsabah and I. Goldberg. Performance and security improvements for tor: A survey. ACM Comput. Surv., 49(2), Sep. 2016.

2. Bitcoin Wiki. https://en.bitcoin.it/wiki/Transaction#Input. Accessed on November 3 2022. Bitcoin Wiki. https://en.bitcoin.it/wiki/Transaction#Input. Accessed on November 3 2022.

3. Bitcoin Wiki. https://en.bitcoin.it/wiki/Common-input-ownership_heuristic. Accessed on November 3 2022. Bitcoin Wiki. https://en.bitcoin.it/wiki/Common-input-ownership_heuristic. Accessed on November 3 2022.

4. Bitcoin Wiki . Address reuse. https://en.bitcoin.it/wiki/Address_reuse , 2021 . Accessed on April 21, 2021. Bitcoin Wiki. Address reuse. https://en.bitcoin.it/wiki/Address_reuse, 2021. Accessed on April 21, 2021.

5. 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 . 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.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3