{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:02Z","timestamp":1750308182314,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2003,10,30]],"date-time":"2003-10-30T00:00:00Z","timestamp":1067472000000},"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":[[2003,10,30]]},"DOI":"10.1145\/1035429.1035436","type":"proceedings-article","created":{"date-parts":[[2005,1,30]],"date-time":"2005-01-30T17:55:16Z","timestamp":1107107716000},"page":"61-66","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Relating cryptography and formal methods"],"prefix":"10.1145","author":[{"given":"Michael","family":"Backes","sequence":"first","affiliation":[{"name":"IBM Research Division, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catherine","family":"Meadows","sequence":"additional","affiliation":[{"name":"Naval Research Laboratory, DC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John C.","family":"Mitchell","sequence":"additional","affiliation":[{"name":"Stanford University, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2003,10,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2740"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/645870.668690"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/647318.723498"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.839937"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. 14th International Conference on Concurrency Theory (CONCUR)","author":"Backes M.","year":"2003","unstructured":"M. Backes . Unifying simulatability definitions under different timing assumptions (extended abstract) . In Proc. 14th International Conference on Concurrency Theory (CONCUR) , Springer , 2003 . Extended version in Cryptology ePrint Archive, Report 2003\/114, http:\/\/eprint.iacr.org\/.]] M. Backes. Unifying simulatability definitions under different timing assumptions (extended abstract). In Proc. 14th International Conference on Concurrency Theory (CONCUR), Springer, 2003. Extended version in Cryptology ePrint Archive, Report 2003\/114, http:\/\/eprint.iacr.org\/.]]"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/646517.696328"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646649.699367"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24597-1_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/829515.830558"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/794201.795170"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39650-5_16"},{"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.1145\/225058.225084"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/647087.715825"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_16"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/794199.795111"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24597-1_11"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/788023.789058"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/788023.789056"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103474"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)90401-6"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056650"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA459060"},{"key":"e_1_3_2_1_25_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-49264-X_14","volume-title":"Advances in Cryptology: EUROCRYPT '95","author":"Gennaro R.","year":"1995","unstructured":"R. Gennaro and S. Micali . Verifiable secret sharing as secure computation . In Advances in Cryptology: EUROCRYPT '95 , volume 921 of Lecture Notes in Computer Science , pages 168 - 182 . Springer , 1995 .]] R. Gennaro and S. Micali. Verifiable secret sharing as secure computation. In Advances in Cryptology: EUROCRYPT '95, volume 921 of Lecture Notes in Computer Science, pages 168-182. Springer, 1995.]]"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/794200.795146"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2003.1212716"},{"key":"e_1_3_2_1_28_1","volume-title":"Logics for reasoning about cryptographic constructions","author":"Impagliazzo R.","year":"2003","unstructured":"R. Impagliazzo and B. Kapron . Logics for reasoning about cryptographic constructions , 2003 . See http:\/\/www.csr.uvic.ca\/~bmkapron\/bibl.html.]] R. Impagliazzo and B. Kapron. Logics for reasoning about cryptographic constructions, 2003. See http:\/\/www.csr.uvic.ca\/~bmkapron\/bibl.html.]]"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/288090.288117"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/647544.730458"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/794197.795076"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45187-7_22"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/2699855.2699857"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(95)00095-X"},{"key":"e_1_3_2_1_35_1","volume-title":"Journal of Computer Security","author":"Meadows C.","year":"2003","unstructured":"C. Meadows , P. Syverson , and I. Cervesato . Formal specification and analysis of the GDOI protocol using NPATRL and the NRL protocol analyzer . Journal of Computer Security , 2003 . to appear.]] C. Meadows, P. Syverson, and I. Cervesato. Formal specification and analysis of the GDOI protocol using NPATRL and the NRL protocol analyzer. Journal of Computer Security, 2003. to appear.]]"},{"key":"e_1_3_2_1_36_1","volume-title":"Portland","author":"Micciancio D.","year":"2002","unstructured":"D. Micciancio and B. Warinschi . Completeness theorems for the Abadi-Rogaway language of encrypted expressions. 2003. J. Cryptology, to appear. Preliminary version in Workshop on Issues in the Theory of Security (WITS'02) , Portland , Oregon , January 14-15, 2002 . See http:\/\/www-cse.ucsd.edu\/~bogdan\/research.html.]] D. Micciancio and B. Warinschi. Completeness theorems for the Abadi-Rogaway language of encrypted expressions. 2003. J. Cryptology, to appear. Preliminary version in Workshop on Issues in the Theory of Security (WITS'02), Portland, Oregon, January 14-15, 2002. See http:\/\/www-cse.ucsd.edu\/~bogdan\/research.html.]]"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(03)00211-4"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2003.1212704"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796435"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80968-X"},{"key":"e_1_3_2_1_42_1","volume-title":"IBM Research","author":"Pfitzmann B.","year":"2000","unstructured":"B. Pfitzmann , M. Schunter , and M. Waidner . Provably secure certified mail. Research Report RZ 3207 , IBM Research , 2000 .]] B. Pfitzmann, M. Schunter, and M. Waidner. Provably secure certified mail. Research Report RZ 3207, IBM Research, 2000.]]"},{"key":"e_1_3_2_1_43_1","volume-title":"IBM Research","author":"Pfitzmann B.","year":"2000","unstructured":"B. Pfitzmann , M. Schunter , and M. Waidner . Secure reactive systems. Research Report RZ 3206 , IBM Research , 2000 .]] B. Pfitzmann, M. Schunter, and M. Waidner. Secure reactive systems. Research Report RZ 3206, IBM Research, 2000.]]"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/352600.352639"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/882495.884436"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/794195.795041"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2003.1212717"}],"event":{"name":"CCS03: Tenth ACM Conference on Computer and Communications Security 2003","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Washington D.C.","acronym":"CCS03"},"container-title":["Proceedings of the 2003 ACM workshop on Formal methods in security engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1035429.1035436","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1035429.1035436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:24:29Z","timestamp":1750263869000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1035429.1035436"}},"subtitle":["a panel"],"short-title":[],"issued":{"date-parts":[[2003,10,30]]},"references-count":46,"alternative-id":["10.1145\/1035429.1035436","10.1145\/1035429"],"URL":"https:\/\/doi.org\/10.1145\/1035429.1035436","relation":{},"subject":[],"published":{"date-parts":[[2003,10,30]]},"assertion":[{"value":"2003-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}