Privacy-Preserving Route Matching: Simplifications and additions

Examensarbete för masterexamen

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12380/256109
Download file(s):
File Description SizeFormat 
256109.pdfFulltext1.32 MBAdobe PDFView/Open
Type: Examensarbete för masterexamen
Master Thesis
Title: Privacy-Preserving Route Matching: Simplifications and additions
Authors: Gunnarsson, Gunnar Örn
Talebi, Pedram
Abstract: Due to recent security breaches in today’s common applications, privacy requirements for modern applications have become stricter. To fulfill these requirements, more and more research has been put into producing methods that preserve the privacy of users while retaining the same degree of functionality and efficiency. In this thesis, based on the privacy-preserving ridesharing model PrivatePool, two novel models are presented for preserving user’s privacy in a ridesharing application. The former model optimizes the algorithm of PrivatePool to increase its efficiency, while the latter model takes additional parameters into consideration when performing its computations. Finally, we conclude that an ad-hoc privacy-preserving algorithm outperforms a general solution and that the addition of more parameters to the ad-hoc model has a significant negative effect on its efficiency.
Keywords: Data- och informationsvetenskap;Computer and Information Science
Issue Date: 2018
Publisher: Chalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)
Chalmers University of Technology / Department of Computer Science and Engineering (Chalmers)
URI: https://hdl.handle.net/20.500.12380/256109
Collection:Examensarbeten för masterexamen // Master Theses



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.