{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:50:02Z","timestamp":1750308602354,"version":"3.41.0"},"reference-count":83,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T00:00:00Z","timestamp":1576800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-15-2-0104,FA8750-16-C-0022"],"award-info":[{"award-number":["FA8750-15-2-0104,FA8750-16-C-0022"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1563722, CNS-1314857, CNS-1111599, CCF-1901278"],"award-info":[{"award-number":["CNS-1563722, CNS-1314857, CNS-1111599, CCF-1901278"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011039","name":"Intelligence Advanced Research Projects Activity","doi-asserted-by":"publisher","award":["2019-1902070008"],"award-info":[{"award-number":["2019-1902070008"]}],"id":[{"id":"10.13039\/100011039","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2020,1]]},"abstract":"<jats:p>An oblivious computation is one that is free of direct and indirect information leaks, e.g., due to observable differences in timing and memory access patterns. This paper presents Lambda Obliv, a core language whose type system enforces obliviousness. Prior work on type-enforced oblivious computation has focused on deterministic programs. Lambda Obliv is new in its consideration of programs that implement probabilistic algorithms, such as those involved in cryptography. Lambda Obliv employs a substructural type system and a novel notion of probability region to ensure that information is not leaked via the observed distribution of visible events. Probability regions support reasoning about probabilistic correlation and independence between values, and our use of probability regions is motivated by a source of unsoundness that we discovered in the type system of ObliVM, a language for implementing state of the art oblivious algorithms. We prove that Lambda Obliv's type system enforces obliviousness and show that it is expressive enough to typecheck advanced tree-based oblivious RAMs.<\/jats:p>","DOI":"10.1145\/3371118","type":"journal-article","created":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T19:45:25Z","timestamp":1576871125000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["A language for probabilistically oblivious computation"],"prefix":"10.1145","volume":"4","author":[{"given":"David","family":"Darais","sequence":"first","affiliation":[{"name":"University of Vermont, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Sweet","sequence":"additional","affiliation":[{"name":"University of Maryland, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang","family":"Liu","sequence":"additional","affiliation":[{"name":"Citadel Securities, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Hicks","sequence":"additional","affiliation":[{"name":"University of Maryland, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,12,20]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Johan Agat. 2000. Transforming out Timing Leaks. In POPL.  Johan Agat. 2000. Transforming out Timing Leaks. In POPL.","DOI":"10.1145\/325694.325702"},{"key":"e_1_2_2_2_1","volume-title":"Myers","author":"Askarov Aslan","year":"2010","unstructured":"Aslan Askarov , Danfeng Zhang , and Andrew C . Myers . 2010 . Predictive black-box mitigation of timing channels. In CCS. Aslan Askarov, Danfeng Zhang, and Andrew C. Myers. 2010. Predictive black-box mitigation of timing channels. In CCS."},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/142137.142162"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2016.09.031"},{"volume-title":"An AssertionBased Program Logic for Probabilistic Programs","author":"Barthe Gilles","key":"e_1_2_2_5_1","unstructured":"Gilles Barthe , Thomas Espitau , Marco Gaboardi , Benjamin Gr\u00e9goire , Justin Hsu , and Pierre-Yves Strub . 2018. An AssertionBased Program Logic for Probabilistic Programs . In Programming Languages and Systems, Amal Ahmed (Ed.). Springer International Publishing , Cham , 117\u2013144. Gilles Barthe, Thomas Espitau, Marco Gaboardi, Benjamin Gr\u00e9goire, Justin Hsu, and Pierre-Yves Strub. 2018. An AssertionBased Program Logic for Probabilistic Programs. In Programming Languages and Systems, Amal Ahmed (Ed.). Springer International Publishing, Cham, 117\u2013144."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.29007\/vz48"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535847"},{"key":"e_1_2_2_8_1","volume-title":"Justin Hsu, Aaron Roth, and Pierre-Yves Strub.","author":"Barthe Gilles","year":"2015","unstructured":"Gilles Barthe , Marco Gaboardi , Emilio Jes\u00fas Gallego Arias , Justin Hsu, Aaron Roth, and Pierre-Yves Strub. 2015 . Higher-order approximate relational refinement types for mechanism design and differential privacy. In ACM SIGPLAN Notices, Vol. 50 . ACM , 55\u201368. Gilles Barthe, Marco Gaboardi, Emilio Jes\u00fas Gallego Arias, Justin Hsu, Aaron Roth, and Pierre-Yves Strub. 2015. Higher-order approximate relational refinement types for mechanism design and differential privacy. In ACM SIGPLAN Notices, Vol. 50. ACM, 55\u201368."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009896"},{"key":"e_1_2_2_10_1","volume-title":"POPL","author":"Barthe Gilles","year":"2020","unstructured":"Gilles Barthe , Justin Hsu , and Kevin Liao . 2020. A Probabilistic Separation Logic. PACMPL 4 , POPL ( 2020 ). Gilles Barthe, Justin Hsu, and Kevin Liao. 2020. A Probabilistic Separation Logic. PACMPL 4, POPL (2020)."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492061"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1805974.1805977"},{"key":"e_1_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Marina Blanton Aaron Steele and Mehrdad Alisagari. 2013. Data-oblivious Graph Algorithms for Secure Computation and Outsourcing. In ASIA CCS.  Marina Blanton Aaron Steele and Mehrdad Alisagari. 2013. Data-oblivious Graph Algorithms for Secure Computation and Outsourcing. In ASIA CCS.","DOI":"10.1145\/2484313.2484341"},{"key":"e_1_2_2_14_1","unstructured":"David Brumley and Dan Boneh. 2003. Remote Timing Attacks Are Practical. In USENIX Security.  David Brumley and Dan Boneh. 2003. Remote Timing Attacks Are Practical. In USENIX Security."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.150"},{"volume-title":"Proceedings of the 22nd Annual Symposium on Foundations of Computer Science (SFCS).","author":"Dolev D.","key":"e_1_2_2_17_1","unstructured":"D. Dolev and A. C. Yao . 1981. On the Security of Public Key Protocols . In Proceedings of the 22nd Annual Symposium on Foundations of Computer Science (SFCS). D. Dolev and A. C. Yao. 1981. On the Security of Public Key Protocols. In Proceedings of the 22nd Annual Symposium on Foundations of Computer Science (SFCS)."},{"key":"e_1_2_2_18_1","volume-title":"Hendren","author":"Emami Maryam","year":"1994","unstructured":"Maryam Emami , Rakesh Ghiya , and Laurie J . Hendren . 1994 . Context-sensitive Interprocedural Points-to Analysis in the Presence of Function Pointers. In PLDI. Maryam Emami, Rakesh Ghiya, and Laurie J. Hendren. 1994. Context-sensitive Interprocedural Points-to Analysis in the Presence of Function Pointers. In PLDI."},{"key":"e_1_2_2_19_1","doi-asserted-by":"crossref","unstructured":"David Eppstein Michael T. Goodrich and Roberto Tamassia. 2010. Privacy-preserving data-oblivious geometric algorithms for geographic data. In GIS.  David Eppstein Michael T. Goodrich and Roberto Tamassia. 2010. Privacy-preserving data-oblivious geometric algorithms for geographic data. In GIS.","DOI":"10.1145\/1869790.1869796"},{"key":"e_1_2_2_20_1","volume-title":"The revised report on the syntactic theories of sequential control and state. Theoretical computer science 103, 2","author":"Felleisen Matthias","year":"1992","unstructured":"Matthias Felleisen and Robert Hieb . 1992. The revised report on the syntactic theories of sequential control and state. Theoretical computer science 103, 2 ( 1992 ), 235\u2013271. Matthias Felleisen and Robert Hieb. 1992. The revised report on the syntactic theories of sequential control and state. Theoretical computer science 103, 2 (1992), 235\u2013271."},{"key":"e_1_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Christopher W. Fletcher Ling Ren Xiangyao Yu Marten van Dijk Omer Khan and Srinivas Devadas. 2014. Suppressing the Oblivious RAM timing channel while making information leakage and program efficiency trade-offs. In HPCA.  Christopher W. Fletcher Ling Ren Xiangyao Yu Marten van Dijk Omer Khan and Srinivas Devadas. 2014. Suppressing the Oblivious RAM timing channel while making information leakage and program efficiency trade-offs. In HPCA.","DOI":"10.1109\/HPCA.2014.6835932"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429113"},{"volume-title":"Categorical Aspects of Topology and Analysis","author":"Giry Mich\u00e8le","key":"e_1_2_2_23_1","unstructured":"Mich\u00e8le Giry . 1982. A categorical approach to probability theory . In Categorical Aspects of Topology and Analysis , B. Banaschewski (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 68\u201385. Mich\u00e8le Giry. 1982. A categorical approach to probability theory. In Categorical Aspects of Topology and Analysis, B. Banaschewski (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 68\u201385."},{"key":"e_1_2_2_24_1","doi-asserted-by":"crossref","unstructured":"J.A. Goguen and J. Meseguer. 1982. Security policy and security models. In IEEE S &amp; P.  J.A. Goguen and J. Meseguer. 1982. Security policy and security models. In IEEE S &amp; P.","DOI":"10.1109\/SP.1982.10014"},{"key":"e_1_2_2_25_1","doi-asserted-by":"crossref","unstructured":"O. Goldreich. 1987. Towards a theory of software protection and simulation by oblivious RAMs. In STOC.  O. Goldreich. 1987. Towards a theory of software protection and simulation by oblivious RAMs. In STOC.","DOI":"10.1145\/28395.28416"},{"key":"e_1_2_2_26_1","doi-asserted-by":"crossref","unstructured":"O. Goldreich S. Micali and A. Wigderson. 1987. How to play ANY mental game. In STOC.  O. Goldreich S. Micali and A. Wigderson. 1987. How to play ANY mental game. In STOC.","DOI":"10.1145\/28395.28420"},{"key":"e_1_2_2_27_1","volume-title":"Software protection and simulation on oblivious RAMs. J. ACM","author":"Goldreich Oded","year":"1996","unstructured":"Oded Goldreich and Rafail Ostrovsky . 1996. Software protection and simulation on oblivious RAMs. J. ACM ( 1996 ). Oded Goldreich and Rafail Ostrovsky. 1996. Software protection and simulation on oblivious RAMs. J. ACM (1996)."},{"key":"e_1_2_2_28_1","volume-title":"Data-Oblivious Graph Drawing Model and Algorithms. CoRR abs\/1209.0756","author":"Goodrich Michael T.","year":"2012","unstructured":"Michael T. Goodrich , Olga Ohrimenko , and Roberto Tamassia . 2012. Data-Oblivious Graph Drawing Model and Algorithms. CoRR abs\/1209.0756 ( 2012 ). Michael T. Goodrich, Olga Ohrimenko, and Roberto Tamassia. 2012. Data-Oblivious Graph Drawing Model and Algorithms. CoRR abs\/1209.0756 (2012)."},{"key":"e_1_2_2_29_1","unstructured":"Matt Hoekstra. 2015. Intel SGX for Dummies (Intel SGX Design Objectives). https:\/\/software.intel.com\/en- us\/blogs\/2013\/ 09\/26\/protecting- application- secrets- with- intel- sgx .  Matt Hoekstra. 2015. Intel SGX for Dummies (Intel SGX Design Objectives). https:\/\/software.intel.com\/en- us\/blogs\/2013\/ 09\/26\/protecting- application- secrets- with- intel- sgx ."},{"key":"e_1_2_2_30_1","volume-title":"Probabilistic Couplings for Probabilistic Reasoning. CoRR abs\/1710.09951","author":"Hsu Justin","year":"2017","unstructured":"Justin Hsu . 2017. Probabilistic Couplings for Probabilistic Reasoning. CoRR abs\/1710.09951 ( 2017 ). arXiv: 1710.09951 http:\/\/arxiv.org\/abs\/1710.09951 Justin Hsu. 2017. Probabilistic Couplings for Probabilistic Reasoning. CoRR abs\/1710.09951 (2017). arXiv: 1710.09951 http:\/\/arxiv.org\/abs\/1710.09951"},{"volume-title":"An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages","author":"Huang Daniel","key":"e_1_2_2_31_1","unstructured":"Daniel Huang and Greg Morrisett . 2016. An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages . In Programming Languages and Systems, Peter Thiemann (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 337\u2013363. Daniel Huang and Greg Morrisett. 2016. An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages. In Programming Languages and Systems, Peter Thiemann (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 337\u2013363."},{"key":"e_1_2_2_32_1","volume-title":"Attack and Mitigation. In Network and Distributed System Security Symposium (NDSS).","author":"Islam Mohammad","year":"2012","unstructured":"Mohammad Islam , Mehmet Kuzu , and Murat Kantarcioglu . 2012 . Access Pattern disclosure on Searchable Encryption: Ramification , Attack and Mitigation. In Network and Distributed System Security Symposium (NDSS). Mohammad Islam, Mehmet Kuzu, and Murat Kantarcioglu. 2012. Access Pattern disclosure on Searchable Encryption: Ramification, Attack and Mitigation. In Network and Distributed System Security Symposium (NDSS)."},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158154"},{"key":"e_1_2_2_34_1","volume-title":"Spectre Attacks: Exploiting Speculative Execution. In IEEE Symposium on Security and Privacy (S&amp;P).","author":"Kocher Paul","year":"2019","unstructured":"Paul Kocher , Jann Horn , Anders Fogh , , Daniel Genkin , Daniel Gruss , Werner Haas , Mike Hamburg , Moritz Lipp , Stefan Mangard , Thomas Prescher , Michael Schwarz , and Yuval Yarom . 2019 . Spectre Attacks: Exploiting Speculative Execution. In IEEE Symposium on Security and Privacy (S&amp;P). Paul Kocher, Jann Horn, Anders Fogh, , Daniel Genkin, Daniel Gruss, Werner Haas, Mike Hamburg, Moritz Lipp, Stefan Mangard, Thomas Prescher, Michael Schwarz, and Yuval Yarom. 2019. Spectre Attacks: Exploiting Speculative Execution. In IEEE Symposium on Security and Privacy (S&amp;P)."},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/996566.996771"},{"key":"e_1_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Paul C. Kocher. 1996. Timing Attacks on Implementations of Diffie-Hellman RSA DSS and Other Systems. In CRYPTO.  Paul C. Kocher. 1996. Timing Attacks on Implementations of Diffie-Hellman RSA DSS and Other Systems. In CRYPTO.","DOI":"10.1007\/3-540-68697-5_9"},{"key":"e_1_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Boris K\u00f6pf and Andrey Rybalchenko. 2013. Automation of quantitative information-flow analysis. In Formal Methods for Dynamical Systems.  Boris K\u00f6pf and Andrey Rybalchenko. 2013. Automation of quantitative information-flow analysis. In Formal Methods for Dynamical Systems.","DOI":"10.1007\/978-3-642-38874-3_1"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.38"},{"key":"e_1_2_2_39_1","volume-title":"A Note on the Confinement Problem. Commun. ACM","author":"Lampson Butler W.","year":"1973","unstructured":"Butler W. Lampson . 1973. A Note on the Confinement Problem. Commun. ACM ( 1973 ). Butler W. Lampson. 1973. A Note on the Confinement Problem. Commun. ACM (1973)."},{"key":"e_1_2_2_40_1","volume-title":"Meltdown: Reading Kernel Memory from User Space. In USENIX Security.","author":"Lipp Moritz","year":"2018","unstructured":"Moritz Lipp , Michael Schwarz , Daniel Gruss , Thomas Prescher , Werner Haas , Anders Fogh , Jann Horn , Stefan Mangard , Paul Kocher , Daniel Genkin , Yuval Yarom , and Mike Hamburg . 2018 . Meltdown: Reading Kernel Memory from User Space. In USENIX Security. Moritz Lipp, Michael Schwarz, Daniel Gruss, Thomas Prescher, Werner Haas, Anders Fogh, Jann Horn, Stefan Mangard, Paul Kocher, Daniel Genkin, Yuval Yarom, and Mike Hamburg. 2018. Meltdown: Reading Kernel Memory from User Space. In USENIX Security."},{"key":"e_1_2_2_41_1","volume-title":"Martin Maas, Michael Hicks, Mohit Tiwari, and Elaine Shi.","author":"Liu Chang","year":"2015","unstructured":"Chang Liu , Austin Harris , Martin Maas, Michael Hicks, Mohit Tiwari, and Elaine Shi. 2015 a. GhostRider: A HardwareSoftware System for Memory Trace Oblivious Computation. In ASPLOS. Chang Liu, Austin Harris, Martin Maas, Michael Hicks, Mohit Tiwari, and Elaine Shi. 2015a. GhostRider: A HardwareSoftware System for Memory Trace Oblivious Computation. In ASPLOS."},{"key":"e_1_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Chang Liu Michael Hicks and Elaine Shi. 2013. Memory Trace Oblivious Program Execution. In CSF.  Chang Liu Michael Hicks and Elaine Shi. 2013. Memory Trace Oblivious Program Execution. In CSF.","DOI":"10.1109\/CSF.2013.11"},{"volume-title":"Automating Efficient RAM-Model Secure Computation","author":"Liu Chang","key":"e_1_2_2_43_1","unstructured":"Chang Liu , Yan Huang , Elaine Shi , Jonathan Katz , and Michael Hicks . 2014. Automating Efficient RAM-Model Secure Computation . In IEEE S &amp; P. Chang Liu, Yan Huang, Elaine Shi, Jonathan Katz, and Michael Hicks. 2014. Automating Efficient RAM-Model Secure Computation. In IEEE S &amp; P."},{"key":"e_1_2_2_44_1","volume-title":"Kartik Nayak, Yan Huang, and Elaine Shi.","author":"Liu Chang","year":"2015","unstructured":"Chang Liu , Xiao Shaun Wang , Kartik Nayak, Yan Huang, and Elaine Shi. 2015 b. ObliVM: A Programming Framework for Secure Computation. In IEEE S &amp; P. Chang Liu, Xiao Shaun Wang, Kartik Nayak, Yan Huang, and Elaine Shi. 2015b. ObliVM: A Programming Framework for Secure Computation. In IEEE S &amp; P."},{"key":"e_1_2_2_45_1","volume-title":"Lee","author":"Liu Isaac","year":"2012","unstructured":"Isaac Liu , Jan Reineke , David Broman , Michael Zimmer , and Edward A . Lee . 2012 . A PRET microarchitecture implementation with repeatable timing and competitive performance. In ICCD. Isaac Liu, Jan Reineke, David Broman, Michael Zimmer, and Edward A. Lee. 2012. A PRET microarchitecture implementation with repeatable timing and competitive performance. In ICCD."},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516692"},{"key":"e_1_2_2_47_1","doi-asserted-by":"crossref","unstructured":"David Molnar Matt Piotrowski David Schultz and David Wagner. 2006. The Program Counter Security Model: Automatic Detection and Removal of Control-flow Side Channel Attacks. In ICISC.  David Molnar Matt Piotrowski David Schultz and David Wagner. 2006. The Program Counter Security Model: Automatic Detection and Removal of Control-flow Side Channel Attacks. In ICISC.","DOI":"10.1007\/11734727_14"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45099-3_17"},{"key":"e_1_2_2_49_1","volume-title":"Workshop on Quantitative Aspects of Programming Languages (QAPL).","author":"Mu Chunyan","year":"2009","unstructured":"Chunyan Mu and David Clark . 2009 . An abstraction quantifying information flow over probabilistic semantics . In Workshop on Quantitative Aspects of Programming Languages (QAPL). Chunyan Mu and David Clark. 2009. An abstraction quantifying information flow over probabilistic semantics. In Workshop on Quantitative Aspects of Programming Languages (QAPL)."},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-130492"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.5555\/3241094.3241143"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1452044.1452048"},{"key":"e_1_2_2_53_1","doi-asserted-by":"crossref","unstructured":"Norman Ramsey and Avi Pfeffer. 2002a. Stochastic Lambda Calculus and Monads of Probability Distributions. In POPL.  Norman Ramsey and Avi Pfeffer. 2002a. Stochastic Lambda Calculus and Monads of Probability Distributions. In POPL.","DOI":"10.1145\/503272.503288"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503288"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2015.12.021"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1932681.1863568"},{"key":"e_1_2_2_57_1","doi-asserted-by":"crossref","unstructured":"Ling Ren Xiangyao Yu Christopher W. Fletcher Marten van Dijk and Srinivas Devadas. 2013. Design space exploration and optimization of path oblivious RAM in secure processors. In ISCA.  Ling Ren Xiangyao Yu Christopher W. Fletcher Marten van Dijk and Srinivas Devadas. 2013. Design space exploration and optimization of path oblivious RAM in secure processors. In ISCA.","DOI":"10.1145\/2485922.2485971"},{"key":"e_1_2_2_58_1","volume-title":"Annual Asian Computing Science Conference (ASIAN).","author":"Russo Alejandro","year":"2006","unstructured":"Alejandro Russo , John Hughes , David A. Naumann , and Andrei Sabelfeld . 2006 . Closing Internal Timing Channels by Transformation . In Annual Asian Computing Science Conference (ASIAN). Alejandro Russo, John Hughes, David A. Naumann, and Andrei Sabelfeld. 2006. Closing Internal Timing Channels by Transformation. In Annual Asian Computing Science Conference (ASIAN)."},{"key":"e_1_2_2_59_1","unstructured":"Alejandro Russo and Andrei Sabelfeld. 2006. Securing interaction between threads and the scheduler. In CSF-W.  Alejandro Russo and Andrei Sabelfeld. 2006. Securing interaction between threads and the scheduler. In CSF-W."},{"key":"e_1_2_2_60_1","first-page":"1","article-title":"Language-based Information-flow Security","volume":"21","author":"Sabelfeld A.","year":"2006","unstructured":"A. Sabelfeld and A. C. Myers . 2006 . Language-based Information-flow Security . IEEE J.Sel. A. Commun. 21 , 1 (Sept. 2006). A. Sabelfeld and A. C. Myers. 2006. Language-based Information-flow Security. IEEE J.Sel. A. Commun. 21, 1 (Sept. 2006).","journal-title":"IEEE J.Sel. A. Commun."},{"key":"e_1_2_2_61_1","unstructured":"Andrei Sabelfeld and David Sands. 2000. Probabilistic noninterference for multi-threaded programs. In CSF-W.  Andrei Sabelfeld and David Sands. 2000. Probabilistic noninterference for multi-threaded programs. In CSF-W."},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290351"},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/2804302.2804317"},{"key":"e_1_2_2_64_1","unstructured":"Elaine Shi T.-H. Hubert Chan Emil Stefanov and Mingfei Li. 2011. Oblivious RAM with O((log N ) 3 ) Worst-Case Cost. In ASIACRYPT.  Elaine Shi T.-H. Hubert Chan Emil Stefanov and Mingfei Li. 2011. Oblivious RAM with O((log N ) 3 ) Worst-Case Cost. In ASIACRYPT."},{"key":"e_1_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290352"},{"key":"e_1_2_2_66_1","unstructured":"Geoffrey Smith. 2003. Probabilistic noninterference through weak probabilistic bisimulation. In CSF-W.  Geoffrey Smith. 2003. Probabilistic noninterference through weak probabilistic bisimulation. In CSF-W."},{"key":"e_1_2_2_67_1","volume-title":"Secure Information Flow with Random Assignment and Encryption. In Workshop on Formal Methods in Security (FMSE).","author":"Smith Geoffrey","year":"2006","unstructured":"Geoffrey Smith and Rafael Alp\u00edzar . 2006 . Secure Information Flow with Random Assignment and Encryption. In Workshop on Formal Methods in Security (FMSE). Geoffrey Smith and Rafael Alp\u00edzar. 2006. Secure Information Flow with Random Assignment and Encryption. In Workshop on Formal Methods in Security (FMSE)."},{"key":"e_1_2_2_68_1","doi-asserted-by":"crossref","unstructured":"Geoffrey Smith and Rafael Alp\u00edzar. 2007. Fast Probabilistic Simulation Nontermination and Secure Information Flow. In PLAS.  Geoffrey Smith and Rafael Alp\u00edzar. 2007. Fast Probabilistic Simulation Nontermination and Secure Information Flow. In PLAS.","DOI":"10.1145\/1255329.1255341"},{"key":"e_1_2_2_69_1","doi-asserted-by":"crossref","unstructured":"Emil Stefanov Marten van Dijk Elaine Shi Christopher Fletcher Ling Ren Xiangyao Yu and Srinivas Devadas. 2013. Path ORAM \u2013 an Extremely Simple Oblivious RAM Protocol. In CCS.  Emil Stefanov Marten van Dijk Elaine Shi Christopher Fletcher Ling Ren Xiangyao Yu and Srinivas Devadas. 2013. Path ORAM \u2013 an Extremely Simple Oblivious RAM Protocol. In CCS.","DOI":"10.1145\/2508859.2516660"},{"key":"e_1_2_2_70_1","unstructured":"G. Edward Suh Dwaine Clarke Blaise Gassend Marten van Dijk and Srinivas Devadas. 2003. AEGIS: architecture for tamper-evident and tamper-resistant processing. In ICS.  G. Edward Suh Dwaine Clarke Blaise Gassend Marten van Dijk and Srinivas Devadas. 2003. AEGIS: architecture for tamper-evident and tamper-resistant processing. In ICS."},{"key":"e_1_2_2_71_1","first-page":"5","article-title":"Architectural support for copy and tamper resistant software","volume":"34","author":"Chandramohan Thekkath David Lie","year":"2000","unstructured":"David Lie Chandramohan Thekkath , Mark Mitchell , Patrick Lincoln , Dan Boneh , John Mitchell , and Mark Horowitz . 2000 . Architectural support for copy and tamper resistant software . SIGOPS Oper. Syst. Rev. 34 , 5 (Nov. 2000). David Lie Chandramohan Thekkath, Mark Mitchell, Patrick Lincoln, Dan Boneh, John Mitchell, and Mark Horowitz. 2000. Architectural support for copy and tamper resistant software. SIGOPS Oper. Syst. Rev. 34, 5 (Nov. 2000).","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"e_1_2_2_72_1","volume-title":"Foreshadow: Extracting the Keys to the Intel SGX Kingdom with Transient Out-of-order Execution. In USENIX Security.","author":"Bulck Jo Van","year":"2018","unstructured":"Jo Van Bulck , Marina Minkin , Ofir Weisse , Daniel Genkin , Baris Kasikci , Frank Piessens , Mark Silberstein , Thomas F. Wenisch , Yuval Yarom , and Raoul Strackx . 2018 . Foreshadow: Extracting the Keys to the Intel SGX Kingdom with Transient Out-of-order Execution. In USENIX Security. Jo Van Bulck, Marina Minkin, Ofir Weisse, Daniel Genkin, Baris Kasikci, Frank Piessens, Mark Silberstein, Thomas F. Wenisch, Yuval Yarom, and Raoul Strackx. 2018. Foreshadow: Extracting the Keys to the Intel SGX Kingdom with Transient Out-of-order Execution. In USENIX Security."},{"key":"e_1_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.5555\/353629.353648"},{"key":"e_1_2_2_74_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Hubert Chan and Elaine Shi. 2015. Circuit ORAM: On tightness of the Goldreich-Ostrovsky lower bound. In CCS.  Xiao Wang Hubert Chan and Elaine Shi. 2015. Circuit ORAM: On tightness of the Goldreich-Ostrovsky lower bound. In CCS.","DOI":"10.1145\/2810103.2813634"},{"key":"e_1_2_2_75_1","unstructured":"Xiao Shaun Wang Kartik Nayak Chang Liu T-H. Hubert Chan Elaine Shi Emil Stefanov and Yan Huang. 2014. Oblivious Data Structures. In CCS.  Xiao Shaun Wang Kartik Nayak Chang Liu T-H. Hubert Chan Elaine Shi Emil Stefanov and Yan Huang. 2014. Oblivious Data Structures. In CCS."},{"key":"e_1_2_2_76_1","unstructured":"Andrew Chi-Chih Yao. 1986. How to generate and exchange secrets. In FOCS.  Andrew Chi-Chih Yao. 1986. How to generate and exchange secrets. In FOCS."},{"volume-title":"S &amp","author":"Zahur Samee","key":"e_1_2_2_77_1","unstructured":"Samee Zahur and David Evans . 2013. Circuit Structures for Improving Efficiency of Security and Privacy Tools . In S &amp ; P. Samee Zahur and David Evans. 2013. Circuit Structures for Improving Efficiency of Security and Privacy Tools. In S &amp; P."},{"key":"e_1_2_2_78_1","volume-title":"Myers","author":"Zhang Danfeng","year":"2011","unstructured":"Danfeng Zhang , Aslan Askarov , and Andrew C . Myers . 2011 . Predictive Mitigation of Timing Channels in Interactive Systems. In CCS. Danfeng Zhang, Aslan Askarov, and Andrew C. Myers. 2011. Predictive Mitigation of Timing Channels in Interactive Systems. In CCS."},{"key":"e_1_2_2_79_1","volume-title":"Myers","author":"Zhang Danfeng","year":"2012","unstructured":"Danfeng Zhang , Aslan Askarov , and Andrew C . Myers . 2012 . Language-based Control and Mitigation of Timing Channels. In PLDI. Danfeng Zhang, Aslan Askarov, and Andrew C. Myers. 2012. Language-based Control and Mitigation of Timing Channels. In PLDI."},{"key":"e_1_2_2_80_1","doi-asserted-by":"crossref","unstructured":"Danfeng Zhang and Daniel Kifer. 2017. LightDP: Towards Automating Differential Privacy Proofs. In POPL.  Danfeng Zhang and Daniel Kifer. 2017. LightDP: Towards Automating Differential Privacy Proofs. In POPL.","DOI":"10.1145\/3009837.3009884"},{"key":"e_1_2_2_81_1","volume-title":"Myers","author":"Zhang Danfeng","year":"2015","unstructured":"Danfeng Zhang , Yao Wang , G. Edward Suh , and Andrew C . Myers . 2015 . A Hardware Design Language for Timing-Sensitive Information-Flow Security. In ASPLOS. Danfeng Zhang, Yao Wang, G. Edward Suh, and Andrew C. Myers. 2015. A Hardware Design Language for Timing-Sensitive Information-Flow Security. In ASPLOS."},{"key":"e_1_2_2_82_1","volume-title":"Fuzzi: A Three-level Logic for Differential Privacy. PACMPL 3, ICFP","author":"Zhang Hengchu","year":"2019","unstructured":"Hengchu Zhang , Edo Roth , Andreas Haeberlen , Benjamin C. Pierce , and Aaron Roth . 2019 a. Fuzzi: A Three-level Logic for Differential Privacy. PACMPL 3, ICFP (2019). Hengchu Zhang, Edo Roth, Andreas Haeberlen, Benjamin C. Pierce, and Aaron Roth. 2019a. Fuzzi: A Three-level Logic for Differential Privacy. PACMPL 3, ICFP (2019)."},{"key":"e_1_2_2_83_1","volume-title":"Fuzzi: A Three-Level Logic for Differential Privacy. CoRR abs\/1905.12594","author":"Zhang Hengchu","year":"2019","unstructured":"Hengchu Zhang , Edo Roth , Andreas Haeberlen , Benjamin C. Pierce , and Aaron Roth . 2019 b. Fuzzi: A Three-Level Logic for Differential Privacy. CoRR abs\/1905.12594 (2019). arXiv: 1905.12594 http:\/\/arxiv.org\/abs\/1905.12594 Hengchu Zhang, Edo Roth, Andreas Haeberlen, Benjamin C. Pierce, and Aaron Roth. 2019b. Fuzzi: A Three-Level Logic for Differential Privacy. CoRR abs\/1905.12594 (2019). arXiv: 1905.12594 http:\/\/arxiv.org\/abs\/1905.12594"},{"key":"e_1_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/1037947.1024403"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371118","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3371118","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3371118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:05:43Z","timestamp":1750273543000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,20]]},"references-count":83,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["10.1145\/3371118"],"URL":"https:\/\/doi.org\/10.1145\/3371118","relation":{},"ISSN":["2475-1421"],"issn-type":[{"type":"electronic","value":"2475-1421"}],"subject":[],"published":{"date-parts":[[2019,12,20]]},"assertion":[{"value":"2019-12-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}