|Riaz, Zohaib; Dürr, Frank; Rothermel, Kurt: Optimized Location Update Protocols for Secure and Efficient Position Sharing. |
In: Proceedings of the 2nd International Conference on Networked Systems: NetSys 2015; Cottbus, Germany, March 9-13, 2015.
Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik.
S. 1-8, englisch.
IEEE Computer Society, 9. März 2015.
Artikel in Tagungsband (Konferenz-Beitrag).
|Körperschaft||The 2nd International Conference on Networked Systems (NetSys 2015)|
|CR-Klassif.||C.2.0 (Computer-Communication Networks, General)|
K.4.1 (Computers and Society Public Policy Issues)
Abstractâ€”Although location-based applications have seen fast growth in the last decade due to pervasive adoption of GPS enabled mobile devices, their use raises privacy concerns. To mitigate these concerns, a number of approaches have been proposed in literature, many of which rely on a trusted party to regulate user privacy. However, trusted parties are known to be prone to data breaches . Consequently, a novel solution, called Position Sharing, was proposed in  to secure location privacy in fully non-trusted systems. In Position Sharing, obfuscated position shares of the actual user location are distributed among several location servers, each from a different provider, such that there is no single point of failure if the servers get breached. While Position Sharing can exhibit useful properties such as graceful degradation of privacy, it incurs significant communication overhead as position shares are sent to several location servers instead of one.
To this end, we propose a set of location update protocols to minimize the communication overhead of Position Sharing while maintaining the privacy guarantees that it originally provided. As we consider the scenario of frequent location updates, i.e., movement trajectories, our protocols additionally add protection against an attack based on spatio-temporal correlation in published locations. By evaluating on a set of real-world GPS traces, we show that our protocols can reduce the communication overhead by 75% while significantly improving the security guarantees of the original Position Sharing algorithm.
|PDF (816293 Bytes)|
|Copyright||© 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |
|Abteilung(en)||Universität Stuttgart, Institut für Parallele und Verteilte Systeme, Verteilte Systeme|
|Eingabedatum||14. Januar 2015|