Privacy-Preserving Route Matching: Simplifications and additions

Visa enkel post
dc.contributor.authorGunnarsson, Gunnar Örn
dc.contributor.authorTalebi, Pedram
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.date.accessioned2019-07-03T14:54:55Z
dc.date.available2019-07-03T14:54:55Z
dc.date.issued2018
dc.description.abstractDue 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.
dc.identifier.urihttps://hdl.handle.net/20.500.12380/256109
dc.language.isoeng
dc.setspec.uppsokTechnology
dc.subjectData- och informationsvetenskap
dc.subjectComputer and Information Science
dc.titlePrivacy-Preserving Route Matching: Simplifications and additions
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
dc.type.uppsokH
local.programmeSoftware engineering and technology (MPSOF), MSc
Ladda ner
Original bundle
Visar 1 - 1 av 1
Bild (thumbnail)
Namn:
256109.pdf
Storlek:
1.28 MB
Format:
Adobe Portable Document Format
Beskrivning:
Fulltext
Ladda ner
Samling
Examensarbeten för masterexamen