{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:50:36Z","timestamp":1740181836265,"version":"3.37.3"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Wuhan FRONTIER Program of Application Foundation","award":["2018010401011295"],"award-info":[{"award-number":["2018010401011295"]}]},{"name":"Wuhan Applied Basic Research Program of Foundation","award":["2017010201010117"],"award-info":[{"award-number":["2017010201010117"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Open J. Comput. Soc."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/ojcs.2020.3032020","type":"journal-article","created":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T19:39:26Z","timestamp":1603309166000},"page":"285-294","source":"Crossref","is-referenced-by-count":1,"title":["Etoram: A More Efficient ORAM for Secure Computation"],"prefix":"10.1109","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1510-7700","authenticated-orcid":false,"given":"Zhihong","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1495-7121","authenticated-orcid":false,"given":"Hai","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7943-3172","authenticated-orcid":false,"given":"Lin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2020.2980255"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03332-3_6"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30436-1_24"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.13"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2900304"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49099-0_6"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516692"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694385"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694353"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.25"},{"key":"ref17","first-page":"749","article-title":"Burst ORAM: Minimizing ORAM response times for bursty access patterns","author":"dautrich","year":"2014","journal-title":"Proc USENIX"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134051"},{"article-title":"Remote oblivious storage: Making oblivious RAM practical","year":"2011","author":"boneh","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813634"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660365"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133967"},{"key":"ref3","first-page":"797","article-title":"Faster private set intersection based on OT extension","author":"pinkas","year":"2014","journal-title":"Proc USENIX"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.02.071"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978429"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"ref8","article-title":"Towards practical oblivious RAM","author":"stefanov","year":"2011","journal-title":"Proc NDSS"},{"key":"ref7","first-page":"415","article-title":"Constants count: Practical improvements to oblivious RAM","author":"ren","year":"2015","journal-title":"Proc USENIX"},{"key":"ref2","first-page":"162","article-title":"How to generate and exchange secrets (extended abstract)","author":"yao","year":"1986","journal-title":"Proc IEEE FOCS"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23033"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39077-7_1"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382299"},{"key":"ref24","first-page":"62","article-title":"Statistically-secure oram with ?O(log2n) overhead","author":"chung","year":"2014","journal-title":"Proc ASIACRYPT"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382251"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_22"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.21"}],"container-title":["IEEE Open Journal of the Computer Society"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8782664\/8821528\/09234703.pdf?arnumber=9234703","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T01:07:49Z","timestamp":1641949669000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9234703\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/ojcs.2020.3032020","relation":{},"ISSN":["2644-1268"],"issn-type":[{"type":"electronic","value":"2644-1268"}],"subject":[],"published":{"date-parts":[[2020]]}}}