{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:06:42Z","timestamp":1758845202795,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672300"],"award-info":[{"award-number":["61672300"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Natural Science Foundation of Tianjin","award":["16JCYBJC15500"],"award-info":[{"award-number":["16JCYBJC15500"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2020,4,1]]},"DOI":"10.1109\/tkde.2019.2891581","type":"journal-article","created":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T19:57:18Z","timestamp":1547063838000},"page":"714-727","source":"Crossref","is-referenced-by-count":35,"title":["NewMCOS: Towards a Practical Multi-Cloud Oblivious Storage Scheme"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2984-2661","authenticated-orcid":false,"given":"Zheli","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7652-1046","authenticated-orcid":false,"given":"Bo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5541-6554","authenticated-orcid":false,"given":"Yanyu","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5252-0831","authenticated-orcid":false,"given":"Yang","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9335-9930","authenticated-orcid":false,"given":"Witold","family":"Pedrycz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978381"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978357"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2382536.2382540"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994528"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813649"},{"key":"ref30","first-page":"945","article-title":"OblivP2P: An oblivious Peer-to-Peer content sharing system","author":"jia","year":"2016","journal-title":"Proc Usenix Security Symp"},{"key":"ref37","first-page":"619","article-title":"Oblivious multi-party machine learning on trusted processors","volume":"16","author":"ohrimenko","year":"2016","journal-title":"Proc Usenix Security Symp"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382251"},{"key":"ref35","first-page":"359","article-title":"ObliVM: A programming framework for secure computation","author":"liu","year":"2016","journal-title":"Proc IEEE Symp Security Privacy"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516692"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813700"},{"key":"ref40","first-page":"502","article-title":"Oblivious RAM revisited","author":"pinkas","year":"2010","journal-title":"Proc 30th Annu Conf Adv Cryptology"},{"key":"ref11","first-page":"707","article-title":"All your queries are belong to Us: The power of file-injection attacks on searchable encryption","author":"zhang","year":"2016","journal-title":"Proc Usenix Security Symp"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978386"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"ref14","article-title":"Towards practical oblivious RAM","author":"stefanov","year":"2012","journal-title":"Proc Symp Netw Distrib Syst Security"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516673"},{"key":"ref16","article-title":"Oblivistore: High performance oblivious distributed cloud data store","author":"stefanov","year":"2013","journal-title":"Proc Symp Netw Distrib Syst Security"},{"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 Security Symp"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813634"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813701"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467797"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660314"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488336"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113304"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49099-0_7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588893"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1037187.1024403"},{"key":"ref7","first-page":"283","article-title":"Opaque: An oblivious and encrypted distributed analytics platform","author":"zheng","year":"2017","journal-title":"Proc 5th USENIX Symp Netw Syst Des Implementation"},{"key":"ref2","article-title":"Orthogonal security with cipherbase","author":"arasu","year":"2013","journal-title":"Proc Biennial Conf Innovative Data Syst Res"},{"key":"ref9","article-title":"Access pattern disclosure on searchable encryption: Ramification, attack and mitigation","author":"islam","year":"2012","journal-title":"Proc Symp Network and Distributed System Security"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043566"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49099-0_6"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516692"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46298-1_27"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CSCloud.2016.24"},{"key":"ref42","first-page":"491","article-title":"S$^3$3ORAM: A computation-efficient and constant client bandwidth blowup ORAM with shamir secret sharing","author":"hoang","year":"2017","journal-title":"Proc ACM SIGSAC Conf Comput Commun Security"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_11"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23033"},{"key":"ref23","first-page":"415","article-title":"Constants count: Practical improvements to oblivious RAM","author":"ren","year":"2015","journal-title":"Proc 24th USENIX Conf Security Symp"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2382536.2382540"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48797-6_15"},{"article-title":"Revisiting definitional foundations of oblivious RAM for secure processor implementations","year":"2017","author":"haider","key":"ref43"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/9027048\/08606142.pdf?arnumber=8606142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:41:50Z","timestamp":1651070510000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8606142\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,1]]},"references-count":45,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2891581","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2020,4,1]]}}}