{"id":"https://openalex.org/W7131213672","doi":"https://doi.org/10.1109/acsac67867.2025.00043","title":"DP-Mix: Differentially Private Routing in Mix Networks","display_name":"DP-Mix: Differentially Private Routing in Mix Networks","publication_year":2025,"publication_date":"2025-12-08","ids":{"openalex":"https://openalex.org/W7131213672","doi":"https://doi.org/10.1109/acsac67867.2025.00043"},"language":null,"primary_location":{"id":"doi:10.1109/acsac67867.2025.00043","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acsac67867.2025.00043","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Annual Computer Security Applications Conference (ACSAC)","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/A5126679438","display_name":"Mahdi Rahimi","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Mahdi Rahimi","raw_affiliation_strings":["KU Leuven,COSIC,Leuven,Belgium"],"affiliations":[{"raw_affiliation_string":"KU Leuven,COSIC,Leuven,Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5126679438"],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.75960044,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"394","last_page":"410"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.35899999737739563,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.35899999737739563,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.1543000042438507,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.07039999961853027,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/traverse","display_name":"Traverse","score":0.6025000214576721},{"id":"https://openalex.org/keywords/anonymity","display_name":"Anonymity","score":0.5871999859809875},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.46560001373291016},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4636000096797943},{"id":"https://openalex.org/keywords/differential-privacy","display_name":"Differential privacy","score":0.4505000114440918},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4399999976158142},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4081000089645386},{"id":"https://openalex.org/keywords/overlay-network","display_name":"Overlay network","score":0.39980000257492065}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7900000214576721},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.6025000214576721},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5910999774932861},{"id":"https://openalex.org/C178005623","wikidata":"https://www.wikidata.org/wiki/Q308859","display_name":"Anonymity","level":2,"score":0.5871999859809875},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.46560001373291016},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4636000096797943},{"id":"https://openalex.org/C23130292","wikidata":"https://www.wikidata.org/wiki/Q5275358","display_name":"Differential privacy","level":2,"score":0.4505000114440918},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4399999976158142},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4081000089645386},{"id":"https://openalex.org/C169851745","wikidata":"https://www.wikidata.org/wiki/Q1331985","display_name":"Overlay network","level":3,"score":0.39980000257492065},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3774000108242035},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.37049999833106995},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3652999997138977},{"id":"https://openalex.org/C43711488","wikidata":"https://www.wikidata.org/wiki/Q7534783","display_name":"Skew","level":2,"score":0.35850000381469727},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.3440999984741211},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.319599986076355},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.3138999938964844},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.28220000863075256},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C123201435","wikidata":"https://www.wikidata.org/wiki/Q456632","display_name":"Information privacy","level":2,"score":0.26179999113082886}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/acsac67867.2025.00043","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acsac67867.2025.00043","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Annual Computer Security Applications Conference (ACSAC)","raw_type":"proceedings-article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:20.500.12942/785563","is_oa":false,"landing_page_url":"https://lirias.kuleuven.be/handle/20.500.12942/785563","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Annual Computer Security Applications Conference, Honolulu, HI, USA","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1582462706","https://openalex.org/W1873763122","https://openalex.org/W1992157848","https://openalex.org/W2103647628","https://openalex.org/W2108668142","https://openalex.org/W2109394932","https://openalex.org/W2123820077","https://openalex.org/W2167372639","https://openalex.org/W2763748542","https://openalex.org/W2883006946","https://openalex.org/W2963890727","https://openalex.org/W3209750973","https://openalex.org/W3212917226","https://openalex.org/W4241517995","https://openalex.org/W4391725292","https://openalex.org/W4399556682","https://openalex.org/W4408749936","https://openalex.org/W4409102902","https://openalex.org/W4411377615"],"related_works":[],"abstract_inverted_index":{"Mixnets,":[0],"as":[1],"overlay":[2],"networks,":[3],"ensure":[4],"anonymity":[5,84,126],"for":[6,94,137,212],"messages":[7,48],"by":[8],"forwarding":[9],"them":[10],"through":[11],"intermediary":[12],"nodes":[13],"that":[14,53,81,193],"obscure":[15],"their":[16],"traffic":[17],"patterns":[18],"from":[19,187],"network-level":[20],"adversaries.":[21],"Nonetheless,":[22],"the":[23,157,165,227],"selection":[24,67,159],"of":[25,167,208],"intermediaries":[26],"is":[27,110],"traditionally":[28],"performed":[29],"uniformly":[30],"at":[31,101],"random,":[32],"resulting":[33],"in":[34,68,98,226],"optimal":[35],"routes":[36,116],"being":[37],"chosen":[38],"no":[39],"more":[40],"frequently":[41],"than":[42],"suboptimal":[43],"ones.":[44],"This":[45],"often":[46],"causes":[47],"to":[49,64,73,120,156,174,222],"traverse":[50],"inefficient":[51],"paths":[52,123],"degrade":[54],"performance":[55],"or":[56,177],"weaken":[57],"security.":[58],"While":[59],"there":[60],"have":[61],"been":[62],"proposals":[63],"improve":[65],"route":[66,109,158],"mixnets,":[69,190],"they":[70],"are":[71,117],"limited":[72],"latency":[74,213],"reduction":[75],"and":[76,115,143,183],"rely":[77],"on":[78],"heuristic":[79],"strategies":[80],"lack":[82],"formal":[83],"guarantees.":[85],"To":[86],"bridge":[87],"this":[88,105,135],"gap,":[89],"we":[90,148,191],"develop":[91],"a":[92,128,150,205,223],"framework":[93],"differ-entially":[95],"private":[96],"routing":[97],"mixnets":[99],"aimed":[100],"general-purpose":[102],"optimization.":[103],"In":[104,210],"framework,":[106],"each":[107],"candidate":[108],"as-signed":[111],"an":[112],"optimality":[113,198],"score,":[114],"then":[118],"selected":[119],"favor":[121],"high-scoring":[122],"while":[124,203],"preserving":[125,204],"under":[127],"pure-\u03b5":[129],"differential":[130],"privacy":[131,162],"guarantee.":[132],"We":[133],"instantiate":[134],"model":[136],"optimizing":[138],"path":[139],"security,":[140],"enhancing":[141],"reliability,":[142],"minimizing":[144],"communication":[145],"latency.":[146],"Additionally,":[147],"introduce":[149],"gradient-based":[151],"algorithm":[152],"applied":[153],"post":[154],"hoc":[155],"process-without":[160],"weakening":[161],"guarantees-to":[163],"prevent":[164],"over-selection":[166],"particular":[168],"nodes,":[169],"which":[170],"could":[171],"otherwise":[172],"lead":[173],"security":[175],"vulnerabilities":[176],"network":[178],"congestion.":[179],"Through":[180],"analytical":[181],"evaluation":[182],"simulation":[184],"over":[185],"data":[186],"deployed":[188],"Nym":[189],"demonstrate":[192],"DP-Mix":[194],"consistently":[195],"achieves":[196],"high":[197],"scores":[199],"across":[200],"all":[201],"instantiations":[202],"strong":[206],"level":[207],"anonymity.":[209],"particular,":[211],"optimization,":[214],"our":[215],"method":[216],"outperforms":[217],"state-of-the-art":[218],"solutions,":[219],"achieving":[220],"up":[221],"8\u00d7":[224],"improvement":[225],"latency-anonymity":[228],"trade-off.":[229]},"counts_by_year":[],"updated_date":"2026-04-23T09:07:50.710637","created_date":"2026-02-25T00:00:00"}