{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T05:11:23Z","timestamp":1770354683495,"version":"3.49.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1109\/hpec.2013.6670339","type":"proceedings-article","created":{"date-parts":[[2013,12,3]],"date-time":"2013-12-03T21:58:31Z","timestamp":1386107911000},"page":"1-6","source":"Crossref","is-referenced-by-count":23,"title":["Integrity verification for path Oblivious-RAM"],"prefix":"10.1109","author":[{"given":"Ling","family":"Ren","sequence":"first","affiliation":[]},{"given":"Christopher W.","family":"Fletcher","sequence":"additional","affiliation":[]},{"given":"Xiangyao","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Marten","family":"van Dijk","sequence":"additional","affiliation":[]},{"given":"Srinivas","family":"Devadas","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","first-page":"168","article-title":"Architectural support for copy and tamper resistant software","author":"lie","year":"2000","journal-title":"Proceedings of the 9th Int'l Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOSIX)"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2003.1199335"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945463"},{"key":"15","author":"stefanov","year":"2013","journal-title":"Path O-RAM An Extremely Simple Oblivious RAM Protocol"},{"key":"16","author":"grawrock","year":"2006","journal-title":"The Intel Safer Computing Initiative Building Blocks for Trusted Computing"},{"key":"13","article-title":"Towards practical oblivious RAM","author":"stefanov","year":"2012","journal-title":"NDSS"},{"key":"14","author":"stefanov","year":"2012","journal-title":"Path O-RAM An Extremely Simple Oblivious RAM Protocol"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/2133601.2133604"},{"key":"12","first-page":"197","article-title":"Oblivious ram with o((log n)3) worst-case cost","author":"shi","year":"2011","journal-title":"ASIACRYPT"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.22"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/782837.782838"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/2382536.2382540"},{"key":"23","article-title":"Ascend: An architecture for performing secure computation on encrypted data","author":"fletcher","year":"2013","journal-title":"MIT CSAIL CSG Technical Memo 508"},{"key":"24","first-page":"122","article-title":"Protocols for public key cryptography","author":"merkle","year":"1980","journal-title":"IEEE Symposium on Security and Privacy"},{"key":"25","first-page":"133","article-title":"Toward practical private access to data centers via parallel oram","volume":"2012","author":"lorch","year":"2012","journal-title":"IACR Cryptology ePrint Archive"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1145\/2485922.2485971"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/L-CA.2011.4"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2003.1183547"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1024393.1024403"},{"key":"10","doi-asserted-by":"crossref","DOI":"10.1145\/2382196.2382229","article-title":"Round-optimal access privacy on outsourced storage","author":"williams","year":"2012","journal-title":"CCS"},{"key":"1","article-title":"Access pattern disclosure on searchable encryption: Ramification, attack and mitigation","author":"islam","year":"2012","journal-title":"Network and Distributed System Security Symposium (NDSS)"},{"key":"7","article-title":"Remote oblivious storage: Making oblivious RAM practical","author":"boneh","year":"2011","journal-title":"Manuscript"},{"key":"6","article-title":"Perfectly secure oblivious RAM without random oracles","author":"damgard","year":"2011","journal-title":"TCC"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100289"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258606"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.13"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.14"}],"event":{"name":"2013 IEEE High Performance Extreme Computing Conference (HPEC)","location":"Waltham, MA, USA","start":{"date-parts":[[2013,9,10]]},"end":{"date-parts":[[2013,9,12]]}},"container-title":["2013 IEEE High Performance Extreme Computing Conference (HPEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6661474\/6670313\/06670339.pdf?arnumber=6670339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T11:24:50Z","timestamp":1564917890000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6670339\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/hpec.2013.6670339","relation":{},"subject":[],"published":{"date-parts":[[2013,9]]}}}