Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Privacy preserving car-parking: adistributed approach
KTH, School of Electrical Engineering (EES), Automatic Control.
2012 (English)Student paper other, 20 credits / 30 HE creditsStudent thesis
Abstract [en]

There has been a substantial interest recently in privacy preserving problems in various application domains, including data publishing, data mining, classication, secret voting, private querying of database, playing mental poker, and many others. The main constraint is that entities involved in the system are unwilling to reveal the data they hold or make them public. However, they may want to collaborate and nd the solution of a bigger computational problem without revealing the privately held data. There are several approaches for addressing such issues, including cryptographic methods, transformation methods, and parallel and distributed computation techniques. In this thesis, these three methods are highlighted and a greater emphasis is placed on the last one. In particular, we discuss the theoretical backgrounds of optimization decomposition techniques. We further point out key literature associated with the privacy preserving problems and provide basic classications of their treatments. We focus to a particular interesting application, namely the car parking problem, or parking slot assignment problem. To solve the problem in a privacy preserving manner, a new parallel and distributed computation method is proposed. The goal is to allocate the parking slots to the cars, but without revealing anyone else the intended destinations. We apply decomposition techniques together with projected subgradient method to address this problem and the result is a decentralized privacy preserving car parking algorithm. We compare our algorithm with three other methods and numerically evaluate the performance of the proposed algorithm, in terms of optimality and as well as the computational speed. Despite the reduced computational complexity of the proposed algorithm, it provides close-to-optimal performance.

Place, publisher, year, edition, pages
2012. , 62 p.
Series
EES Examensarbete / Master Thesis, XR-EE-RT 2013:002
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-117695OAI: oai:DiVA.org:kth-117695DiVA: diva2:602597
Uppsok
Technology
Examiners
Available from: 2013-02-04 Created: 2013-02-01 Last updated: 2013-02-04Bibliographically approved

Open Access in DiVA

fulltext(463 kB)538 downloads
File information
File name FULLTEXT02.pdfFile size 463 kBChecksum SHA-512
1af589ceff8d529561016ad6a25e9a3e8002e9a567c454684ab70fe2d7554840da73585647e9be3c89c9db6cea06eafd0c18fae47eaef168afcc9ca1d88af35a
Type fulltextMimetype application/pdf

By organisation
Automatic Control
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 538 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 277 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf