{"id":"https://openalex.org/W2900027259","doi":"https://doi.org/10.13016/m26w96d17","title":"Efficient Data-Oblivious Computation","display_name":"Efficient Data-Oblivious Computation","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2900027259","doi":"https://doi.org/10.13016/m26w96d17","mag":"2900027259"},"language":"en","primary_location":{"id":"pmh:oai:drum.lib.umd.edu:1903/21403","is_oa":true,"landing_page_url":"https://doi.org/10.13016/M26W96D17","pdf_url":"http://hdl.handle.net/1903/21403","source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Dissertation"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1903/21403","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040861793","display_name":"Kartik Nayak","orcid":"https://orcid.org/0000-0001-5675-263X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nayak, Kartik Ravidas","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5040861793"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9991999864578247,"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.9991999864578247,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9926999807357788,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9865000247955322,"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/computer-science","display_name":"Computer science","score":0.5455607175827026},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5036408305168152},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17592373490333557}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5455607175827026},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5036408305168152},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17592373490333557}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drum.lib.umd.edu:1903/21403","is_oa":true,"landing_page_url":"https://doi.org/10.13016/M26W96D17","pdf_url":"http://hdl.handle.net/1903/21403","source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Dissertation"},{"id":"mag:2900027259","is_oa":false,"landing_page_url":"https://drum.lib.umd.edu/handle/1903/21403","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null},{"id":"doi:10.13016/m26w96d17","is_oa":true,"landing_page_url":"https://doi.org/10.13016/m26w96d17","pdf_url":null,"source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"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":"thesis"}],"best_oa_location":{"id":"pmh:oai:drum.lib.umd.edu:1903/21403","is_oa":true,"landing_page_url":"https://doi.org/10.13016/M26W96D17","pdf_url":"http://hdl.handle.net/1903/21403","source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Dissertation"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2900027259.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W150396298","https://openalex.org/W3030445576","https://openalex.org/W1482698025","https://openalex.org/W3139421608","https://openalex.org/W2023951105","https://openalex.org/W3100458263","https://openalex.org/W2301626257","https://openalex.org/W2966435790","https://openalex.org/W3003495144","https://openalex.org/W3171320801","https://openalex.org/W2949898336","https://openalex.org/W2110831581","https://openalex.org/W2949129999","https://openalex.org/W2155720185","https://openalex.org/W2397586356","https://openalex.org/W3122422767","https://openalex.org/W1558374100","https://openalex.org/W2153526531","https://openalex.org/W2745861814","https://openalex.org/W2157314106"],"abstract_inverted_index":{"The":[0,162,184,225],"rapid":[1],"increase":[2],"in":[3,14,283],"the":[4,57,107,149,188,214,241,249,270,331,338],"amount":[5],"of":[6,59,110,152,223,228,243,251,262,274,301],"data":[7,23,78,85,144,247,308],"stored":[8],"by":[9,323,337],"cloud":[10,295],"servers":[11,296],"has":[12,216],"resulted":[13],"growing":[15],"privacy":[16],"concerns":[17],"for":[18,176],"users.":[19],"First,":[20],"although":[21],"keeping":[22],"encrypted":[24,87,143],"at":[25],"all":[26],"times":[27],"is":[28,75,79,86,95,187,255,269,290,335],"an":[29,172],"attractive":[30],"approach":[31],"to":[32,48,52,105,129,135,297,321,326],"privacy,":[33],"encryption":[34],"may":[35],"preclude":[36],"mining":[37],"and":[38,121,145,182,209,219,236,248,303],"learning":[39,310],"useful":[40],"patterns":[41],"from":[42],"data.":[43,224,314],"Second,":[44],"companies":[45],"are":[46,66],"unable":[47],"distribute":[49],"proprietary":[50,252],"programs":[51,65,264],"other":[53],"parties":[54],"without":[55,309],"risking":[56],"loss":[58],"their":[60],"private":[61,246],"code":[62],"when":[63,83,213],"those":[64,73],"reverse":[67],"engineered.":[68],"A":[69],"challenge":[70,109],"underlying":[71,108],"both":[72],"problems":[74],"that":[76,84,101,138,239,258,293,313,344],"how":[77,128],"accessed":[80],"\u2014":[81,88,234,238],"even":[82],"can":[89,102],"leak":[90],"secret":[91],"information.":[92],"Oblivious":[93,119,158,191,347],"RAM":[94,159,193,263],"a":[96,256,275,291,299],"well":[97],"studied":[98],"cryptographic":[99],"primitive":[100],"be":[103],"used":[104],"solve":[106],"hiding":[111],"data-access":[112],"patterns.":[113],"In":[114],"this":[115,153,229],"dissertation,":[116],"we":[117],"improve":[118],"RAMs":[120],"oblivious":[122,133,342],"algorithms":[123,134,305,343],"asymptotically.":[124],"We":[125],"then":[126],"show":[127],"apply":[130],"our":[131],"novel":[132],"build":[136],"systems":[137,233],"enable":[139],"privacy-preserving":[140],"computation":[141,175,320,328],"on":[142,245],"program":[146],"obfuscation.":[147],"Specifically,":[148],"first":[150,163,189,271,339],"part":[151,227],"dissertation":[154,230],"shows":[155],"two":[156,232],"efficient":[157],"algorithms:":[160],"1)":[161],"algorithm":[164,186],"achieves":[165,259],"sub-logarithmic":[166],"bandwidth":[167,198],"blowup":[168,212],"while":[169],"only":[170],"incurring":[171],"inexpensive":[173],"XOR":[174],"performing":[177],"Private":[178],"Information":[179],"Retrieval":[180],"operations,":[181],"2)":[183],"second":[185,226],"perfectly-secure":[190],"Parallel":[192],"with":[194],"$O(\\log^3":[195],"N":[196],")$":[197],"blowup,":[199,208],"$O((\\log":[200],"m":[201],"+":[202],"\\log":[203,204],"N)\\log":[205],"N)$":[206],"depth":[207],"$O(1)$":[210],"space":[211],"PRAM":[215],"$m$":[217],"CPUs":[218],"stores":[220],"$N$":[221],"blocks":[222],"describes":[231],"HOP":[235,254],"GraphSC":[237,289,315],"address":[240],"problem":[242],"computing":[244],"distribution":[250],"programs.":[253],"system":[257,292],"simulation-secure":[260],"obfuscation":[261,281],"assuming":[265],"secure":[266,277,319],"hardware.":[267],"It":[268,334],"prototype":[272],"implementation":[273],"provably":[276],"virtual":[278],"black-box":[279],"(VBB)":[280],"scheme":[282],"any":[284,287],"model":[285],"under":[286],"assumptions.":[288],"allows":[294],"run":[298],"class":[300],"data-mining":[302],"machine-learning":[304],"over":[306],"users\u2019":[307],"anything":[311],"about":[312],"brings":[316],"efficient,":[317],"parallel":[318,341],"programmers":[322],"allowing":[324],"them":[325],"express":[327],"tasks":[329],"using":[330],"GraphLab":[332],"abstraction.":[333],"backed":[336],"non-trivial":[340],"outperform":[345],"generic":[346],"RAMs.":[348]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}