Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society最新文献_第8页

Revisiting the uniqueness of simple demographics in the US population 重新审视美国人口结构的独特性

Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society Pub Date : 2006-10-30 DOI: 10.1145/1179601.1179615

P. Golle

引用次数: 338

Swing & swap: user-centric approaches towards maximizing location privacy Swing & swap:以用户为中心的最大化位置隐私的方法

Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society Pub Date : 2006-10-30 DOI: 10.1145/1179601.1179605

Mingyan Li, K. Sampigethaya, Leping Huang, R. Poovendran

{"title":"Swing & swap: user-centric approaches towards maximizing location privacy","authors":"Mingyan Li, K. Sampigethaya, Leping Huang, R. Poovendran","doi":"10.1145/1179601.1179605","DOIUrl":"https://doi.org/10.1145/1179601.1179605","url":null,"abstract":"In wireless networks, the location tracking of devices and vehicles (nodes) based on their identifiable and locatable broadcasts, presents potential threats to the location privacy of their users. While the tracking of nodes can be mitigated to an extent by updating their identifiers to decorrelate their traversed locations, such an approach is still vulnerable to tracking methods that utilize the predictability of node movement to limit the location privacy provided by the identifier updates. On the other hand, since each user may need privacy at different locations and times, a user-centric approach is needed to enable the nodes to independently determine where/when to update their identifiers. However, mitigation of tracking with a user-centric approach is difficult due to the lack of synchronization between updating nodes. This paper addresses the challenges to providing location privacy by identifier updates due to the predictability of node locations and the asynchronous updates, and proposes a user-centric scheme called Swing that increases location privacy by enabling the nodes to loosely synchronize updates when changing their velocity. Further, since each identifier update inherently trades off network service for privacy, the paper also introduces an approach called Swap, which is an extension of Swing, that enables the nodes to exchange their identifiers to potentially maximize the location privacy provided by each update, hence reducing the number of updates needed to meet the desired privacy levels. The performance of the proposed schemes is evaluated under random and restricted pedestrian mobility.","PeriodicalId":74537,"journal":{"name":"Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society","volume":"38 1","pages":"19-28"},"PeriodicalIF":0.0,"publicationDate":"2006-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88371284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 195

Randomization as a strategy for sellers during price discrimination, and impact on bidders' privacy 随机化作为卖方在价格歧视中的策略，以及对投标人隐私的影响

Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society Pub Date : 2006-10-30 DOI: 10.1145/1179601.1179614

Sumit Joshi, Yu-An Sun, P. Vora

{"title":"Randomization as a strategy for sellers during price discrimination, and impact on bidders' privacy","authors":"Sumit Joshi, Yu-An Sun, P. Vora","doi":"10.1145/1179601.1179614","DOIUrl":"https://doi.org/10.1145/1179601.1179614","url":null,"abstract":"A previous paper demonstrates that if a seller always uses auction bids to later price discriminate against losing bidders, his revenue decreases dramatically. In this paper, we examine whether the seller obtains an advantage if he randomizes his strategy -- that is, if he does not use privacy-infringing information all the time, but only with probability ?;. Using both Bayesian techniques and genetic algorithm experiments, we determine optimal strategies for bidders and sellers in a two stage game: Stage I is a first price auction used to elicit information on a bidder's valuation; Stage II is, with probability ?;, a price discrimination offer, and, a fixed price offer P; else. Our results show that the seller does not benefit from randomized price discrimination. Further, low valuation bidders benefit more from the seller's use of privacy-infringing information than do the high valuation ones, as they may wish to signal that they cannot afford a high second-stage offer. To our knowledge, our use of genetic algorithm simulations is unique in the privacy literature.","PeriodicalId":74537,"journal":{"name":"Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society","volume":"55 1","pages":"73-76"},"PeriodicalIF":0.0,"publicationDate":"2006-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86552576","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Nonesuch: a mix network with sender unobservability 非此类:具有发送方不可观察性的混合网络

Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society Pub Date : 2006-10-30 DOI: 10.1145/1179601.1179603

T. S. Benjamin, A. Serjantov, Benessa Defend

引用次数: 18

A study on the value of location privacy 位置隐私的价值研究

Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society Pub Date : 2006-10-30 DOI: 10.1145/1179601.1179621

Daniel Cvrcek, Marek Kumpost, Vashek Matyás, G. Danezis

引用次数: 179

Super-sticky and declassifiable release policies for flexible information dissemination control 超粘解密发布策略，灵活控制信息传播

Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society Pub Date : 2006-10-30 DOI: 10.1145/1179601.1179609

Sruthi Bandhakavi, Charles C. Zhang, M. Winslett

{"title":"Super-sticky and declassifiable release policies for flexible information dissemination control","authors":"Sruthi Bandhakavi, Charles C. Zhang, M. Winslett","doi":"10.1145/1179601.1179609","DOIUrl":"https://doi.org/10.1145/1179601.1179609","url":null,"abstract":"Over the years, many aspects of the transfer of information from one party to another have commanded the attention of the security and privacy community. Released information can have various levels of sensitivity: facts that are pub-lic, sensitive private information that requires its original owner's permission for its future dissemination, or even in-formation that requires control over the release of the con-clusions reached using that information. Some situations also call for declassification of information, which requires a two-pronged approach: the original owner retains control over the dissemination of sensitive information and sensitive conclusions reached using that information, but when the in-formation is used to reach conclusions that are sufficiently non-sensitive, the original owner's control can be removed for the dissemination of those conclusions. In this paper, we define such a logic to specify information dissemination con-trol policies and reason about release and declassification, and give case studies of the use of our language to control the release of aggregated open source software, multimedia content and medical information.","PeriodicalId":74537,"journal":{"name":"Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society","volume":"23 1","pages":"51-58"},"PeriodicalIF":0.0,"publicationDate":"2006-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89505059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 24

Reasoning about obfuscated private information: who have lied and how to lie 关于模糊的私人信息的推理:谁撒谎了，如何撒谎

Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society Pub Date : 2006-10-30 DOI: 10.1145/1179601.1179617

X. An, D. Jutla, N. Cercone

引用次数: 4

A privacy-preserving interdomain audit framework 一个保护隐私的域间审计框架

Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society Pub Date : 2006-10-30 DOI: 10.1145/1179601.1179620

Adam J. Lee, Parisa Tabriz, N. Borisov

{"title":"A privacy-preserving interdomain audit framework","authors":"Adam J. Lee, Parisa Tabriz, N. Borisov","doi":"10.1145/1179601.1179620","DOIUrl":"https://doi.org/10.1145/1179601.1179620","url":null,"abstract":"Recent trends in Internet computing have led to the popularization of many forms of virtual organizations. Examples include supply chain management, grid computing, and collaborative research environments like PlanetLab. Unfortunately, when it comes to the security analysis of these systems, the whole is certainly greater than the sum of its parts. That is, local intrusion detection and audit practices are insufficient for detecting distributed attacks such as coordinated network reconnaissance, stepping-stone attacks, and violations of application-level trust constraints between security domains. A distributed process that coordinates information from each member could detect these types of violations, but privacy concerns between member organizations or safety concerns about centralizing sensitive information often restrict this level of information flow. In this paper, we propose a privacy-preserving framework for distributed audit that allows member organizations to detect distributed attacks without requiring the release of excessive private information. We discuss both the architecture and mechanisms used in our approach and comment on the performance of a prototype implementation.","PeriodicalId":74537,"journal":{"name":"Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society","volume":"89 1","pages":"99-108"},"PeriodicalIF":0.0,"publicationDate":"2006-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85797697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 28

On the effectiveness of k;-anonymity against traffic analysis and surveillance 浅谈k -匿名对流量分析和监控的有效性

Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society Pub Date : 2006-10-30 DOI: 10.1145/1179601.1179604

Nicholas Hopper, Eugene Y. Vasserman

引用次数: 6

Probabilistic privacy analysis of published views 已发布视图的概率隐私分析

Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society Pub Date : 2006-10-30 DOI: 10.1145/1179601.1179616

Wendy Hui Wang, L. Lakshmanan

引用次数: 3