Results 1 - 10 of 1,847

Optimal geo-indistinguishable mechanisms for location privacy

by Nicolás E. Bordenabe, Konstantinos Chatzikokolakis, Catuscia Palamidessi , 2014
"... With location-based services becoming increasingly more popular, serious concerns are being raised about the potential privacy breaches that the disclosure of location information may induce. We consider two approaches that have been proposed to limit and control the privacy loss: one is the geo-ind ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
With location-based services becoming increasingly more popular, serious concerns are being raised about the potential privacy breaches that the disclosure of location information may induce. We consider two approaches that have been proposed to limit and control the privacy loss: one is the geo-indistinguishability

Geo-indistinguishability: Differential privacy for location-based systems

by Miguel E. Andrés, École Polytechnique, Nicolás E. Bordenabe, Konstantinos Chatzikokolakis, Catuscia Palamidessi, École Polytechnique , 2012
"... The growing popularity of location-based systems, allowing un-known/untrusted servers to easily collect huge amounts of informa-tion regarding users ’ location, has recently started raising serious privacy concerns. In this paper we introduce geo-indistinguisha-bility, a formal notion of privacy for ..."
Abstract - Cited by 28 (5 self) - Add to MetaCart
of privacy that depends on r, and corresponds to a generalized version of the well-known concept of differential privacy. Furthermore, we present a mechanism for achieving geo-indistinguishability by adding con-trolled random noise to the user’s location. We describe how to use our mechanism to enhance LBS

Location-aided routing (LAR) in mobile ad hoc networks, in:

by Young-Bae Ko , Nitin H Vaidya - Proc. of MOBICOM , 1998
"... A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This paper suggests an approach to utilize location ..."
Abstract - Cited by 901 (10 self) - Add to MetaCart
A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This paper suggests an approach to utilize

The new casper: Query processing for location services without compromising privacy

by Chi-Yin Chow , Mohamed F. Mokbel, Walid G. Aref - IN PROC. OF THE 32ND INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, VLDB , 2006
"... In this paper, we present a new privacy-aware query processing framework Capser * in which mobile and stationary users can obtain snapshot and/or continuous location-based services without revealing their private location information. In particular, we propose a privacy-aware query processor embedde ..."
Abstract - Cited by 234 (7 self) - Add to MetaCart
In this paper, we present a new privacy-aware query processing framework Capser * in which mobile and stationary users can obtain snapshot and/or continuous location-based services without revealing their private location information. In particular, we propose a privacy-aware query processor

Mechanism design via differential privacy

by Frank Mcsherry - Proceedings of the 48th Annual Symposium on Foundations of Computer Science , 2007
"... We study the role that privacy-preserving algorithms, which prevent the leakage of specific information about participants, can play in the design of mechanisms for strategic agents, which must encourage players to honestly report information. Specifically, we show that the recent notion of differen ..."
Abstract - Cited by 212 (3 self) - Add to MetaCart
on the prices. As an important prelude to developing a privacy-preserving auction mechanism, we introduce and study a generalization of previous privacy work that accommodates the high sensitivity of the auction setting, where a single participant may dramatically alter the optimal fixed price, and a slight

An architecture for privacy-sensitive ubiquitous computing

by Jason I. Hong - In MobiSYS ’04: Proceedings of the 2nd international conference on mobile systems, applications, and services , 2004
"... Privacy is the most often-cited criticism of ubiquitous computing, and may be the greatest barrier to its long-term success. However, developers currently have little support in designing software architectures and in creating interactions that are effective in helping end-users manage their privacy ..."
Abstract - Cited by 231 (16 self) - Add to MetaCart
support for building ubiquitous computing applications, providing a framework as well as several customizable privacy mechanisms. Confab also comes with extensions for managing location privacy. Combined, these features allow application developers and end-users to support a spectrum of trust levels

Mondrian multidimensional k-anonymity

by Kristen Lefevre, David J. Dewitt, Raghu Ramakrishnan - in Proc. 22nd ICDE. IEEE
"... K-Anonymity has been proposed as a mechanism for privacy protection in microdata publishing, and numerous recoding “models ” have been considered for achieving k-anonymity. This paper proposes a new multidimensional model, which provides an additional degree of flexibility not seen in previous (sing ..."
Abstract - Cited by 255 (5 self) - Add to MetaCart
K-Anonymity has been proposed as a mechanism for privacy protection in microdata publishing, and numerous recoding “models ” have been considered for achieving k-anonymity. This paper proposes a new multidimensional model, which provides an additional degree of flexibility not seen in previous

Truthful Mechanisms for One-Parameter Agents

by Aron Archer, Eva Tardos
"... In this paper, we show how to design truthful (dominant strategy) mechanisms for several combinatorial problems where each agent’s secret data is naturally expressed by a single positive real number. The goal of the mechanisms we consider is to allocate loads placed on the agents, and an agent’s sec ..."
Abstract - Cited by 232 (3 self) - Add to MetaCart
truthful mechanisms for maximum flow, Qjj P Cj (scheduling related machines to minimize the sum of completion times), optimizing an affine function over a fixed set, and special cases of uncapacitated facility location. In addition, for Qjj P wjCj (minimizing the weighted sum of completion times), we prove

A Survey of Computational Location Privacy

by John Krumm - PERSONAL AND UBIQUITOUS COMPUTING , 2008
"... This is a literature survey of computational location privacy, meaning computation-based privacy mechanisms that treat location data as geometric information. This definition includes privacy-preserving algorithms like anonymity and obfuscation as well as privacy-breaking algorithms that exploit the ..."
Abstract - Cited by 120 (1 self) - Add to MetaCart
This is a literature survey of computational location privacy, meaning computation-based privacy mechanisms that treat location data as geometric information. This definition includes privacy-preserving algorithms like anonymity and obfuscation as well as privacy-breaking algorithms that exploit

Achieving MAC Layer Fairness in Wireless Packet Networks

by Thyagarajan Nandagopal , Tae-eun Kim, Xia Gao, Vaduvur Bharghavan , 2000
"... Link-layer fairness models that have been proposed for wireline and packet cellular networks cannot be generalized for shared channel wireless networks because of the unique characteristics of the wireless channel, such as location-dependent contention, inherent conflict between optimizing channel u ..."
Abstract - Cited by 242 (2 self) - Add to MetaCart
Link-layer fairness models that have been proposed for wireline and packet cellular networks cannot be generalized for shared channel wireless networks because of the unique characteristics of the wireless channel, such as location-dependent contention, inherent conflict between optimizing channel
Results 1 - 10 of 1,847