{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T02:17:53Z","timestamp":1772158673889,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T00:00:00Z","timestamp":1559952000000},"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":[[2019,6,8]]},"DOI":"10.1145\/3314221.3314607","type":"proceedings-article","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T21:02:18Z","timestamp":1559941338000},"page":"640-654","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["ILC: a calculus for composable, computational cryptography"],"prefix":"10.1145","author":[{"given":"Kevin","family":"Liao","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew A.","family":"Hammer","sequence":"additional","affiliation":[{"name":"DFINITY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Miller","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/373243.360213"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2740"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2007.05.002"},{"key":"e_1_3_2_2_4_1","volume-title":"Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT).","author":"Barthe G.","unstructured":"G. Barthe , B. Gr\u00e9goire , S. Heraud , and S. B\u00e9guelin . 2011. Computeraided security proofs for the working cryptographer . In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). G. Barthe, B. Gr\u00e9goire, S. Heraud, and S. B\u00e9guelin. 2011. Computeraided security proofs for the working cryptographer. In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT)."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594834.1480894"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1754621.1754630"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Bruno Blanchet. 2007. CryptoVerif: Computationally sound mechanized prover for cryptographic protocols. In Dagstuhl seminar \u201cFormal Protocol Verification Applied. 117.  Bruno Blanchet. 2007. CryptoVerif: Computationally sound mechanized prover for cryptographic protocols. In Dagstuhl seminar \u201cFormal Protocol Verification Applied. 117.","DOI":"10.1109\/SP.2006.1"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28641-4_2"},{"key":"e_1_3_2_2_9_1","volume-title":"Proverif: Cryptographic protocol verifier in the formal model. URL http:\/\/prosecco. gforge. inria. fr\/personal\/bblanche\/proverif","author":"Blanchet Bruno","year":"2010","unstructured":"Bruno Blanchet , V Cheval , X Allamigeon , and B Smyth . 2010 . Proverif: Cryptographic protocol verifier in the formal model. URL http:\/\/prosecco. gforge. inria. fr\/personal\/bblanche\/proverif (2010). Bruno Blanchet, V Cheval, X Allamigeon, and B Smyth. 2010. Proverif: Cryptographic protocol verifier in the formal model. URL http:\/\/prosecco. gforge. inria. fr\/personal\/bblanche\/proverif (2010)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-140523"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2743018"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53890-6_27"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10626-007-0032-1"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_1"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/646766.704151"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_16"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243856"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03829-7_1"},{"key":"e_1_3_2_2_21_1","unstructured":"Simon Fowler Sam Lindley J Garrett Morris and S\u00e1ra Decova. 2018. Session Types without Tiers. (2018).  Simon Fowler Sam Lindley J Garrett Morris and S\u00e1ra Decova. 2018. Session Types without Tiers. (2018)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-013-9160-y"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-012-9127-4"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_7"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/330249.330251"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.55"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2006.30"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102120.1102126"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1950654.1950674"},{"key":"e_1_3_2_2_31_1","volume-title":"ILC: A Calculus for Composable, Computational Cryptography (Extended Version). https:\/\/eprint.iacr.org\/2019\/402 .","author":"Liao Kevin","year":"2019","unstructured":"Kevin Liao , Matthew A. Hammer , and Andrew Miller . 2019 . ILC: A Calculus for Composable, Computational Cryptography (Extended Version). https:\/\/eprint.iacr.org\/2019\/402 . (2019). Kevin Liao, Matthew A. Hammer, and Andrew Miller. 2019. ILC: A Calculus for Composable, Computational Cryptography (Extended Version). https:\/\/eprint.iacr.org\/2019\/402 . (2019)."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/288090.288117"},{"key":"e_1_3_2_2_33_1","volume-title":"Tutorials on the Foundations of Cryptography","author":"Lindell Yehuda","unstructured":"Yehuda Lindell . 2017. How to simulate it\u2013a tutorial on the simulation proof technique . In Tutorials on the Foundations of Cryptography . Springer , 277\u2013346. Yehuda Lindell. 2017. How to simulate it\u2013a tutorial on the simulation proof technique. In Tutorials on the Foundations of Cryptography. Springer, 277\u2013346."},{"key":"e_1_3_2_2_34_1","volume-title":"Introduction to modern cryptography","author":"Lindell Yehuda","unstructured":"Yehuda Lindell and Jonathan Katz . 2014. Introduction to modern cryptography . Chapman and Hall\/CRC. Yehuda Lindell and Jonathan Katz. 2014. Introduction to modern cryptography. Chapman and Hall\/CRC."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45187-7_22"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27375-9_3"},{"key":"e_1_3_2_2_37_1","unstructured":"Ueli Maurer and Renato Renner. 2011. Abstract cryptography. In In Innovations in Computer Science. Citeseer.  Ueli Maurer and Renato Renner. 2011. Abstract cryptography. In In Innovations in Computer Science. Citeseer."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(95)00095-X"},{"key":"e_1_3_2_2_39_1","volume-title":"Sprites: Payment channels that go faster than lightning. CoRR abs\/1702.05812","author":"Miller Andrew","year":"2017","unstructured":"Andrew Miller , Iddo Bentov , Ranjit Kumaresan , and Patrick McCorry . 2017 . Sprites: Payment channels that go faster than lightning. CoRR abs\/1702.05812 (2017). Andrew Miller, Iddo Bentov, Ranjit Kumaresan, and Patrick McCorry. 2017. Sprites: Payment channels that go faster than lightning. CoRR abs\/1702.05812 (2017)."},{"key":"e_1_3_2_2_40_1","volume-title":"Communicating and mobile systems: the pi calculus","author":"Milner Robin","unstructured":"Robin Milner . 1999. Communicating and mobile systems: the pi calculus . Cambridge university press . Robin Milner. 1999. Communicating and mobile systems: the pi calculus. Cambridge university press."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/882495.884436"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837655"}],"event":{"name":"PLDI '19: 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Phoenix AZ USA","acronym":"PLDI '19","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3314221.3314607","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3314221.3314607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:22Z","timestamp":1750204402000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3314221.3314607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,8]]},"references-count":42,"alternative-id":["10.1145\/3314221.3314607","10.1145\/3314221"],"URL":"https:\/\/doi.org\/10.1145\/3314221.3314607","relation":{},"subject":[],"published":{"date-parts":[[2019,6,8]]},"assertion":[{"value":"2019-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}