{"id":"https://openalex.org/W4416513822","doi":"https://doi.org/10.1109/itw62417.2025.11240250","title":"An Information Geometric Approach to Local Information Privacy with Applications to Max-lift and Local Differential Privacy","display_name":"An Information Geometric Approach to Local Information Privacy with Applications to Max-lift and Local Differential Privacy","publication_year":2025,"publication_date":"2025-09-29","ids":{"openalex":"https://openalex.org/W4416513822","doi":"https://doi.org/10.1109/itw62417.2025.11240250"},"language":null,"primary_location":{"id":"doi:10.1109/itw62417.2025.11240250","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw62417.2025.11240250","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068807935","display_name":"Amirreza Zamani","orcid":"https://orcid.org/0000-0001-9296-4939"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Amirreza Zamani","raw_affiliation_strings":["KTH Royal Institute of Technology,Division of Information Science and Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology,Division of Information Science and Engineering","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068612701","display_name":"Parastoo Sadeghi","orcid":"https://orcid.org/0000-0002-9965-9483"},"institutions":[{"id":"https://openalex.org/I87162078","display_name":"Institute for Clinical Social Work","ror":"https://ror.org/01qa6hr76","country_code":"US","type":"education","lineage":["https://openalex.org/I87162078"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Parastoo Sadeghi","raw_affiliation_strings":["UNSW,School of Engineering and Information Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UNSW,School of Engineering and Information Technology","institution_ids":["https://openalex.org/I87162078"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041348422","display_name":"Mikael Skoglund","orcid":"https://orcid.org/0000-0002-7926-5081"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Mikael Skoglund","raw_affiliation_strings":["KTH Royal Institute of Technology,Division of Information Science and Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology,Division of Information Science and Engineering","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7588,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.89626303,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.906499981880188,"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":0.906499981880188,"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.041200000792741776,"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/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.004900000058114529,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.8519999980926514},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5806999802589417},{"id":"https://openalex.org/keywords/information-privacy","display_name":"Information privacy","score":0.5612999796867371},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.510200023651123},{"id":"https://openalex.org/keywords/private-information-retrieval","display_name":"Private information retrieval","score":0.4909999966621399},{"id":"https://openalex.org/keywords/information-sensitivity","display_name":"Information sensitivity","score":0.4422999918460846},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.44190001487731934},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43380001187324524},{"id":"https://openalex.org/keywords/mechanism-design","display_name":"Mechanism design","score":0.4221000075340271}],"concepts":[{"id":"https://openalex.org/C23130292","wikidata":"https://www.wikidata.org/wiki/Q5275358","display_name":"Differential privacy","level":2,"score":0.8519999980926514},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5849000215530396},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5806999802589417},{"id":"https://openalex.org/C123201435","wikidata":"https://www.wikidata.org/wiki/Q456632","display_name":"Information privacy","level":2,"score":0.5612999796867371},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.510200023651123},{"id":"https://openalex.org/C99221444","wikidata":"https://www.wikidata.org/wiki/Q1532069","display_name":"Private information retrieval","level":2,"score":0.4909999966621399},{"id":"https://openalex.org/C137822555","wikidata":"https://www.wikidata.org/wiki/Q2587068","display_name":"Information sensitivity","level":2,"score":0.4422999918460846},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.44190001487731934},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43380001187324524},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.4221000075340271},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4065000116825104},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.3971000015735626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.382099986076355},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3734000027179718},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.37209999561309814},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.365200012922287},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31949999928474426},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3149000108242035},{"id":"https://openalex.org/C3017597292","wikidata":"https://www.wikidata.org/wiki/Q25052250","display_name":"Privacy protection","level":2,"score":0.31310001015663147},{"id":"https://openalex.org/C89611455","wikidata":"https://www.wikidata.org/wiki/Q6804646","display_name":"Mechanism (biology)","level":2,"score":0.30219998955726624},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.2973000109195709},{"id":"https://openalex.org/C2779201187","wikidata":"https://www.wikidata.org/wiki/Q2775060","display_name":"Information leakage","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C67186912","wikidata":"https://www.wikidata.org/wiki/Q367664","display_name":"Data modeling","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C113336015","wikidata":"https://www.wikidata.org/wiki/Q574010","display_name":"Complete information","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw62417.2025.11240250","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw62417.2025.11240250","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1557833142","https://openalex.org/W1873763122","https://openalex.org/W1989065278","https://openalex.org/W2039103602","https://openalex.org/W2053801139","https://openalex.org/W2130099852","https://openalex.org/W2207879440","https://openalex.org/W2343097824","https://openalex.org/W2515654213","https://openalex.org/W2734457061","https://openalex.org/W2922457090","https://openalex.org/W2951663308","https://openalex.org/W2963412800","https://openalex.org/W2963446403","https://openalex.org/W2963535017","https://openalex.org/W3108844855","https://openalex.org/W3121783531","https://openalex.org/W3123181209","https://openalex.org/W3133771317","https://openalex.org/W3169870919","https://openalex.org/W3182521736","https://openalex.org/W4310902951","https://openalex.org/W4366392943","https://openalex.org/W4382365054","https://openalex.org/W4382365523","https://openalex.org/W4387789705","https://openalex.org/W4401692807","https://openalex.org/W4401879919","https://openalex.org/W4402040149","https://openalex.org/W4404609024","https://openalex.org/W4404609105","https://openalex.org/W4405975113","https://openalex.org/W4416513822"],"related_works":[],"abstract_inverted_index":{"We":[0,49,69],"study":[1,70],"an":[2,8],"information-theoretic":[3],"privacy":[4,38,72,163],"mechanism":[5,39,73],"design,":[6],"where":[7,136,190],"agent":[9,35,53],"observes":[10,54],"useful":[11,25],"data":[12,26,32,43,66],"Y":[13,55,81],"and":[14,56,177,204,229,245],"wants":[15],"to":[16,20,40,61,103,151,259],"reveal":[17],"the":[18,24,30,34,52,64,71,77,92,106,113,134,137,152,173,192,201,210,215,226,242,246,253],"information":[19,79,99],"a":[21,37,84,122,181,197,231],"user.":[22],"Since":[23],"is":[27,67,94,140],"correlated":[28],"with":[29,165,241,261],"private":[31,65],"X,":[33,62],"uses":[36],"produce":[41],"disclosed":[42],"U":[44],"that":[45,51,75,126,155],"can":[46,118,256],"be":[47,119,257],"released.":[48],"assume":[50],"has":[57,127],"no":[58],"direct":[59],"access":[60],"i.e.,":[63],"hidden.":[68],"design":[74],"maximizes":[76],"revealed":[78],"about":[80],"while":[82],"satisfying":[83],"bounded":[85],"Local":[86],"Information":[87],"Privacy":[88],"(LIP)":[89],"criterion.":[90],"When":[91],"leakage":[93],"sufficiently":[95],"small,":[96],"concepts":[97],"from":[98],"geometry":[100],"allow":[101],"us":[102],"locally":[104],"approximate":[105,206,214],"mutual":[107],"information.":[108],"By":[109],"utilizing":[110],"this":[111,219],"approximation":[112],"main":[114,202,216],"privacy-utility":[115],"trade-off":[116],"problem":[117,125,203,217],"rewritten":[120],"as":[121],"quadratic":[123],"optimization":[124],"closed-form":[128,138],"solution":[129,139,244],"under":[130],"some":[131],"constraints.":[132],"For":[133],"cases":[135],"not":[141],"obtained":[142],"we":[143,160,186,195,213,221,234,250],"provide":[144,161],"lower":[145,198],"bounds":[146],"on":[147,171,200],"it.":[148],"In":[149],"contrast":[150],"previous":[153,247],"works":[154],"have":[156],"complexity":[157,167],"issues,":[158],"here,":[159],"simple":[162],"designs":[164],"low":[166],"which":[168],"are":[169],"based":[170],"finding":[172],"maximum":[174],"singular":[175,178],"value":[176],"vector":[179],"of":[180,225],"matrix.":[182],"To":[183],"do":[184],"so,":[185],"follow":[187],"two":[188],"approaches":[189,240],"in":[191,209,230],"first":[193],"one":[194],"find":[196],"bound":[199],"then":[205],"it,":[207],"however,":[208],"second":[211],"approach":[212],"directly.In":[218],"work,":[220],"present":[222],"geometrical":[223],"studies":[224],"proposed":[227,254],"methods":[228,255],"numerical":[232],"example":[233],"compare":[235],"our":[236],"results":[237],"considering":[238],"both":[239],"optimal":[243],"methods.":[248],"Finally,":[249],"discuss":[251],"how":[252],"applied":[258],"deal":[260],"differential":[262],"privacy.":[263]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-23T00:00:00"}