{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T11:00:28Z","timestamp":1790420428823,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T00:00:00Z","timestamp":1257724800000},"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":[[2009,11,9]]},"DOI":"10.1145\/1653662.1653672","type":"proceedings-article","created":{"date-parts":[[2009,11,11]],"date-time":"2009-11-11T13:02:08Z","timestamp":1257944528000},"page":"66-78","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["CoSP"],"prefix":"10.1145","author":[{"given":"Michael","family":"Backes","sequence":"first","affiliation":[{"name":"Saarland University and MPI-SWS, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dennis","family":"Hofheinz","sequence":"additional","affiliation":[{"name":"CWI, Amsterdam, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dominique","family":"Unruh","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,11,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11690634_27"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360213"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/266420.266432"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645870.668690"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/647318.723498"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89439-1_26"},{"key":"e_1_3_2_1_8_1","volume-title":"CoSP: A general framework for computational soundness proofs. IACR ePrint 2009\/080","author":"Backes M.","year":"2009","unstructured":"M. Backes , D. Hofheinz , and D. Unruh . CoSP: A general framework for computational soundness proofs. IACR ePrint 2009\/080 , 2009 . M. Backes, D. Hofheinz, and D. Unruh. CoSP: A general framework for computational soundness proofs. IACR ePrint 2009\/080, 2009."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180450"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1009380.1009676"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2005.17"},{"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","series-title":"LNCS","first-page":"271","volume-title":"Proc. ESORICS","author":"Backes M.","year":"2003","unstructured":"M. Backes , B. Pfitzmann , and M. Waidner . Symmetric authentication within a simulatable cryptographic library . In Proc. ESORICS , volume 2808 of LNCS , pages 271 -- 290 . Springer , 2003 . M. Backes, B. Pfitzmann, and M. Waidner. Symmetric authentication within a simulatable cryptographic library. In Proc. ESORICS, volume 2808 of LNCS, pages 271--290. Springer, 2003."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-004-0062-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11863908_25"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2007.05.002"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2008.20"},{"key":"e_1_3_2_1_18_1","volume-title":"Aug.","author":"Barthe G.","year":"2007","unstructured":"G. Barthe , B. Gregoire , R. Janvier , and S. Zanella Beguelin . Formal certification of code-based cryptographic proofs. IACR ePrint , Aug. 2007 . http:\/\/eprint.iacr.org\/2007\/314. G. Barthe, B. Gregoire, R. Janvier, and S. Zanella Beguelin. Formal certification of code-based cryptographic proofs. IACR ePrint, Aug. 2007. http:\/\/eprint.iacr.org\/2007\/314."},{"key":"e_1_3_2_1_19_1","volume-title":"Int. J. Inf. Sec.","author":"Basin D.","year":"2004","unstructured":"D. Basin , S. M\u00f6dersheim , and L. Vigan\u00f2 . OFMC: A symbolic model checker for security protocols . Int. J. Inf. Sec. , 2004 . D. Basin, S. M\u00f6dersheim, and L. Vigan\u00f2. OFMC: A symbolic model checker for security protocols. Int. J. Inf. Sec., 2004."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_53"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2008.27"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/872752.873511"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2004.1301317"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2006.1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2007.06.002"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_32"},{"key":"e_1_3_2_1_27_1","series-title":"LNCS","first-page":"482","volume-title":"Proc. CRYPTO","author":"Bresson E.","year":"2007","unstructured":"E. Bresson , Y. Lakhnech , L. Mazar\u00e9 , and B. Warinschi . A generalization of DDH with applications to protocol analysis and computational soundness . In Proc. CRYPTO , volume 4622 of LNCS , pages 482 -- 499 . Springer , 2007 . E. Bresson, Y. Lakhnech, L. Mazar\u00e9, and B. Warinschi. A generalization of DDH with applications to protocol analysis and computational soundness. In Proc. CRYPTO, volume 4622 of LNCS, pages 482--499. Springer, 2007."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_20"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276721"},{"key":"e_1_3_2_1_31_1","volume-title":"About models of security protocols. Unpublished. Abstract in {32}","author":"Comon-Lundh H.","year":"2008","unstructured":"H. Comon-Lundh . About models of security protocols. Unpublished. Abstract in {32} , 2008 . H. Comon-Lundh. About models of security protocols. Unpublished. Abstract in {32}, 2008."},{"key":"e_1_3_2_1_32_1","volume-title":"Proc. FSTTCS","author":"Comon-Lundh H.","year":"2008","unstructured":"H. Comon-Lundh . About models of security protocols (abstract). In R. Hariharan, M. Mukund, and V. Vinay, editors , Proc. FSTTCS , Dagstuhl, Germany , 2008 . Schloss Dagstuhl. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2008\/1766\/. H. Comon-Lundh. About models of security protocols (abstract). In R. Hariharan, M. Mukund, and V. Vinay, editors, Proc. FSTTCS, Dagstuhl, Germany, 2008. Schloss Dagstuhl. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2008\/1766\/."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455786"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_22"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/11944836_18"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31987-0_12"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_2"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056650"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.42"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.11.011"},{"key":"e_1_3_2_1_41_1","series-title":"LNCS","first-page":"548","volume-title":"Proc. CRYPTO","author":"Herzog J.","year":"2003","unstructured":"J. Herzog , M. Liskov , and S. Micali . Plaintext awareness via key registration . In Proc. CRYPTO , volume 2729 of LNCS , pages 548 -- 564 . Springer , 2003 . J. Herzog, M. Liskov, and S. Micali. Plaintext awareness via key registration. In Proc. CRYPTO, volume 2729 of LNCS, pages 548--564. Springer, 2003."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946297"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31987-0_13"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.01.066"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00197942"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/2393847.2393901"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/645395.651928"},{"key":"e_1_3_2_1_48_1","first-page":"71","volume-title":"Proc. IEEE S&P","author":"Laud P.","year":"2004","unstructured":"P. Laud . Symmetric encryption in automatic analyses for confidentiality against active adversaries . In Proc. IEEE S&P , pages 71 -- 85 , 2004 . P. Laud. Symmetric encryption in automatic analyses for confidentiality against active adversaries. In Proc. IEEE S&P, pages 71--85, 2004."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102120.1102126"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/288090.288117"},{"key":"e_1_3_2_1_51_1","series-title":"LNCS","first-page":"147","volume-title":"Proc. TACAS","author":"Lowe G.","year":"1996","unstructured":"G. Lowe . Breaking and fixing the Needham-Schroeder public-key protocol using FDR . In Proc. TACAS , volume 1055 of LNCS , pages 147 -- 166 . Springer , 1996 . G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Proc. TACAS, volume 1055 of LNCS, pages 147--166. Springer, 1996."},{"key":"e_1_3_2_1_52_1","unstructured":"M. Merritt. Cryptographic Protocols. PhD thesis Georgia Institute of Technology 1983.   M. Merritt. Cryptographic Protocols. PhD thesis Georgia Institute of Technology 1983."},{"key":"e_1_3_2_1_53_1","series-title":"LNCS","first-page":"133","volume-title":"Proc. TCC","author":"Micciancio D.","year":"2004","unstructured":"D. Micciancio and B. Warinschi . Soundness of formal encryption in the presence of active adversaries . In Proc. TCC , volume 2951 of LNCS , pages 133 -- 151 . Springer , 2004 . D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. TCC, volume 2951 of LNCS, pages 133--151. Springer, 2004."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796435"},{"key":"e_1_3_2_1_55_1","volume-title":"A framework for game-based security proofs. IACR ePrint 2007\/199","author":"Nowak D.","year":"2007","unstructured":"D. Nowak . A framework for game-based security proofs. IACR ePrint 2007\/199 , 2007 . D. Nowak. A framework for game-based security proofs. IACR ePrint 2007\/199, 2007."},{"issue":"1","key":"e_1_3_2_1_56_1","first-page":"85","article-title":"The inductive approach to verifying cryptographic protocols","volume":"6","author":"Paulson L.","year":"1998","unstructured":"L. Paulson . The inductive approach to verifying cryptographic protocols . J. Cryptology , 6 ( 1 ): 85 -- 128 , 1998 . L. Paulson. The inductive approach to verifying cryptographic protocols. J. Cryptology, 6(1):85--128, 1998.","journal-title":"J. Cryptology"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.5555\/525080.884250"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2006.10"}],"event":{"name":"CCS '09: 16th ACM Conference on Computer and Communications Security 2009","location":"Chicago Illinois USA","acronym":"CCS '09","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 16th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1653662.1653672","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1653662.1653672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:52Z","timestamp":1750253932000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1653662.1653672"}},"subtitle":["a general framework for computational soundness proofs"],"short-title":[],"issued":{"date-parts":[[2009,11,9]]},"references-count":58,"alternative-id":["10.1145\/1653662.1653672","10.1145\/1653662"],"URL":"https:\/\/doi.org\/10.1145\/1653662.1653672","relation":{},"subject":[],"published":{"date-parts":[[2009,11,9]]},"assertion":[{"value":"2009-11-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}