{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:45Z","timestamp":1750308105698,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T00:00:00Z","timestamp":1131321600000},"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":[[2005,11,7]]},"DOI":"10.1145\/1102120.1102126","type":"proceedings-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:52:40Z","timestamp":1139241160000},"page":"26-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Secrecy types for a simulatable cryptographic library"],"prefix":"10.1145","author":[{"given":"Peeter","family":"Laud","sequence":"first","affiliation":[{"name":"Tartu University, Tartu, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324266"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00863-0"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044735"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2740"},{"first-page":"82","volume-title":"Formal Eavesdropping and Its Computational Interpretation. In proc. of TACS 2001 (LNCS 2215)","author":"Abadi M.","key":"e_1_3_2_1_5_1"},{"first-page":"3","volume-title":"proc. of International Conference IFIP TCS 2000 (LNCS 1872)","author":"Abadi M.","key":"e_1_3_2_1_6_1"},{"first-page":"89","volume-title":"proc. of ESORICS 2004 (LNCS 3193)","author":"Backes M.","key":"e_1_3_2_1_7_1"},{"first-page":"1","volume-title":"proc. of FST TCS 2003 (LNCS 2914)","author":"Backes M.","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1009380.1009676"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2005.17"},{"first-page":"271","volume-title":"proc. of ESORICS 2003 (LNCS 2808)","author":"Backes M.","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948140"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796360"},{"first-page":"26","volume-title":"proc of. CRYPTO '98 (LNCS 1462)","author":"Bellare M.","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","first-page":"86","volume-title":"Automatic Proof of Strong Secrecy for Security Protocols. In proc. of IEEE S&P","author":"Blanchet B.","year":"2004"},{"key":"e_1_3_2_1_16_1","first-page":"136","volume-title":"Universally Composable Security: A New Paradigm for Cryptographic Protocols. In proc. of FOCS","author":"Canetti R.","year":"2001"},{"first-page":"19","volume-title":"Universally Composable Commitments. In proc. of CRYPTO 2001 (LNCS 2139)","author":"Canetti R.","key":"e_1_3_2_1_17_1"},{"first-page":"337","volume-title":"Universally Composable Notions of Key Exchange and Secure Channels. In proc. of EUROCRYPT 2002 (LNCS 2332)","author":"Canetti R.","key":"e_1_3_2_1_19_1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509980"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31987-0_12"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056650"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/519078"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/959088.959090"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00333-X"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1297352.1297358"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502009"},{"first-page":"548","volume-title":"proc. of CRYPTO 2003 (LNCS 2729)","author":"Herzog J.","key":"e_1_3_2_1_29_1"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31987-0_13"},{"first-page":"159","volume-title":"Handling Encryption in Analyses for Secure Information Flow. In proc. of ESOP 2003 (LNCS 2618)","author":"Laud P.","key":"e_1_3_2_1_32_1"},{"key":"e_1_3_2_1_33_1","first-page":"71","volume-title":"proc. of IEEE S&P","author":"Laud P.","year":"2004"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/11537311_32"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/288090.288117"},{"first-page":"776","volume-title":"Probabilistic Polynomial-Time Equivalence and Security Analysis. In proc. of FM '99 (LNCS 1708)","author":"Lincoln P.","key":"e_1_3_2_1_37_1"},{"first-page":"147","volume-title":"Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR. In proc. of TACAS '96 (LNCS 1055)","author":"Lowe G.","key":"e_1_3_2_1_38_1"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.806125"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_10"},{"volume-title":"Workshop on Issues in the Theory of Security - WITS 2002","year":"2002","author":"Micciancio D.","key":"e_1_3_2_1_41_1"},{"first-page":"133","volume-title":"Soundness of Formal Encryption in the Presence of Active Adversaries. In proc. TCC 2004 (LNCS 2951)","author":"Micciancio D.","key":"e_1_3_2_1_42_1"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/359657.359659"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"B. Pfitzmann and M. Waidner. A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission. In IEEE S&P 2001 pages 184--200.]] B. Pfitzmann and M. Waidner. A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission. In IEEE S&P 2001 pages 184--200.]]","DOI":"10.1109\/SECPRI.2001.924298"},{"first-page":"433","volume-title":"proc. of CRYPTO '91 (LNCS 576)","author":"Rackoff C.","key":"e_1_3_2_1_45_1"},{"first-page":"468","volume-title":"Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols. In proc. of FOSSACS 2004 (LNCS 2987)","author":"Ramanathan A.","key":"e_1_3_2_1_46_1"},{"first-page":"80","volume-title":"proc. of FOCS '82","author":"Yao A.","key":"e_1_3_2_1_47_1"},{"first-page":"514","volume-title":"proc. of FOSSACS 2004 (LNCS 2987)","author":"Zunino R.","key":"e_1_3_2_1_48_1"}],"event":{"name":"CCS05: 12th ACM Conference on Computer and Communications Security 2005","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"],"location":"Alexandria VA USA","acronym":"CCS05"},"container-title":["Proceedings of the 12th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1102120.1102126","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1102120.1102126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:07Z","timestamp":1750262887000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1102120.1102126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,7]]},"references-count":45,"alternative-id":["10.1145\/1102120.1102126","10.1145\/1102120"],"URL":"https:\/\/doi.org\/10.1145\/1102120.1102126","relation":{},"subject":[],"published":{"date-parts":[[2005,11,7]]},"assertion":[{"value":"2005-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}