Full metadata record
DC FieldValueLanguage
dc.contributorDepartment of Electronic and Information Engineeringen_US
dc.contributor.advisorHu, Haibo (EIE)en_US
dc.creatorDuan, Jiawei-
dc.identifier.urihttps://theses.lib.polyu.edu.hk/handle/200/11188-
dc.languageEnglishen_US
dc.publisherHong Kong Polytechnic Universityen_US
dc.rightsAll rights reserveden_US
dc.titleHigh­dimensional data collection with local differential privacy : benchmark and optimizationsen_US
dcterms.abstractLocal differential privacy (LDP),which perturbs user's data locally and only sends the noisy version of her information to the aggregator, is a novel and prospective privacy-­preserving framework. In LDP, the data collector, which collects and analyzes perturbed data from users, has no access to original data. Thus, privacy is protected from its source. However, a primary drawback of LDP is that most works are strictly limited to low­dimensional scenarios and they could face serious challenges if directly extended to high­-dimensional settings, no matter how excellent the algorithm is in low dimensions. In this paper, we first present a comprehensive review on high-­dimensional LDP and provide corresponding optimal settings by theoretical analysis. Next, an evaluation benchmark referred as LDP­-Bench, which efficiently takes advantage of the peculiarity of high­dimensional data, is elaborately designed for impartially parallel comparisons between LDP mechanisms. Then, we conduct stress tests on three representative LDP mechanisms on this benchmark to confirm its effectiveness and generality. To further address the poor utility of Duchi et al.'s solution, an unbiased aggregation method is proposed by introducing an iterative machine learning algorithm, which is shown to achieve impressively higher utility than Duchi et al.'s solution. Further, we are the first to extend Duchi et al.'s solution to implement frequency estimation. Finally, experimental results based on our benchmark confirm the effectiveness of these strategies.en_US
dcterms.extent56 pages : color illustrationsen_US
dcterms.isPartOfPolyU Electronic Thesesen_US
dcterms.issued2021en_US
dcterms.educationalLevelM.Sc.en_US
dcterms.educationalLevelAll Masteren_US
dcterms.LCSHData protectionen_US
dcterms.LCSHComputer securityen_US
dcterms.LCSHHong Kong Polytechnic University -- Dissertationsen_US
dcterms.accessRightsrestricted accessen_US

Files in This Item:
File Description SizeFormat 
5656.pdfFor All Users (off-campus access for PolyU Staff & Students only)424.42 kBAdobe PDFView/Open


Copyright Undertaking

As a bona fide Library user, I declare that:

  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.

By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

Show simple item record

Please use this identifier to cite or link to this item: https://theses.lib.polyu.edu.hk/handle/200/11188