{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:39Z","timestamp":1750307919606,"version":"3.41.0"},"reference-count":78,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"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":["SIGACT News"],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:p>The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, verification, Internet, and the Web. This issue consists of:\u2022 \"Security and Composition of Cryptographic Protocols: A Tutorial (Part II)\" by Ran Canetti.The first part appeared in the previous SIGACT News, the September 2006 issue. Many thanks to Ran for his contributions to this column.<\/jats:p>","DOI":"10.1145\/1189056.1189074","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"58-84","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["ACM SIGACT news distributed computing column 24"],"prefix":"10.1145","volume":"37","author":[{"given":"Sergio","family":"Rajsbaum","sequence":"first","affiliation":[{"name":"Ciudad Universitaria, Mexico City, D.F."}]}],"member":"320","published-online":{"date-parts":[[2006,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948140"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_19"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_22"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.71"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.43"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196771"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646758.705706"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167109"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198088"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90005-0"},{"volume-title":"Security and composition of multi-party cryptographic protocols. J. Cryptology","author":"Canetti R.","key":"e_1_2_1_13_1","unstructured":"{C00} R. Canetti . Security and composition of multi-party cryptographic protocols. J. Cryptology , Vol. 13 , No. 1, winter 2000. {C00} R. Canetti. Security and composition of multi-party cryptographic protocols. J. Cryptology, Vol. 13, No. 1, winter 2000."},{"key":"e_1_2_1_14_1","volume-title":"Universally composable security: A new paradigm for cryptographic protocols. Extended abstract in 42nd FOCS","author":"Canetti R.","year":"2001","unstructured":"{C01} R. Canetti . Universally composable security: A new paradigm for cryptographic protocols. Extended abstract in 42nd FOCS , 2001 . A revised version (2005) is available at IACR Eprint Archive, eprint. iacr.org\/2000\/067\/ and at the ECCC archive, http:\/\/eccc.uni-trier.de\/eccc-reports\/2001\/TR01-016\/. {C01} R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. Extended abstract in 42nd FOCS, 2001. A revised version (2005) is available at IACR Eprint Archive, eprint. iacr.org\/2000\/067\/ and at the ECCC archive, http:\/\/eccc.uni-trier.de\/eccc-reports\/2001\/TR01-016\/."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1165555.1165570"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/WODES.2006.1678432"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_17"},{"key":"e_1_2_1_18_1","volume-title":"4th theory of Cryptology Conference (TCC)","author":"Canetti R.","year":"2007","unstructured":"{CDPW07} R. Canetti , Y. Dodis , R. Pass and S. Walfish . Universally Composable Security with Pre-Existing Setup . 4th theory of Cryptology Conference (TCC) , 2007 . {CDPW07} R. Canetti, Y. Dodis, R. Pass and S. Walfish. Universally Composable Security with Pre-Existing Setup. 4th theory of Cryptology Conference (TCC), 2007."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.238015"},{"key":"e_1_2_1_20_1","volume-title":"Universally Composable Commitments. Crypto '01","author":"Canetti R.","year":"2001","unstructured":"{CF01} R. Canetti and M. Fischlin . Universally Composable Commitments. Crypto '01 , 2001 . {CF01} R. Canetti and M. Fischlin. Universally Composable Commitments. Crypto '01, 2001."},{"key":"e_1_2_1_21_1","unstructured":"{CH04} R. Canetti and J. Herzog. Universally Composable Symbolic Analysis of Cryptographic Protocols (The case of encryption-based mutual authentication and key-exchange). Eprint archive http:\/\/eprint.iacr.org\/2004\/334. Extended Abstract at 3rd TCC 2006.  {CH04} R. Canetti and J. Herzog. Universally Composable Symbolic Analysis of Cryptographic Protocols (The case of encryption-based mutual authentication and key-exchange). Eprint archive http:\/\/eprint.iacr.org\/2004\/334. Extended Abstract at 3rd TCC 2006."},{"key":"e_1_2_1_22_1","first-page":"337","volume-title":"Universally Composable Key Exchange and Secure Channels. Eurocrypt '02","author":"Canetti R.","year":"2002","unstructured":"{CK02} R. Canetti and H. Krawczyk . Universally Composable Key Exchange and Secure Channels. Eurocrypt '02 , pages 337 -- 351 , 2002 . LNCS No. 2332. Extended version at http:\/\/eprint.iacr.org\/ 2002\/059. {CK02} R. Canetti and H. Krawczyk. Universally Composable Key Exchange and Secure Channels. Eurocrypt '02, pages 337--351, 2002. LNCS No. 2332. Extended version at http:\/\/eprint.iacr.org\/2002\/059."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/646767.704307"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39200-9_5"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509980"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_16"},{"key":"e_1_2_1_27_1","volume-title":"Manuscript","author":"Cheung L.","year":"2006","unstructured":"{CKLP06} L. Cheung , D. Kaynar , N. Lynch , O. Pereira . Compositional Security for Task-PIOAs . Manuscript , 2006 . {CKLP06} L. Cheung, D. Kaynar, N. Lynch, O. Pereira. Compositional Security for Task-PIOAs. Manuscript, 2006."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_19"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_26"},{"key":"e_1_2_1_30_1","volume-title":"Secure Computation. CRYPTO '00","author":"Dodis Y.","year":"2000","unstructured":"{DM00} Y. Dodis and S. Micali . Secure Computation. CRYPTO '00 , 2000 . {DM00} Y. Dodis and S. Micali. Secure Computation. CRYPTO '00, 2000."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795291562"},{"issue":"29","key":"e_1_2_1_32_1","article-title":"On the security of public-key protocols","volume":"2","author":"Dolev D.","year":"1983","unstructured":"{DY83} D. Dolev and A. Yao . On the security of public-key protocols . IEEE Transactions on Information Theory , 2 ( 29 ), 1983 . {DY83} D. Dolev and A. Yao. On the security of public-key protocols. IEEE Transactions on Information Theory, 2(29), 1983.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_2_1_33_1","volume-title":"Workshop on Formal Methods and Security Protocols (FMSP)","author":"Durgin N. A.","year":"1999","unstructured":"{DLMS99} N. A. Durgin , P. D. Lincoln , J. C. Mitchell and A. Scedrov . Undecidability of bounded security protocols . Workshop on Formal Methods and Security Protocols (FMSP) , 1999 .:w {DLMS99} N. A. Durgin, P. D. Lincoln, J. C. Mitchell and A. Scedrov. Undecidability of bounded security protocols. Workshop on Formal Methods and Security Protocols (FMSP), 1999.:w"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276853"},{"key":"e_1_2_1_35_1","volume-title":"On the Security of Multi-Party Ping-Pong Protocols. 24th FOCS","author":"S.","year":"1983","unstructured":"{EG82} S. Even and Oded Goldreich . On the Security of Multi-Party Ping-Pong Protocols. 24th FOCS , 1983 . {EG82} S. Even and Oded Goldreich. On the Security of Multi-Party Ping-Pong Protocols. 24th FOCS, 1983."},{"key":"e_1_2_1_36_1","volume-title":"thesis","author":"Feige U.","year":"1991","unstructured":"{F91} U. Feige . Ph. D. thesis , Weizmann Institute of Science , 1991 . {F91} U. Feige. Ph.D. thesis, Weizmann Institute of Science, 1991."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277716"},{"key":"e_1_2_1_38_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"Goldreich O.","year":"2001","unstructured":"{G01} O. Goldreich . Foundations of Cryptography . Cambridge Press , Vol 1 ( 2001 ) and Vol 2 (2004). {G01} O. Goldreich. Foundations of Cryptography. Cambridge Press, Vol 1 (2001) and Vol 2 (2004)."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791220688"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00195207"},{"key":"e_1_2_1_42_1","volume-title":"Fair Computation of General Functions in Presence of Immoral Majority. CRYPTO '90","author":"Goldwasser S.","year":"1990","unstructured":"{GL90} S. Goldwasser , and L. Levin . Fair Computation of General Functions in Presence of Immoral Majority. CRYPTO '90 , LNCS 537, 1990 . {GL90} S. Goldwasser, and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. CRYPTO '90, LNCS 537, 1990."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217017"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/259380.259412"},{"key":"e_1_2_1_46_1","series-title":"International Series in Computer Science","volume-title":"Communicating Sequential Processes","author":"Hoare C. A. R.","year":"1985","unstructured":"{H85} C. A. R. Hoare . Communicating Sequential Processes . International Series in Computer Science , Prentice Hall , 1985 . {H85} C. A. R. Hoare. Communicating Sequential Processes. International Series in Computer Science, Prentice Hall, 1985."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_6"},{"key":"e_1_2_1_48_1","unstructured":"{IPSEC} The IPSec working group of the IETF. See http:\/\/www.ietf.org\/html.charters\/ipsec-charter.html  {IPSEC} The IPSec working group of the IETF. See http:\/\/www.ietf.org\/html.charters\/ipsec-charter.html"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132532"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2006.30"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946294"},{"key":"e_1_2_1_52_1","first-page":"203","volume-title":"Lindell. Lower Bounds for Concurrent Self Composition. 1st Theory of Cryptology Conference (TCC)","author":"Y.","year":"2004","unstructured":"{L04} Y. Lindell. Lower Bounds for Concurrent Self Composition. 1st Theory of Cryptology Conference (TCC) , pp. 203 -- 222 . 2004 . {L04} Y. Lindell. Lower Bounds for Concurrent Self Composition. 1st Theory of Cryptology Conference (TCC), pp. 203--222. 2004."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509982"},{"key":"e_1_2_1_54_1","volume-title":"Manuscript","author":"Lindell Y.","year":"2004","unstructured":"{LPT04} Y. Lindell , M. Prabhakaran , Y. Tauman . Concurrent General Composition of Secure Protocols in the Timing Model . Manuscript , 2004 . {LPT04} Y. Lindell, M. Prabhakaran, Y. Tauman. Concurrent General Composition of Secure Protocols in the Timing Model. Manuscript, 2004."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/288090.288117"},{"issue":"3","key":"e_1_2_1_56_1","first-page":"219","article-title":"An introduction to input\/output automata","volume":"2","author":"Lynch N.","year":"1989","unstructured":"{LT89} N. Lynch and M. R. Tuttle . An introduction to input\/output automata . CWIQuarterly , 2 ( 3 ): 219 -- 246 , September 1989 . {LT89} N. Lynch and M. R. Tuttle. An introduction to input\/output automata. CWIQuarterly, 2(3):219--246, September 1989.","journal-title":"CWIQuarterly"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_18"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45187-7_22"},{"key":"e_1_2_1_60_1","first-page":"576","article-title":"Secure Computation. unpublished manuscript, 1992. Preliminary version in CRYPTO '91","author":"Micali S.","year":"1991","unstructured":"{MR91} S. Micali and P. Rogaway . Secure Computation. unpublished manuscript, 1992. Preliminary version in CRYPTO '91 , LNCS 576 , 1991 . {MR91} S. Micali and P. Rogaway. Secure Computation. unpublished manuscript, 1992. Preliminary version in CRYPTO '91, LNCS 576, 1991.","journal-title":"LNCS"},{"key":"e_1_2_1_61_1","volume-title":"Communication and Concurrency","author":"Milner R.","year":"1989","unstructured":"{M89} R. Milner . Communication and Concurrency . Prentice Hall , 1989 . {M89} R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"e_1_2_1_62_1","volume-title":"Communicating and Mobile Systems: the Pi-Calculus","author":"Milner R.","year":"1999","unstructured":"{M99} R. Milner . Communicating and Mobile Systems: the Pi-Calculus . Cambridge University Press , 1999 . {M99} R. Milner. Communicating and Mobile Systems: the Pi-Calculus. Cambridge University Press, 1999."},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796435"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.10.044"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007393"},{"volume-title":"Pedersen: Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. CRYPTO 1991:  129--140","author":"T.","key":"e_1_2_1_66_1","unstructured":"{P91} T. P. Pedersen: Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. CRYPTO 1991: 129--140 {P91} T. P. Pedersen: Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. CRYPTO 1991: 129--140"},{"key":"e_1_2_1_67_1","volume-title":"Universitat Hildesheim","author":"Pfitzmann B.","year":"1994","unstructured":"{PW94} B. Pfitzmann and M. Waidner . A general framework for formal notions of secure systems. Hildesheimer Informatik-Berichte 11\/94 , Universitat Hildesheim , 1994 . Available at http:\/\/www.semper.org\/sirene\/lit. {PW94} B. Pfitzmann and M. Waidner. A general framework for formal notions of secure systems. Hildesheimer Informatik-Berichte 11\/94, Universitat Hildesheim, 1994. Available at http:\/\/www.semper.org\/sirene\/lit."},{"key":"e_1_2_1_68_1","volume-title":"IBM Research","author":"Pfitzmann B.","year":"2000","unstructured":"{PSW00} B. Pfitzmann , M. Schunter and M. Waidner . Secure Reactive Systems. IBM Research Report RZ 3206 (#93252) , IBM Research , Zurich , May 2000 . {PSW00} B. Pfitzmann, M. Schunter and M. Waidner. Secure Reactive Systems. IBM Research Report RZ 3206 (#93252), IBM Research, Zurich, May 2000."},{"key":"e_1_2_1_69_1","volume-title":"IBM Research","author":"Pfitzmann B.","year":"2000","unstructured":"{PSW00a} B. Pfitzmann , M. Schunter and M. Waidner . Provably Secure Certified Mail. IBM Research Report RZ 3207 (#93253) , IBM Research , Zurich , August 2000 . {PSW00a} B. Pfitzmann, M. Schunter and M. Waidner. Provably Secure Certified Mail. IBM Research Report RZ 3207 (#93253), IBM Research, Zurich, August 2000."},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/352600.352639"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.5555\/882495.884436"},{"volume-title":"43rd FOCS","author":"Prabhakaran M.","key":"e_1_2_1_72_1","unstructured":"{PRS02} M. Prabhakaran , A. Rosen , A. Sahai . Concurrent Zero Knowledge with Logarithmic Round-Complexity . 43rd FOCS , 2002: 366--375. {PRS02} M. Prabhakaran, A. Rosen, A. Sahai. Concurrent Zero Knowledge with Logarithmic Round-Complexity. 43rd FOCS, 2002: 366--375."},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007394"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_7"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73014"},{"key":"e_1_2_1_76_1","volume-title":"CRYPTO '91","author":"Rackoff C.","year":"1991","unstructured":"{RS91} C. Rackoff and D. Simon . Non-interactive zero-knowledge proof of knowledge and chosen cipher-text attack . CRYPTO '91 , 1991 . {RS91} C. Rackoff and D. Simon. Non-interactive zero-knowledge proof of knowledge and chosen cipher-text attack. CRYPTO '91, 1991."},{"key":"e_1_2_1_77_1","first-page":"415","volume-title":"Eurocrypt99, LNCS 1592","author":"Richardson R.","unstructured":"{RK99} R. Richardson and J. Kilian . On the Concurrent Composition of Zero-Knowledge Proofs . In Eurocrypt99, LNCS 1592 , pages 415 -- 413 . {RK99} R. Richardson and J. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. In Eurocrypt99, LNCS 1592, pages 415--413."},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2006.10"},{"key":"e_1_2_1_79_1","first-page":"160","volume-title":"Yao. Protocols for Secure Computation. In 23rd Annual Symp. on Foundations of Computer Science (FOCS)","author":"A.","year":"1982","unstructured":"{Y82A} A. Yao. Protocols for Secure Computation. In 23rd Annual Symp. on Foundations of Computer Science (FOCS) , pages 160 -- 164 . 1982 . {Y82A} A. Yao. Protocols for Secure Computation. In 23rd Annual Symp. on Foundations of Computer Science (FOCS), pages 160--164. 1982."},{"key":"e_1_2_1_80_1","first-page":"162","volume-title":"27th Annual Symp. on Foundations of Computer Science (FOCS)","author":"A.","year":"1986","unstructured":"{Y86} A. Yao, How to generate and exchange secrets , In 27th Annual Symp. on Foundations of Computer Science (FOCS) , pages 162 -- 167 . 1986 . {Y86} A. Yao, How to generate and exchange secrets, In 27th Annual Symp. on Foundations of Computer Science (FOCS), pages 162--167. 1986."}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1189056.1189074","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1189056.1189074","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:31Z","timestamp":1750258291000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1189056.1189074"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":78,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1145\/1189056.1189074"],"URL":"https:\/\/doi.org\/10.1145\/1189056.1189074","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2006,12]]},"assertion":[{"value":"2006-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}