{"id":"https://openalex.org/W3175912019","doi":"https://doi.org/10.1145/3460120.3484735","title":"Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access","display_name":"Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access","publication_year":2021,"publication_date":"2021-11-12","ids":{"openalex":"https://openalex.org/W3175912019","doi":"https://doi.org/10.1145/3460120.3484735","mag":"3175912019"},"language":"en","primary_location":{"id":"doi:10.1145/3460120.3484735","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3460120.3484735","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.itu.dk/portal/da/publications/cbf5feb8-e86a-4b7b-888c-c6f0d762edbb","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072434673","display_name":"Martin Aum\u00fcller","orcid":"https://orcid.org/0000-0002-7212-6476"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Martin Aum\u00fcller","raw_affiliation_strings":["IT University of Copenhagen, Copenhagen, Denmark","IT-UNIVERSITY OF COPENHAGEN"],"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]},{"raw_affiliation_string":"IT-UNIVERSITY OF COPENHAGEN","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033124481","display_name":"Christian Janos Lebeda","orcid":"https://orcid.org/0000-0001-9517-8466"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Christian Janos Lebeda","raw_affiliation_strings":["Basic Algorithms Research Copenhagen & IT University of Copenhagen, Copenhagen, Denmark","IT-UNIVERSITY OF COPENHAGEN"],"affiliations":[{"raw_affiliation_string":"Basic Algorithms Research Copenhagen & IT University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]},{"raw_affiliation_string":"IT-UNIVERSITY OF COPENHAGEN","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014293815","display_name":"Rasmus Pagh","orcid":"https://orcid.org/0000-0002-1516-9306"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Rasmus Pagh","raw_affiliation_strings":["Basic Algorithms Research Copenhagen & University of Copenhagen, Copenhagen, Denmark","University of Copenhagen"],"affiliations":[{"raw_affiliation_string":"Basic Algorithms Research Copenhagen & University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"University of Copenhagen","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5072434673"],"corresponding_institution_ids":["https://openalex.org/I83467386"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08479093,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1223","last_page":"1236"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9847000241279602,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/differential-privacy","display_name":"Differential privacy","score":0.7266857624053955},{"id":"https://openalex.org/keywords/laplace-distribution","display_name":"Laplace distribution","score":0.6330164670944214},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5937192440032959},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5673397779464722},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5584551692008972},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5288494825363159},{"id":"https://openalex.org/keywords/random-projection","display_name":"Random projection","score":0.5270816683769226},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5215532779693604},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.4952198565006256},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.4280228018760681},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.426385760307312},{"id":"https://openalex.org/keywords/k-independent-hashing","display_name":"K-independent hashing","score":0.4145287275314331},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39088016748428345},{"id":"https://openalex.org/keywords/laplace-transform","display_name":"Laplace transform","score":0.37046048045158386},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.2275950312614441},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18239182233810425},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.16192978620529175}],"concepts":[{"id":"https://openalex.org/C23130292","wikidata":"https://www.wikidata.org/wiki/Q5275358","display_name":"Differential privacy","level":2,"score":0.7266857624053955},{"id":"https://openalex.org/C183057437","wikidata":"https://www.wikidata.org/wiki/Q671617","display_name":"Laplace distribution","level":3,"score":0.6330164670944214},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5937192440032959},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5673397779464722},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5584551692008972},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5288494825363159},{"id":"https://openalex.org/C2777036070","wikidata":"https://www.wikidata.org/wiki/Q18393452","display_name":"Random projection","level":2,"score":0.5270816683769226},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5215532779693604},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.4952198565006256},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.4280228018760681},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.426385760307312},{"id":"https://openalex.org/C187062812","wikidata":"https://www.wikidata.org/wiki/Q6322840","display_name":"K-independent hashing","level":5,"score":0.4145287275314331},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39088016748428345},{"id":"https://openalex.org/C97937538","wikidata":"https://www.wikidata.org/wiki/Q199691","display_name":"Laplace transform","level":2,"score":0.37046048045158386},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.2275950312614441},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18239182233810425},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.16192978620529175},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/3460120.3484735","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3460120.3484735","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire/cbf5feb8-e86a-4b7b-888c-c6f0d762edbb","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/cbf5feb8-e86a-4b7b-888c-c6f0d762edbb","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Aum\u00fcller, M, Pagh, R & Lebeda, C J 2021, Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access. in Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery. https://doi.org/10.1145/3460120.3484735","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:2106.10068","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2106.10068","pdf_url":"https://arxiv.org/pdf/2106.10068","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"mag:3175912019","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2106.10068v1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/669a0de8-980e-4a28-b15f-7c6a65135b77","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/669a0de8-980e-4a28-b15f-7c6a65135b77","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Aum\u00fcller , M , Lebeda , C J & Pagh , R 2021 , Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access . in CCS 2021 - Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security . Association for Computing Machinery , Proceedings of the ACM Conference on Computer and Communications Security , pp. 1223-1236 , 27th ACM Annual Conference on Computer and Communication Security, CCS 2021 , Virtual, Online , Korea, Republic of , 15/11/2021 . https://doi.org/10.1145/3460120.3484735","raw_type":"contributionToPeriodical"},{"id":"doi:10.48550/arxiv.2106.10068","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2106.10068","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/cbf5feb8-e86a-4b7b-888c-c6f0d762edbb","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/cbf5feb8-e86a-4b7b-888c-c6f0d762edbb","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Aum\u00fcller, M, Pagh, R & Lebeda, C J 2021, Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access. in Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery. https://doi.org/10.1145/3460120.3484735","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4422840520","display_name":null,"funder_award_id":"16582","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320334966","display_name":"Bhabha Atomic Research Centre","ror":"https://ror.org/05w6wfp17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1542553486","https://openalex.org/W1602434374","https://openalex.org/W1709479579","https://openalex.org/W1855974267","https://openalex.org/W2013823004","https://openalex.org/W2027595342","https://openalex.org/W2029948740","https://openalex.org/W2052207834","https://openalex.org/W2107041969","https://openalex.org/W2141902405","https://openalex.org/W2144399314","https://openalex.org/W2170540710","https://openalex.org/W2626769593","https://openalex.org/W2949134592","https://openalex.org/W2982157598","https://openalex.org/W6657138077","https://openalex.org/W6744992943","https://openalex.org/W6763560255"],"related_works":["https://openalex.org/W3212881518","https://openalex.org/W3164295722","https://openalex.org/W3196922287","https://openalex.org/W2044450349","https://openalex.org/W1965582845","https://openalex.org/W2795890526","https://openalex.org/W2963258773","https://openalex.org/W2766967855","https://openalex.org/W2751685763","https://openalex.org/W3079238949","https://openalex.org/W2964118521","https://openalex.org/W1515737631","https://openalex.org/W2951386616","https://openalex.org/W2111895931","https://openalex.org/W2752846897","https://openalex.org/W2140089781","https://openalex.org/W3036122956","https://openalex.org/W1805609236","https://openalex.org/W1545522745","https://openalex.org/W2905472923"],"abstract_inverted_index":{"Representing":[0],"a":[1,7,11,113,143],"sparse":[2,8],"histogram,":[3],"or":[4],"more":[5],"generally":[6],"vector,":[9],"is":[10,78,112,131],"fundamental":[12],"task":[13],"in":[14,47,135],"differential":[15],"privacy.":[16],"An":[17],"ideal":[18],"solution":[19],"would":[20],"use":[21],"space":[22,85],"close":[23],"to":[24,45,80,87,92,105,122,141],"information-theoretical":[25],"lower":[26],"bounds,":[27],"have":[28,53,82],"an":[29],"error":[30,96],"distribution":[31],"that":[32,158],"depends":[33],"optimally":[34],"on":[35,162],"the":[36,48,66,98,102,136,159,163,173],"desired":[37],"privacy":[38],"level,":[39],"and":[40,95],"allow":[41],"fast":[42,90],"random":[43],"access":[44,91],"entries":[46],"vector.":[49],"However,":[50],"existing":[51],"approaches":[52],"only":[54],"achieved":[55],"two":[56],"of":[57,97,116,138,172],"these":[58],"three":[59],"goals.":[60],"In":[61],"this":[62],"paper":[63],"we":[64,120],"introduce":[65],"Approximate":[67],"Laplace":[68],"Projection":[69],"(ALP)":[70],"mechanism":[71,77],"for":[72],"approximating":[73],"k-sparse":[74],"vectors.":[75,107],"This":[76,129],"shown":[79],"simultaneously":[81],"information-theoretically":[83],"optimal":[84],"(up":[86],"constant":[88,160],"factors),":[89],"vector":[93],"entries,":[94],"same":[99],"magnitude":[100],"as":[101],"Laplace-mechanism":[103],"applied":[104],"dense":[106],"A":[108],"key":[109],"new":[110],"technique":[111],"unary":[114],"representation":[115,130],"small":[117],"integers,":[118],"which":[119,156],"show":[121,157],"be":[123],"robust":[124],"against":[125],"\"randomized":[126],"response''":[127],"noise.":[128],"combined":[132],"with":[133],"hashing,":[134],"spirit":[137],"Bloom":[139],"filters,":[140],"obtain":[142],"space-efficient,":[144],"differentially":[145],"private":[146],"representation.":[147],"Our":[148],"theoretical":[149],"performance":[150,165],"bounds":[151],"are":[152,167],"complemented":[153],"by":[154],"simulations":[155],"factors":[161],"main":[164],"parameters":[166],"quite":[168],"small,":[169],"suggesting":[170],"practicality":[171],"technique.":[174]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}