{"id":"https://openalex.org/W7123555681","doi":"https://doi.org/10.1109/isit62367.2026.11653658","title":"Sparse Point-wise Privacy Leakage: Mechanism Design and Fundamental Limits","display_name":"Sparse Point-wise Privacy Leakage: Mechanism Design and Fundamental Limits","publication_year":2026,"publication_date":"2026-06-01","ids":{"openalex":"https://openalex.org/W7123555681","doi":"https://doi.org/10.1109/isit62367.2026.11653658"},"language":null,"primary_location":{"id":"doi:10.1109/isit62367.2026.11653658","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit62367.2026.11653658","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2601.07523","any_repository_has_fulltext":true},"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/I2799509149","display_name":"Khyber Teaching Hospital","ror":"https://ror.org/04xnzxv25","country_code":"PK","type":"healthcare","lineage":["https://openalex.org/I2799509149"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Amirreza Zamani","raw_affiliation_strings":["KTH"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH","institution_ids":["https://openalex.org/I2799509149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086101827","display_name":"Sajad Daei","orcid":"https://orcid.org/0000-0001-6866-6595"},"institutions":[{"id":"https://openalex.org/I2799509149","display_name":"Khyber Teaching Hospital","ror":"https://ror.org/04xnzxv25","country_code":"PK","type":"healthcare","lineage":["https://openalex.org/I2799509149"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Sajad Daei","raw_affiliation_strings":["KTH"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH","institution_ids":["https://openalex.org/I2799509149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068612701","display_name":"Parastoo Sadeghi","orcid":"https://orcid.org/0000-0002-9965-9483"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Parastoo Sadeghi","raw_affiliation_strings":["UNSW"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UNSW","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5146835453","display_name":"Mikael Skoglund","orcid":null},"institutions":[{"id":"https://openalex.org/I2799509149","display_name":"Khyber Teaching Hospital","ror":"https://ror.org/04xnzxv25","country_code":"PK","type":"healthcare","lineage":["https://openalex.org/I2799509149"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Mikael Skoglund","raw_affiliation_strings":["KTH"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH","institution_ids":["https://openalex.org/I2799509149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":28.2632,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.97730183,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":97},"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/T10917","display_name":"Smart Grid Security and Resilience","score":0.35530000925064087,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10917","display_name":"Smart Grid Security and Resilience","score":0.35530000925064087,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.3019999861717224,"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.1477999985218048,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.6588000059127808},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5871999859809875},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5091999769210815},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.508400022983551},{"id":"https://openalex.org/keywords/sparse-pca","display_name":"Sparse PCA","score":0.49630001187324524},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44429999589920044},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4361000061035156},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.3804999887943268},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3671000003814697},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.36309999227523804}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.6588000059127808},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5871999859809875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.512499988079071},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5091999769210815},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.508400022983551},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5037000179290771},{"id":"https://openalex.org/C24252448","wikidata":"https://www.wikidata.org/wiki/Q7573786","display_name":"Sparse PCA","level":3,"score":0.49630001187324524},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44429999589920044},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4361000061035156},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40470001101493835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39899998903274536},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.3804999887943268},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3671000003814697},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.36309999227523804},{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.36149999499320984},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.3614000082015991},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.3393000066280365},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.3359000086784363},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3345000147819519},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.3337000012397766},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.3273000121116638},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3237999975681305},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.31459999084472656},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.311599999666214},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.31130000948905945},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.3095000088214874},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28040000796318054},{"id":"https://openalex.org/C123201435","wikidata":"https://www.wikidata.org/wiki/Q456632","display_name":"Information privacy","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C54848796","wikidata":"https://www.wikidata.org/wiki/Q339011","display_name":"Symmetric matrix","level":3,"score":0.2759000062942505},{"id":"https://openalex.org/C2779201187","wikidata":"https://www.wikidata.org/wiki/Q2775060","display_name":"Information leakage","level":2,"score":0.273499995470047},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.27090001106262207},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.2662999927997589},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.2660999894142151},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.25839999318122864},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit62367.2026.11653658","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit62367.2026.11653658","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"doi:10.48550/arxiv.2601.07523","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.07523","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.07523","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.07523","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.7016986608505249,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1989065278","https://openalex.org/W2039103602","https://openalex.org/W2125295547","https://openalex.org/W2922457090","https://openalex.org/W2963024421","https://openalex.org/W2963412800","https://openalex.org/W2963446403","https://openalex.org/W2963535017","https://openalex.org/W2967916697","https://openalex.org/W2998261580","https://openalex.org/W3108844855","https://openalex.org/W3121783531","https://openalex.org/W3123181209","https://openalex.org/W3133771317","https://openalex.org/W3182521736","https://openalex.org/W4366392943","https://openalex.org/W4382365523","https://openalex.org/W4387789705","https://openalex.org/W4393864507","https://openalex.org/W4404609024","https://openalex.org/W4404609105","https://openalex.org/W4405975113","https://openalex.org/W4413749687","https://openalex.org/W4416513822","https://openalex.org/W7123555681","https://openalex.org/W7155082737"],"related_works":[],"abstract_inverted_index":{"We":[0,39,134,202,237],"study":[1],"an":[2,9,131],"information-theoretic":[3],"privacy":[4,43,47],"mechanism":[5],"design":[6,24,118],"problem,":[7,129,141],"where":[8],"agent":[10,32],"observes":[11],"useful":[12],"data":[13,21,26],"$Y$":[14,30],"that":[15,49,210],"is":[16,79,112,191,211],"arbitrarily":[17],"correlated":[18,63],"with":[19,64,130,156,226],"sensitive":[20],"$X$,":[22,70],"and":[23,71,105,193,216,254],"disclosed":[25,56],"$U$":[27,104,155],"generated":[28],"from":[29,88],"(the":[31],"has":[33],"no":[34],"direct":[35],"access":[36],"to":[37,91,120,150,196,231],"$X$).":[38],"introduce":[40],"\\emph{sparse":[41],"point-wise":[42],"leakage},":[44],"a":[45,93,121,151,157,204,218,227,233,240],"worst-case":[46],"criterion":[48],"enforces":[50],"two":[51],"simultaneous":[52],"constraints":[53],"for":[54,138,221],"every":[55],"symbol":[57],"$u\\in\\mathcal{U}$:":[58],"(i)":[59],"$u$":[60],"may":[61],"be":[62,169],"at":[65,249],"most":[66],"$N$":[67],"realizations":[68,78],"of":[69,97,146],"(ii)":[72],"the":[73,82,108,117,127,139,164,180,186,222,245,250,255],"total":[74],"leakage":[75,109,235],"toward":[76],"those":[77],"bounded.":[80],"In":[81],"high-privacy":[83],"regime,":[84],"we":[85],"use":[86],"concepts":[87],"information":[89,99],"geometry":[90],"obtain":[92],"local":[94],"quadratic":[95,123],"approximation":[96,115],"mutual":[98],"which":[100,175,244],"measures":[101],"utility":[102],"between":[103],"$Y$.":[106],"When":[107],"matrix":[110],"$P_{X|Y}$":[111],"invertible,":[113],"this":[114],"reduces":[116],"problem":[119],"sparse":[122,188,197,246],"maximization,":[124],"known":[125],"as":[126,179],"Rayleigh-quotient":[128,189],"$\\ell_0$":[132],"constraint.":[133],"further":[135],"show":[136],"that,":[137],"approximated":[140],"one":[142],"can":[143,168],"without":[144],"loss":[145],"optimality":[147],"restrict":[148],"attention":[149],"binary":[152],"released":[153],"variable":[154],"uniform":[158],"distribution.":[159],"For":[160,183],"small":[161],"alphabet":[162],"sizes,":[163],"exact":[165],"sparsity-constrained":[166],"optimum":[167,247],"computed":[170],"via":[171],"combinatorial":[172],"support":[173],"enumeration,":[174],"quickly":[176],"becomes":[177,258],"intractable":[178],"dimension":[181],"grows.":[182],"general":[184],"dimensions,":[185],"resulting":[187],"maximization":[190],"NP-hard":[192,223],"closely":[194],"related":[195],"principal":[198],"component":[199],"analysis":[200],"(PCA).":[201],"propose":[203],"convex":[205],"semidefinite":[206],"programming":[207],"(SDP)":[208],"relaxation":[209,257],"solvable":[212],"in":[213],"polynomial":[214],"time":[215],"provides":[217],"tractable":[219],"surrogate":[220],"design,":[224],"together":[225],"simple":[228],"rounding":[229],"procedure":[230],"recover":[232],"feasible":[234],"direction.":[236],"also":[238],"identify":[239],"sparsity":[241],"threshold":[242],"beyond":[243],"saturates":[248],"unconstrained":[251],"spectral":[252],"value":[253],"SDP":[256],"tight.":[259]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-08-27T14:10:00.468798","created_date":"2026-01-14T00:00:00"}