{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T22:10:08Z","timestamp":1771279808874,"version":"3.50.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1109\/tc.2025.3644452","type":"journal-article","created":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T18:40:53Z","timestamp":1766428853000},"page":"1014-1027","source":"Crossref","is-referenced-by-count":0,"title":["Path Weaver ORAM: Improving ORAM Throughput via Random Path Scheduling"],"prefix":"10.1109","volume":"75","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-6569-6093","authenticated-orcid":false,"given":"Siyuan","family":"Ma","sequence":"first","affiliation":[{"name":"College of Cryptology and Cyber Science, Nankai University, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-4453-8096","authenticated-orcid":false,"given":"Taoteng","family":"Liao","sequence":"additional","affiliation":[{"name":"College of Cryptology and Cyber Science, Nankai University, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-0013-2192","authenticated-orcid":false,"given":"Wei","family":"Shi","sequence":"additional","affiliation":[{"name":"School of Interdisciplinary Studies, Lingnan University, Tuen Mun, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8006-9109","authenticated-orcid":false,"given":"Yanlong","family":"Wen","sequence":"additional","affiliation":[{"name":"College of Computer Science, Nankai University, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3177872"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2017.9"},{"key":"ref4","first-page":"415","article-title":"Constants count: Practical improvements to oblivious ram","volume-title":"Proc. USENIX Secur. Symp.","author":"Ren","year":"2015"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/iccd.2018.00024"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2830772.2830787"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2018.00082"},{"key":"ref8","first-page":"659","article-title":"$\\rho$\u03c1: Relaxed hierarchical ORAM","volume-title":"Proc. 24th Int. Conf. Archit. Support Program. Lang. Oper. Syst.","author":"Nagarajan","year":"2019"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/hpca53966.2022.00034"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2025.3533089"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA56546.2023.10071064"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO56248.2022.00021"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA51647.2021.00012"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00043"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00044"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2023.3248272"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840761"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96881-0_18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3123939.3124546"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/micro.2014.28"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/micro.2018.00068"},{"key":"ref22","first-page":"360","article-title":"New attacks and defense for encrypted-address cache","volume-title":"Proc. 46th Int. Symp. Comput. Archit.","author":"Qureshi","year":"2019"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2020.24086"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250723"},{"key":"ref25","article-title":"Towards practical oblivious RAM","author":"Stefanov","year":"2011"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_11"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49099-0_6"},{"key":"ref28","first-page":"491","article-title":"S3ORAM: A computation-efficient and constant client bandwidth blowup ORAM with Shamir secret sharing","volume-title":"Proc. ACM SIGSAC Conf. Comput. Commun. Secur.","author":"Hoang","year":"2017"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516692"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750413"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom50675.2020.00131"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2485922.2485971"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694353"},{"key":"ref34","first-page":"1","article-title":"PanORAMa: Oblivious RAM with logarithmic overhead","volume-title":"Proc. IACR Cryptology ePrint Archive","author":"Patel","year":"2018"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2_14"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623125"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.45"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2024716.2024718"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/pmbs49563.2019.00012"},{"key":"ref40","article-title":"USIMM: The Utah simulated memory module","author":"Chatterjee","year":"2012"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3240302.3240317"},{"key":"ref42","article-title":"The spec CPU 2017 benchmark package","year":"2025"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/hpca.2014.6835932"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/12\/11392777\/11311566.pdf?arnumber=11311566","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T21:06:10Z","timestamp":1771275970000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11311566\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":43,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tc.2025.3644452","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]}}}