{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:23Z","timestamp":1750306103691,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,21]],"date-time":"2017-08-21T00:00:00Z","timestamp":1503273600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["STARSS 1528108"],"award-info":[{"award-number":["STARSS 1528108"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"SRC","award":["2638.001"],"award-info":[{"award-number":["2638.001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,21]]},"DOI":"10.1145\/3106237.3106248","type":"proceedings-article","created":{"date-parts":[[2017,8,2]],"date-time":"2017-08-02T19:36:18Z","timestamp":1501702578000},"page":"649-660","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["A compiler and verifier for page access oblivious computation"],"prefix":"10.1145","author":[{"given":"Rohit","family":"Sinha","sequence":"first","affiliation":[{"name":"University of California at Berkeley, USA"}]},{"given":"Sriram","family":"Rajamani","sequence":"additional","affiliation":[{"name":"Microsoft Research, India"}]},{"given":"Sanjit A.","family":"Seshia","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,8,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"UCI Machine Learning Repository. https:\/\/archive.ics.uci.edu\/ml.  UCI Machine Learning Repository. https:\/\/archive.ics.uci.edu\/ml."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.04.028"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159842.1159851"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2804302.2804318"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_1_6_1","unstructured":"Intel Software\n      Guard Extensions Programming Reference\n    .\n   Available at https: \/\/software.intel.com\/sites\/default\/files\/329298-001.pdf 2014\n  .  Intel Software Guard Extensions Programming Reference. Available at https: \/\/software.intel.com\/sites\/default\/files\/329298-001.pdf 2014."},{"key":"e_1_3_2_1_7_1","first-page":"288","volume-title":"Proceedings of the General Track of the Annual Conference on USENIX Annual Technical Conference, ATEC \u201902","author":"Jim T.","year":"2002","unstructured":"T. Jim , J. G. Morrisett , D. Grossman , M. W. Hicks , J. Cheney , and Y. Wang . Cyclone: A safe dialect of c . In Proceedings of the General Track of the Annual Conference on USENIX Annual Technical Conference, ATEC \u201902 , pages 275\u2013 288 , Berkeley, CA, USA , 2002 . USENIX Association. T. Jim, J. G. Morrisett, D. Grossman, M. W. Hicks, J. Cheney, and Y. Wang. Cyclone: A safe dialect of c. In Proceedings of the General Track of the Annual Conference on USENIX Annual Technical Conference, ATEC \u201902, pages 275\u2013288, Berkeley, CA, USA, 2002. USENIX Association."},{"key":"e_1_3_2_1_8_1","unstructured":"Joanna Rutkowska. Red Pill... or how to detect VMM using (almost) one CPU instruction. https:\/\/github.com\/Cr4sh\/ThinkPwn.git.  Joanna Rutkowska. Red Pill... or how to detect VMM using (almost) one CPU instruction. https:\/\/github.com\/Cr4sh\/ThinkPwn.git."},{"key":"e_1_3_2_1_9_1","unstructured":"Lenovo ThinkPad System Management Mode arbitrary code execution 0day exploit. Available at https:\/\/github.com\/Cr4sh\/ThinkPwn.git.  Lenovo ThinkPad System Management Mode arbitrary code execution 0day exploit. Available at https:\/\/github.com\/Cr4sh\/ThinkPwn.git."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2775054.2694385"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2013.11"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.29"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/319301.319345"},{"key":"e_1_3_2_1_14_1","first-page":"636","volume-title":"25th USENIX Security Symposium (USENIX Security 16)","author":"Ohrimenko O.","year":"2016","unstructured":"O. Ohrimenko , F. Schuster , C. Fournet , A. Mehta , S. Nowozin , K. Vaswani , and M. Costa . Oblivious multi-party machine learning on trusted processors . In 25th USENIX Security Symposium (USENIX Security 16) , pages 619\u2013 636 , Austin, TX , Aug. 2016 . USENIX Association. O. Ohrimenko, F. Schuster, C. Fournet, A. Mehta, S. Nowozin, K. Vaswani, and M. Costa. Oblivious multi-party machine learning on trusted processors. In 25th USENIX Security Symposium (USENIX Security 16), pages 619\u2013636, Austin, TX, Aug. 2016. USENIX Association."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2490301.2451150"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.10"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897845.2897885"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908080.2908113"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813608"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.45"}],"event":{"name":"ESEC\/FSE'17: Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Paderborn Germany","acronym":"ESEC\/FSE'17"},"container-title":["Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3106237.3106248","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3106237.3106248","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3106237.3106248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:36Z","timestamp":1750217436000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3106237.3106248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,21]]},"references-count":20,"alternative-id":["10.1145\/3106237.3106248","10.1145\/3106237"],"URL":"https:\/\/doi.org\/10.1145\/3106237.3106248","relation":{},"subject":[],"published":{"date-parts":[[2017,8,21]]},"assertion":[{"value":"2017-08-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}