{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:15:50Z","timestamp":1750220150067,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T00:00:00Z","timestamp":1669680000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,29]]},"DOI":"10.1145\/3563768.3565547","type":"proceedings-article","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T18:49:27Z","timestamp":1669920567000},"page":"25-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Proving Obliviousness of Probabilistic Algorithms with Formal Verification"],"prefix":"10.1145","author":[{"given":"Pengbo","family":"Yan","sequence":"first","affiliation":[{"name":"University of Melbourne, Australia"}]}],"member":"320","published-online":{"date-parts":[[2022,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3371123"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-5906-5_557"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-5906-5_588"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132769"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"R. Cramer I.B. Damg\u00e5rd and J.B. Nielsen. 2015. Secure Multiparty Computation. Cambridge University Press. isbn:9781107043053 lccn:2015002282 https:\/\/books.google.com.au\/books?id=1AnarQEACAAJ","DOI":"10.1017\/CBO9781107337756"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3371118"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049697.2049701"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2133601.2133604"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487726.2488370"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158121"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813695"},{"volume-title":"The Melbourne Shuffle: Improving Oblivious Storage in the Cloud","author":"Ohrimenko Olga","key":"e_1_3_2_1_14_1","unstructured":"Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, and Eli Upfal. 2014. The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. In Automata, Languages, and Programming, Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 556\u2013567. isbn:978-3-662-43951-7"},{"key":"e_1_3_2_1_15_1","volume-title":"Oblivious Multi-Party Machine Learning on Trusted Processors. In 25th USENIX Security Symposium (USENIX Security 16)","author":"Ohrimenko Olga","year":"2016","unstructured":"Olga Ohrimenko, Felix Schuster, Cedric Fournet, Aastha Mehta, Sebastian Nowozin, Kapil Vaswani, and Manuel Costa. 2016. Oblivious Multi-Party Machine Learning on Trusted Processors. In 25th USENIX Security Symposium (USENIX Security 16). USENIX Association, Austin, TX. 619\u2013636. isbn:978-1-931971-32-4 https:\/\/www.usenix.org\/conference\/usenixsecurity16\/technical-sessions\/presentation\/ohrimenko"},{"volume-title":"Oblivious Sampling Algorithms for Private Data Analysis","author":"Sasy Sajin","key":"e_1_3_2_1_16_1","unstructured":"Sajin Sasy and Olga Ohrimenko. 2019. Oblivious Sampling Algorithms for Private Data Analysis. Curran Associates Inc., Red Hook, NY, USA."},{"key":"e_1_3_2_1_17_1","volume-title":"ObliCheck: Efficient Verification of Oblivious Algorithms with Unobservable State. In 30th USENIX Security Symposium (USENIX Security 21)","author":"Son Jeongseok","year":"2021","unstructured":"Jeongseok Son, Griffin Prechter, Rishabh Poddar, Raluca Ada Popa, and Koushik Sen. 2021. ObliCheck: Efficient Verification of Oblivious Algorithms with Unobservable State. In 30th USENIX Security Symposium (USENIX Security 21). USENIX Association, 2219\u20132236. isbn:978-1-939133-24-3 https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/son"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3152701.3152706"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498713"},{"key":"e_1_3_2_1_20_1","volume-title":"Opaque: An Oblivious and Encrypted Distributed Analytics Platform. In 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17)","author":"Zheng Wenting","year":"2017","unstructured":"Wenting Zheng, Ankur Dave, Jethro G. Beekman, Raluca Ada Popa, Joseph E. Gonzalez, and Ion Stoica. 2017. Opaque: An Oblivious and Encrypted Distributed Analytics Platform. In 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17). USENIX Association, Boston, MA. 283\u2013298. isbn:978-1-931971-37-9 https:\/\/www.usenix.org\/conference\/nsdi17\/technical-sessions\/presentation\/zheng"}],"event":{"name":"SPLASH Companion '22: 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Auckland New Zealand","acronym":"SPLASH Companion '22"},"container-title":["Companion Proceedings of the 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3563768.3565547","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3563768.3565547","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:07Z","timestamp":1750186807000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3563768.3565547"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,29]]},"references-count":20,"alternative-id":["10.1145\/3563768.3565547","10.1145\/3563768"],"URL":"https:\/\/doi.org\/10.1145\/3563768.3565547","relation":{},"subject":[],"published":{"date-parts":[[2022,11,29]]},"assertion":[{"value":"2022-12-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}