Proceedings of the 10th annual ACM workshop on Privacy in the electronic society最新文献_第2页

Adapt-lite: privacy-aware, secure, and efficient mhealth sensing adapt - life:隐私感知、安全、高效的移动健康感知

Proceedings of the 10th annual ACM workshop on Privacy in the electronic society Pub Date : 2011-10-17 DOI: 10.1145/2046556.2046574

Shrirang Mare, Jacob M. Sorber, Minho Shin, Cory Cornelius, D. Kotz

{"title":"Adapt-lite: privacy-aware, secure, and efficient mhealth sensing","authors":"Shrirang Mare, Jacob M. Sorber, Minho Shin, Cory Cornelius, D. Kotz","doi":"10.1145/2046556.2046574","DOIUrl":"https://doi.org/10.1145/2046556.2046574","url":null,"abstract":"As healthcare in many countries faces an aging population and rising costs, mobile sensing technologies promise a new opportunity. Using mobile health (mHealth) sensing, which uses medical sensors to collect data about the patients, and mobile phones to act as a gateway between sensors and electronic health record systems, caregivers can continuously monitor the patients and deliver better care. Although some work on mHealth sensing has addressed security, achieving strong security and privacy for low-power sensors remains a challenge. We make three contributions. First, we propose Adapt-lite, a set of two techniques that can be applied to existing wireless protocols to make them energy efficient without compromising their security or privacy properties. The techniques are: adaptive security, which dynamically modifies packet overhead; and MAC striping, which makes forgery difficult even for small-sized MACs. Second, we apply these techniques to an existing wireless protocol, and demonstrate a prototype on a Chronos wrist device. Third, we provide security, privacy, and energy analysis of our techniques.","PeriodicalId":384270,"journal":{"name":"Proceedings of the 10th annual ACM workshop on Privacy in the electronic society","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124372132","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}

引用次数: 19

Session details: Data privacy 会话详细信息:数据隐私

Proceedings of the 10th annual ACM workshop on Privacy in the electronic society Pub Date : 2011-10-17 DOI: 10.1145/3244872

Keith B. Frikken

引用次数: 0

On the limits of privacy in reputation systems 论声誉系统中隐私的局限性

Proceedings of the 10th annual ACM workshop on Privacy in the electronic society Pub Date : 2011-10-17 DOI: 10.1145/2046556.2046561

Stefan Schiffner, A. Pashalidis, Elmar Tischhauser

引用次数: 11

Protecting against physical resource monitoring 防止物理资源监控

Proceedings of the 10th annual ACM workshop on Privacy in the electronic society Pub Date : 2011-10-17 DOI: 10.1145/2046556.2046560

G. Ács, C. Castelluccia, William Lecat

引用次数: 12

Pythia: a privacy aware, peer-to-peer network for social search Pythia:一个注重隐私的点对点社交搜索网络

Proceedings of the 10th annual ACM workshop on Privacy in the electronic society Pub Date : 2011-10-17 DOI: 10.1145/2046556.2046562

Shirin Nilizadeh, Naveed Alam, Nathaniel Husted, Apu Kapadia

{"title":"Pythia: a privacy aware, peer-to-peer network for social search","authors":"Shirin Nilizadeh, Naveed Alam, Nathaniel Husted, Apu Kapadia","doi":"10.1145/2046556.2046562","DOIUrl":"https://doi.org/10.1145/2046556.2046562","url":null,"abstract":"Emerging \"live social search\" systems such as Aardvark.com allow users to pose questions to their social network in real time. People can thus obtain answers from real humans for questions that prove too complex for web searches. Centralized systems that broker such queries and answers, however, do not provide adequate privacy. The success of these systems will be limited since users may avoid asking or answering questions related to sensitive topics such as health, political activism, or even innocuous questions which may make the querier seem ignorant. Since social search systems leverage the structure of the social network to better match askers and answerers, standard ideas that hide this structure such as \"connect to Aardvark via Tor\" fall short. Thus new techniques are needed to preserve the privacy of askers and answerers beyond the currently understood anonymity techniques. We explore the new and unique challenges for privacy, and propose Pythia, a decentralized architecture based on \"controlled flooding\" to enable privacy-enhanced social search that retains some degree of social network structure.","PeriodicalId":384270,"journal":{"name":"Proceedings of the 10th annual ACM workshop on Privacy in the electronic society","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130525007","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}

引用次数: 12

Data mining without data: a novel approach to privacy-preserving collaborative distributed data mining 无数据的数据挖掘:一种保护隐私的协作分布式数据挖掘的新方法

Proceedings of the 10th annual ACM workshop on Privacy in the electronic society Pub Date : 2011-10-17 DOI: 10.1145/2046556.2046578

V. Ashok, R. Mukkamala

{"title":"Data mining without data: a novel approach to privacy-preserving collaborative distributed data mining","authors":"V. Ashok, R. Mukkamala","doi":"10.1145/2046556.2046578","DOIUrl":"https://doi.org/10.1145/2046556.2046578","url":null,"abstract":"With the proliferation of organizations that independently collect various types of data, with the growing awareness of corporations and public to keep their sensitive data private, and with the ever-increasing need of government and corporate policy makers to learn the behavior of their customers, there is a definite demand for data mining services even when the data owners refuse to provide their data directly. In the past, techniques such as random perturbation were used by data owners prior to sharing the data with a third-party data miner. But, as already proven, even these techniques are prone to privacy-violation. In this paper, we take a completely different approach---each data owner derives association rules locally, sanitizes them if necessary, and sends them to a third-party data miner. The data miner collects local rules from all data owners, regenerates an estimate of global data, and performs global data mining. We suggest schemes to reduce the generation of spurious rules, a possible outcome of data generation from rules. The proposed method is illustrated using an example of association rule data mining. We are currently in the process of formalizing some of the underlying techniques and to make them more efficient.","PeriodicalId":384270,"journal":{"name":"Proceedings of the 10th annual ACM workshop on Privacy in the electronic society","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133276736","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}

引用次数: 6

FAUST: efficient, TTP-free abuse prevention by anonymous whitelisting FAUST:通过匿名白名单高效、无ttp滥用预防

Proceedings of the 10th annual ACM workshop on Privacy in the electronic society Pub Date : 2011-10-17 DOI: 10.1145/2046556.2046572

P. Lofgren, Nicholas Hopper

引用次数: 13

Private searching for single and conjunctive keywords on streaming data 对流数据进行单个和连接关键字的私有搜索

Proceedings of the 10th annual ACM workshop on Privacy in the electronic society Pub Date : 2011-10-17 DOI: 10.1145/2046556.2046577

X. Yi, E. Bertino

引用次数: 20

BridgeSPA: improving Tor bridges with single packet authorization BridgeSPA:改进单包授权的Tor网桥

Proceedings of the 10th annual ACM workshop on Privacy in the electronic society Pub Date : 2011-10-17 DOI: 10.1145/2046556.2046569

Rob Smits, Divam Jain, Sarah Pidcock, I. Goldberg, U. Hengartner

{"title":"BridgeSPA: improving Tor bridges with single packet authorization","authors":"Rob Smits, Divam Jain, Sarah Pidcock, I. Goldberg, U. Hengartner","doi":"10.1145/2046556.2046569","DOIUrl":"https://doi.org/10.1145/2046556.2046569","url":null,"abstract":"Tor is a network designed for low-latency anonymous communications. Tor clients form circuits through relays that are listed in a public directory, and then relay their encrypted traffic through these circuits. This indirection makes it difficult for a local adversary to determine with whom a particular Tor user is communicating. In response, some local adversaries restrict access to Tor by blocking each of the publicly listed relays. To deal with such an adversary, Tor uses bridges, which are unlisted relays that can be used as alternative entry points into the Tor network. Unfortunately, issues with Tor's bridge implementation make it easy to discover large numbers of bridges. An adversary that hoards this information may use it to determine when each bridge is online over time. If a bridge operator also browses with Tor on the same machine, this information may be sufficient to deanonymize him. We present BridgeSPA as a method to mitigate this issue. A client using BridgeSPA relies on innocuous single packet authorization (SPA) to present a time-limited key to a bridge. Before this authorization takes place, the bridge will not reveal whether it is online. We have implemented BridgeSPA as a working proof-of-concept, which is available under an open-source licence.","PeriodicalId":384270,"journal":{"name":"Proceedings of the 10th annual ACM workshop on Privacy in the electronic society","volume":"1218 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127700739","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}

引用次数: 38

SPEcTRe: spot-checked private ecash tolling at roadside 幽灵:在路边抽查私人现金收费站

Proceedings of the 10th annual ACM workshop on Privacy in the electronic society Pub Date : 2011-10-17 DOI: 10.1145/2046556.2046565

Jeremy Day, Yizhou Huang, Edward Knapp, I. Goldberg

{"title":"SPEcTRe: spot-checked private ecash tolling at roadside","authors":"Jeremy Day, Yizhou Huang, Edward Knapp, I. Goldberg","doi":"10.1145/2046556.2046565","DOIUrl":"https://doi.org/10.1145/2046556.2046565","url":null,"abstract":"Traditional stop-and-pay toll booths inconvenience drivers and are infeasible for complicated urban areas. As a way to minimize traffic congestion and avoid the inconveniences caused by toll booths, electronic tolling has been suggested. For example, as drivers pass certain locations, a picture of their licence plate may be taken and a bill sent to their home. However, this simplistic method allows the administrator of the system to build a dossier on drivers. While this may be an attractive feature for law enforcement, a society may not wish to trust the tolling agency with such detailed information. We present SPEcTRe, a suite of protocols to maintain driver privacy while ensuring that tolls are accurately collected. Existing protocols for privacy-preserving electronic toll pricing suffer from computational challenges and require an undesirable amount of location data to be collected. We present two schemes: the spot-record scheme, which requires the same amount of location data exposure as prior privacy-preserving schemes, but runs much faster, and the no-record scheme, which collects no location information from honest users and is still able to run efficiently.","PeriodicalId":384270,"journal":{"name":"Proceedings of the 10th annual ACM workshop on Privacy in the electronic society","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133030041","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}

引用次数: 20