{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:58Z","timestamp":1750307098994,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,16]],"date-time":"2012-10-16T00:00:00Z","timestamp":1350345600000},"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":[[2012,10,16]]},"DOI":"10.1145\/2382196.2382270","type":"proceedings-article","created":{"date-parts":[[2012,10,15]],"date-time":"2012-10-15T17:13:12Z","timestamp":1350321192000},"page":"699-711","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Computational soundness without protocol restrictions"],"prefix":"10.1145","author":[{"given":"Michael","family":"Backes","sequence":"first","affiliation":[{"name":"Saarland University and MPI-SWS, Saarbruecken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankit","family":"Malik","sequence":"additional","affiliation":[{"name":"IIT Delhi, Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Unruh","sequence":"additional","affiliation":[{"name":"Tartu University, Tartu, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,10,16]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/266420.266432"},{"key":"e_1_3_2_1_2_1","first-page":"3","volume-title":"Proc. 1st IFIP International Conference on Theoretical Computer Science","volume":"1872","author":"Abadi M.","year":"2000","unstructured":"M. Abadi and P. Rogaway . Reconciling two views of cryptography: The computational soundness of formal encryption . In Proc. 1st IFIP International Conference on Theoretical Computer Science , volume 1872 of LNCS, pages 3 -- 22 . Springer , 2000 . M. Abadi and P. Rogaway. Reconciling two views of cryptography: The computational soundness of formal encryption. In Proc. 1st IFIP International Conference on Theoretical Computer Science, volume 1872 of LNCS, pages 3--22. Springer, 2000."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.5555\/1662658.1662665"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/1653662.1653672"},{"key":"e_1_3_2_1_5_1","volume-title":"CoSP: A general framework for computational soundness proofs. IACR Cryptology ePrint Archive 2009\/080","author":"Backes M.","year":"2009","unstructured":"M. Backes , D. Hofheinz , and D. Unruh . CoSP: A general framework for computational soundness proofs. IACR Cryptology ePrint Archive 2009\/080 , 2009 . Version from 2009-02-18. M. Backes, D. Hofheinz, and D. Unruh. CoSP: A general framework for computational soundness proofs. IACR Cryptology ePrint Archive 2009\/080, 2009. Version from 2009-02-18."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/1866307.1866351"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/2382196.2382270"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.5555\/1009380.1009676"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.5555\/1454415.1454417"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/948109.948140"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.5555\/1891823.1891829"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1007\/978-3-642-28641-4_11"},{"key":"e_1_3_2_1_13_1","volume-title":"International Journal of Information Security","author":"Basin D.","year":"2004","unstructured":"D. Basin , S. Modersheim , and L. Vigano . OFMC: A symbolic model checker for security protocols . International Journal of Information Security , 2004 . D. Basin, S. Modersheim, and L. Vigano. OFMC: A symbolic model checker for security protocols. International Journal of Information Security, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1007\/978-3-642-01001-9_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/168588.168596"},{"key":"e_1_3_2_1_16_1","series-title":"LNCS","first-page":"92","volume-title":"Advances in Cryptology: EUROCRYPT '94","author":"Bellare M.","year":"1994","unstructured":"M. Bellare and P. Rogaway . Optimal asymmetric encryption . In Advances in Cryptology: EUROCRYPT '94 , volume 950 of LNCS , pages 92 -- 111 . Springer , 1994 . M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Advances in Cryptology: EUROCRYPT '94, volume 950 of LNCS, pages 92--111. Springer, 1994."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1007\/978-3-642-30057-8_31"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.5555\/3088723.3088758"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1007\/11681878_20"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1007\/978-3-642-28641-4_9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1007\/s10817-010-9187-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1007\/978-3-540-31987-0_12"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1109\/TIT.1983.1056650"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1109\/SFCS.1983.42"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1007\/BF00197942"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.5555\/645395.651928"},{"key":"e_1_3_2_1_27_1","first-page":"71","volume-title":"Proc. 25th IEEE Symposium on Security & Privacy","author":"Laud P.","year":"2004","unstructured":"P. Laud . Symmetric encryption in automatic analyses for confidentiality against active adversaries . In Proc. 25th IEEE Symposium on Security & Privacy , pages 71 -- 85 , 2004 . P. Laud. Symmetric encryption in automatic analyses for confidentiality against active adversaries. In Proc. 25th IEEE Symposium on Security & Privacy, pages 71--85, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.5555\/646480.693776"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1007\/978-3-642-03459-6_13"},{"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_30_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1007\/978-3-540-24638-1_8"},{"key":"e_1_3_2_1_32_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-45708-9_8","volume-title":"Advances in Cryptology, Proceedings of CRYPTO '02","author":"Nielsen J. B.","year":"2002","unstructured":"J. B. Nielsen . Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case . In M. Yung, editor, Advances in Cryptology, Proceedings of CRYPTO '02 , volume 2442 of Lecture Notes in Computer Science , pages 111 -- 126 . Springer-Verlag , 2002 . J. B. Nielsen. Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case. In M. Yung, editor, Advances in Cryptology, Proceedings of CRYPTO '02, volume 2442 of Lecture Notes in Computer Science, pages 111--126. Springer-Verlag, 2002."},{"issue":"1","key":"e_1_3_2_1_33_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 . Journal of Cryptology , 6 ( 1 ): 85 -- 128 , 1998 . L. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Cryptology, 6(1):85--128, 1998.","journal-title":"Journal of Cryptology"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.5555\/1947337.1947362"},{"key":"e_1_3_2_1_35_1","volume-title":"Programmable encryption and key-dependent messages. IACR ePrint archive 2012\/423","author":"Unruh D.","year":"2012","unstructured":"D. Unruh . Programmable encryption and key-dependent messages. IACR ePrint archive 2012\/423 , 2012 . D. Unruh. Programmable encryption and key-dependent messages. IACR ePrint archive 2012\/423, 2012."}],"event":{"sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"acronym":"CCS'12","name":"CCS'12: the ACM Conference on Computer and Communications Security","location":"Raleigh North Carolina USA"},"container-title":["Proceedings of the 2012 ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2382196.2382270","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2382196.2382270","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:48Z","timestamp":1750239288000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2382196.2382270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,16]]},"references-count":35,"alternative-id":["10.1145\/2382196.2382270","10.1145\/2382196"],"URL":"https:\/\/doi.org\/10.1145\/2382196.2382270","relation":{},"subject":[],"published":{"date-parts":[[2012,10,16]]},"assertion":[{"value":"2012-10-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}