Nazanin Takbiri, D. Goeckel, A. Houmansadr, H. Pishro-Nik
{"title":"贝叶斯时间序列匹配中隐私的渐近极限","authors":"Nazanin Takbiri, D. Goeckel, A. Houmansadr, H. Pishro-Nik","doi":"10.1109/CISS.2019.8692936","DOIUrl":null,"url":null,"abstract":"Various modern and highly popular applications make use of user data traces in order to offer specific services, often for the purpose of improving the user’s experience while using such applications. However, even when user data is privatized by employing privacy-preserving mechanisms (PPM), users’ privacy may still be compromised by an external party who leverages statistical matching methods to match users’ traces with their previous activities. In this paper, we obtain the theoretical bounds on user privacy for situations in which user traces are matchable to sequences of prior behavior, despite anonymization of data time series. We provide both achievability and converse results for the case where the data trace of each user consists of independent and identically distributed (i.i.d.) random samples drawn from a multinomial distribution, as well as the case that the users’ data points are dependent over time and the data trace of each user is governed by a Markov chain model.","PeriodicalId":123696,"journal":{"name":"2019 53rd Annual Conference on Information Sciences and Systems (CISS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Asymptotic Limits of Privacy in Bayesian Time Series Matching\",\"authors\":\"Nazanin Takbiri, D. Goeckel, A. Houmansadr, H. Pishro-Nik\",\"doi\":\"10.1109/CISS.2019.8692936\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Various modern and highly popular applications make use of user data traces in order to offer specific services, often for the purpose of improving the user’s experience while using such applications. However, even when user data is privatized by employing privacy-preserving mechanisms (PPM), users’ privacy may still be compromised by an external party who leverages statistical matching methods to match users’ traces with their previous activities. In this paper, we obtain the theoretical bounds on user privacy for situations in which user traces are matchable to sequences of prior behavior, despite anonymization of data time series. We provide both achievability and converse results for the case where the data trace of each user consists of independent and identically distributed (i.i.d.) random samples drawn from a multinomial distribution, as well as the case that the users’ data points are dependent over time and the data trace of each user is governed by a Markov chain model.\",\"PeriodicalId\":123696,\"journal\":{\"name\":\"2019 53rd Annual Conference on Information Sciences and Systems (CISS)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-02-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 53rd Annual Conference on Information Sciences and Systems (CISS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2019.8692936\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 53rd Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2019.8692936","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Asymptotic Limits of Privacy in Bayesian Time Series Matching
Various modern and highly popular applications make use of user data traces in order to offer specific services, often for the purpose of improving the user’s experience while using such applications. However, even when user data is privatized by employing privacy-preserving mechanisms (PPM), users’ privacy may still be compromised by an external party who leverages statistical matching methods to match users’ traces with their previous activities. In this paper, we obtain the theoretical bounds on user privacy for situations in which user traces are matchable to sequences of prior behavior, despite anonymization of data time series. We provide both achievability and converse results for the case where the data trace of each user consists of independent and identically distributed (i.i.d.) random samples drawn from a multinomial distribution, as well as the case that the users’ data points are dependent over time and the data trace of each user is governed by a Markov chain model.