{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:42:58Z","timestamp":1774946578672,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,1,7]],"date-time":"2008-01-07T00:00:00Z","timestamp":1199664000000},"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":[[2008,1,7]]},"DOI":"10.1145\/1328438.1328478","type":"proceedings-article","created":{"date-parts":[[2008,1,7]],"date-time":"2008-01-07T09:45:40Z","timestamp":1199699140000},"page":"323-335","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Cryptographically sound implementations for typed information-flow security"],"prefix":"10.1145","author":[{"given":"C\u00e9dric","family":"Fournet","sequence":"first","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamara","family":"Rezk","sequence":"additional","affiliation":[{"name":"INRIA, Sophia-Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,1,7]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1007\/BFb0055109","volume-title":"25th International Colloquium on Automata, Languages and Programming","author":"Abadi Mart\u00edn","year":"1998","unstructured":"Mart\u00edn Abadi . Protection in programming-language translations . In 25th International Colloquium on Automata, Languages and Programming , volume 1443 of LNCS , pages 868 -- 883 . Springer-Verlag , 1998 . Mart\u00edn Abadi. Protection in programming-language translations. In 25th International Colloquium on Automata, Languages and Programming, volume 1443 of LNCS, pages 868--883. Springer-Verlag, 1998."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-001-0014-7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11924661_16"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823230_23"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948140"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11555827_20"},{"key":"e_1_3_2_1_8_1","volume-title":"December","author":"Bellare Mihir","year":"2004","unstructured":"Mihir Bellare and Phillip Rogaway . The game-playing technique , December 2004 . At http:\/\/www.cs.ucdavis.edu\/~rogaway\/papers\/games.html. Mihir Bellare and Phillip Rogaway. The game-playing technique, December 2004. At http:\/\/www.cs.ucdavis.edu\/~rogaway\/papers\/games.html."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756169.1756194"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/360051.360056"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217017"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45804-2","volume-title":"Interactive Markov Chains: The Quest for Quantified Quality","author":"Hermanns Holger","year":"2002","unstructured":"Holger Hermanns . Interactive Markov Chains: The Quest for Quantified Quality . Springer Berlin\/Heidelberg , 2002 . Holger Hermanns. Interactive Markov Chains: The Quest for Quantified Quality. Springer Berlin\/Heidelberg, 2002."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102120.1102126"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/645395.651928"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328479"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11537311_32"},{"key":"e_1_3_2_1_17_1","volume-title":"Modern Cryptography: Theory and Practice","author":"Mao Wenbo","year":"2003","unstructured":"Wenbo Mao . Modern Cryptography: Theory and Practice . Prentice Hall Professional Technical Reference , 2003 . Wenbo Mao. Modern Cryptography: Theory and Practice. Prentice Hall Professional Technical Reference, 2003."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/363516.363526"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1150577.1150580"},{"key":"e_1_3_2_1_21_1","series-title":"LNCS","first-page":"433","volume-title":"CRYPTO'91","author":"Rackoff Charles","year":"1991","unstructured":"Charles Rackoff and Daniel R. Simon . Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack . In CRYPTO'91 , volume 576 of LNCS , pages 433 -- 444 . Springer-Verlag , 1991 . Charles Rackoff and Daniel R. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In CRYPTO'91, volume 576 of LNCS, pages 433--444. Springer-Verlag, 1991."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.806121"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180337.1180341"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2007.5"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/872752.873524"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/566340.566343"},{"key":"e_1_3_2_1_27_1","volume-title":"15th IEEE Symposium on Security and Privacy","author":"Zheng Lantian","year":"2003","unstructured":"Lantian Zheng , Steve Chong , Andrew Myers , and Steve Zdancewic . Using replication and partitioning to build secure distributed systems . In 15th IEEE Symposium on Security and Privacy , 2003 . Lantian Zheng, Steve Chong, Andrew Myers, and Steve Zdancewic. Using replication and partitioning to build secure distributed systems. In 15th IEEE Symposium on Security and Privacy, 2003."}],"event":{"name":"POPL08: The 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"San Francisco California USA","acronym":"POPL08","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1328438.1328478","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1328438.1328478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:56:07Z","timestamp":1750240567000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1328438.1328478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,7]]},"references-count":26,"alternative-id":["10.1145\/1328438.1328478","10.1145\/1328438"],"URL":"https:\/\/doi.org\/10.1145\/1328438.1328478","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1328897.1328478","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008,1,7]]},"assertion":[{"value":"2008-01-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}