SoK: Managing Longitudinal Privacy of Publicly Shared Personal Online Data
Author:
Schnitzler Theodor1, Mirza Shujaat2, Dürmuth Markus1, Pöpper Christina3
Affiliation:
1. Ruhr-Universität Bochum , Bochum , Germany 2. Courant Institute of Mathematical Sciences , New York University , New York City , NY, USA 3. New York University Abu Dhabi , Abu Dhabi , UAE
Abstract
Abstract
Over the past decade, research has explored managing the availability of shared personal online data, with particular focus on longitudinal aspects of privacy. Yet, there is no taxonomy that takes user perspective and technical approaches into account. In this work, we systematize research on longitudinal privacy management of publicly shared personal online data from these two perspectives: user studies capturing users’ interactions related to the availability of their online data and technical proposals limiting the availability of data. Following a systematic approach, we derive conflicts between these two sides that have not yet been addressed appropriately, resulting in a list of challenging open problems to be tackled by future research. While limitations of data availability in proposed approaches and real systems are mostly time-based, users’ desired models are rather complex, taking into account content, audience, and the context in which data has been shared. Our systematic evaluation reveals interesting challenges broadly categorized by expiration conditions, data co-ownership, user awareness, and security and trust.
Publisher
Walter de Gruyter GmbH
Reference109 articles.
1. [1] A. Abouzied and J. Chen, “Harnessing Data Loss With Forgetful Data Structures,” in ACM Symposium on Cloud Computing, ser. SoCC ’15. Kohala Coast, HI, USA: ACM, Aug. 2015, pp. 168–173. 2. [2] S. Ahern, D. Eckles, N. S. Good, S. King, M. Naaman, and R. Nair, “Over-exposed? privacy patterns and considerations in online and mobile photo sharing,” in CHI Conference on Human Factors in Computing Systems, ser. CHI ’07. San Jose, CA, USA: ACM, Apr. 2007, pp. 357–366. 3. [3] H. Almuhimedi, S. Wilson, B. Liu, N. Sadeh, and A. Acquisti, “Tweets are Forever: A Large-scale Quantitative Analysis of Deleted Tweets,” in ACM Conference on Computer supported cooperative work, ser. CSCW ’13. San Antonio, TX, USA: ACM, Feb. 2013, pp. 897–908. 4. [4] A. Alqhatani and H. R. Lipford, ““There is nothing that I need to keep secret”: Sharing Practices and Concerns of Wearable Fitness Data,” in USENIX Symposium on Usable Privacy and Security, ser. SOUPS ’19. Santa Clara, CA, USA: USENIX Association, Aug. 2019. 5. [5] G. Amjad, M. S. Mirza, and C. Pöpper, “Forgetting with Puzzles: Using Cryptographic Puzzles to support Digital Forgetting,” in ACM Conference on Data and Application Security and Privacy, ser. CODASPY ’18. Tempe, AZ, USA: ACM, Mar. 2018, pp. 342–353.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Disjunctive Multi-Level Digital Forgetting Scheme;Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing;2024-04-08 2. Loft: An Architecture for Lifetime Management of Privacy Data in Service Cooperation;Communications in Computer and Information Science;2024 3. ExD: Explainable Deletion;New Security Paradigms Workshop;2023-09-18 4. Digital Forgetting Using Key Decay;Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing;2023-03-27 5. SoK: Social Cybersecurity;2022 IEEE Symposium on Security and Privacy (SP);2022-05
|
|