{"id":"https://openalex.org/W7133298732","doi":"https://doi.org/10.1109/tps-isa67132.2025.00031","title":"EDL: Efficient Data-Oblivious Loops","display_name":"EDL: Efficient Data-Oblivious Loops","publication_year":2025,"publication_date":"2025-11-12","ids":{"openalex":"https://openalex.org/W7133298732","doi":"https://doi.org/10.1109/tps-isa67132.2025.00031"},"language":null,"primary_location":{"id":"doi:10.1109/tps-isa67132.2025.00031","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tps-isa67132.2025.00031","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 7th International Conference on Trust, Privacy and Security in Intelligent Systems, and Applications (TPS-ISA)","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/A5092254683","display_name":"Biniyam Mengist Tiruye","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Biniyam Tiruye","raw_affiliation_strings":["University of Michigan,Ann Arbor,Michigan,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan,Ann Arbor,Michigan,USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042598156","display_name":"Lauren Biernacki","orcid":"https://orcid.org/0000-0001-8511-2287"},"institutions":[{"id":"https://openalex.org/I184759092","display_name":"Lafayette College","ror":"https://ror.org/036n0x007","country_code":"US","type":"education","lineage":["https://openalex.org/I184759092"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lauren Biernacki","raw_affiliation_strings":["Lafayette College,Easton,Pennsylvania,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lafayette College,Easton,Pennsylvania,USA","institution_ids":["https://openalex.org/I184759092"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113456715","display_name":"Todd Austin","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Todd Austin","raw_affiliation_strings":["University of Michigan,Ann Arbor,Michigan,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan,Ann Arbor,Michigan,USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5092254683"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.84451186,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"213","last_page":"225"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.19370000064373016,"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/T10237","display_name":"Cryptography and Data Security","score":0.19370000064373016,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.07339999824762344,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.04450000077486038,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7271999716758728},{"id":"https://openalex.org/keywords/profiling","display_name":"Profiling (computer programming)","score":0.7067000269889832},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5415999889373779},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.5202999711036682},{"id":"https://openalex.org/keywords/information-sensitivity","display_name":"Information sensitivity","score":0.4772000014781952},{"id":"https://openalex.org/keywords/forcing","display_name":"Forcing (mathematics)","score":0.4244999885559082},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.3549000024795532},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.35179999470710754}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7975000143051147},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7271999716758728},{"id":"https://openalex.org/C187191949","wikidata":"https://www.wikidata.org/wiki/Q1138496","display_name":"Profiling (computer programming)","level":2,"score":0.7067000269889832},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5415999889373779},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.5202999711036682},{"id":"https://openalex.org/C137822555","wikidata":"https://www.wikidata.org/wiki/Q2587068","display_name":"Information sensitivity","level":2,"score":0.4772000014781952},{"id":"https://openalex.org/C197115733","wikidata":"https://www.wikidata.org/wiki/Q1003136","display_name":"Forcing (mathematics)","level":2,"score":0.4244999885559082},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3788999915122986},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.3549000024795532},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.35179999470710754},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.33739998936653137},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.31859999895095825},{"id":"https://openalex.org/C2780771206","wikidata":"https://www.wikidata.org/wiki/Q3271761","display_name":"Safeguard","level":2,"score":0.3061999976634979},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C47487241","wikidata":"https://www.wikidata.org/wiki/Q5227230","display_name":"Data access","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C2776654903","wikidata":"https://www.wikidata.org/wiki/Q2601463","display_name":"SAFER","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.2768999934196472},{"id":"https://openalex.org/C2780626000","wikidata":"https://www.wikidata.org/wiki/Q5936775","display_name":"Human-in-the-loop","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C60229501","wikidata":"https://www.wikidata.org/wiki/Q18822","display_name":"Global Positioning System","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.25929999351501465}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tps-isa67132.2025.00031","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tps-isa67132.2025.00031","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 7th International Conference on Trust, Privacy and Security in Intelligent Systems, and Applications (TPS-ISA)","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":27,"referenced_works":["https://openalex.org/W1488058190","https://openalex.org/W1531820677","https://openalex.org/W1557855942","https://openalex.org/W1613874182","https://openalex.org/W1988374166","https://openalex.org/W2008620264","https://openalex.org/W2031533839","https://openalex.org/W2106728965","https://openalex.org/W2148606196","https://openalex.org/W2170993700","https://openalex.org/W2294070790","https://openalex.org/W2294347342","https://openalex.org/W2327709439","https://openalex.org/W2793957616","https://openalex.org/W2795193970","https://openalex.org/W2810584084","https://openalex.org/W2899157124","https://openalex.org/W2905380323","https://openalex.org/W2947435413","https://openalex.org/W2952265249","https://openalex.org/W2963311060","https://openalex.org/W2982848142","https://openalex.org/W3212259962","https://openalex.org/W4210531213","https://openalex.org/W4241773843","https://openalex.org/W4312389200","https://openalex.org/W4381894528"],"related_works":[],"abstract_inverted_index":{"Data-oblivious":[0],"programs":[1,21,103,338],"are":[2,104],"essential":[3],"solutions":[4],"for":[5,213,309],"maintaining":[6,154],"privacy":[7,15],"in":[8,25,61,93,149,204,314,318,330],"computation,":[9],"crucial":[10],"amidst":[11],"rising":[12],"concerns":[13],"regarding":[14],"breaches":[16],"and":[17,265,296,332],"data":[18,54,92],"misuse.":[19],"These":[20],"safeguard":[22],"sensitive":[23,91],"information":[24,171,202],"today's":[26],"data-driven":[27],"landscape.":[28],"However,":[29],"their":[30,42],"limited":[31],"practicality":[32],"due":[33,249],"to":[34,41,72,95,99,117,127,183,207,245,250,298,336],"massive":[35],"performance":[36,152],"overheads":[37,75],"poses":[38],"an":[39,133,288],"obstacle":[40],"widespread":[43],"adoption.":[44],"Resolving":[45],"these":[46,73,128,167,270],"inefficiencies":[47],"not":[48,88,307],"only":[49],"ensures":[50,221],"the":[51,70,120,145,163,176,185,199,214,218,225,233,239,256,263,280,319],"viability":[52],"of":[53,69,81,106,123,147,166,190,198,217,224,241,269,282,291,321],"oblivious":[55],"techniques":[56],"but":[57],"also":[58],"fosters":[59],"trust":[60],"privacy-preserving":[62],"technologies.":[63],"Previous":[64],"work":[65,308],"showed":[66],"that":[67,85,109,161,243,339],"one":[68],"contributors":[71],"significant":[74,316],"is":[76,181,203],"loop":[77,193],"conversion":[78],"techniques.":[79],"Principles":[80],"data-oblivious":[82,102,150,215,323],"programming":[83],"demand":[84],"decision-making":[86],"should":[87],"depend":[89],"on":[90],"order":[94],"maintain":[96],"obliviousness.":[97,156],"Due":[98],"this":[100,130,201,283,304,328,343],"requirement,":[101],"stripped":[105],"any":[107],"heuristics":[108],"could":[110,340],"terminate":[111],"loops":[112,116,148,168],"early,":[113],"thereby":[114],"forcing":[115],"always":[118],"execute":[119],"worst-case":[121],"number":[122],"times.":[124],"In":[125],"response":[126],"challenges,":[129],"paper":[131,326],"introduces":[132],"innovative":[134],"approach,":[135,284],"termed":[136],"Efficient":[137],"Data":[138],"Oblivious":[139],"Loop":[140],"(EDL),":[141],"aimed":[142],"at":[143],"reducing":[144],"impact":[146],"program":[151],"while":[153],"complete":[155],"EDL":[157,260,286],"presents":[158],"a":[159,191,209,251,267,273,315,334],"technique":[160,329],"lowers":[162],"trip":[164,188,236,253,258,275],"count":[165,189,254],"by":[169],"leveraging":[170],"derived":[172],"from":[173,342],"safely":[174],"profiling":[175,180],"algorithms.":[177],"The":[178],"algorithm":[179,226],"used":[182,206],"determine":[184,208],"most":[186,222],"common":[187],"particular":[192],"across":[194],"many":[195,322],"non-data-oblivious":[196],"executions":[197,223,242,271],"program,":[200],"turn":[205],"new":[210,234,257],"upper":[211],"bound":[212],"version":[216],"program.":[219],"This":[220,325],"will":[227],"produce":[228,246],"correct":[229,247],"results":[230,248,278],"even":[231],"with":[232,272,285],"lowered":[235],"count.":[237,276],"For":[238],"minority":[240],"fail":[244],"higher":[252,274],"than":[255],"count,":[259],"can":[261],"detect":[262],"inputs":[264],"prompt":[266],"rerun":[268],"Experimental":[277],"demonstrate":[279],"effectiveness":[281],"yielding":[287],"average":[289],"speedup":[290],"<tex":[292,299],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[293,300],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$2.0":[294],"\\times$</tex>,":[295],"up":[297],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$4.5":[301],"\\times$</tex>.":[302],"While":[303],"approach":[305],"does":[306],"all":[310],"algorithms,":[311],"it":[312],"resulted":[313],"enhancement":[317],"efficiency":[320],"programs.":[324],"describes":[327],"detail":[331],"provides":[333],"guideline":[335],"identify":[337],"benefit":[341],"optimization.":[344]},"counts_by_year":[],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2026-03-04T00:00:00"}