{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:54:06Z","timestamp":1762505646610},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540210009"},{"type":"electronic","value":"9783540246381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24638-1_19","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:15:28Z","timestamp":1280762128000},"page":"336-354","source":"Crossref","is-referenced-by-count":52,"title":["A General Composition Theorem for Secure Reactive Systems"],"prefix":"10.1007","author":[{"given":"Michael","family":"Backes","sequence":"first","affiliation":[]},{"given":"Birgit","family":"Pfitzmann","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Waidner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1145\/203095.201069","volume":"17","author":"M. Abadi","year":"1995","unstructured":"Abadi, M., Lamport, L.: Conjoining specifications. ACM Transactions on Programming Languages and Systems\u00a017(3), 507\u2013534 (1995)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/3-540-36494-3_59","volume-title":"STACS 2003","author":"M. Backes","year":"2003","unstructured":"Backes, M., Jacobi, C.: Cryptographically sound and machine-assisted verification of security protocols. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 675\u2013686. Springer, Heidelberg (2003)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45853-0_1","volume-title":"Computer Security - ESORICS 2002","author":"M. Backes","year":"2002","unstructured":"Backes, M., Pfitzmann, B.: Computational probabilistic non-interference. In: Gollmann, D., Karjoth, G., Waidner, M. (eds.) ESORICS 2002. LNCS, vol.\u00a02502, pp. 1\u201323. Springer, Heidelberg (2002)"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B.: Intransitive non-interference for cryptographic purposes. In: Proc. 24th IEEE Symposium on Security & Privacy, pp. 140\u2013152 (2003)","DOI":"10.1109\/SECPRI.2003.1199333"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B., Steiner, M., Waidner, M.: Polynomial fairness and liveness. In: Proc. 15th IEEE Computer Security Foundations Workshop (CSFW), pp. 160\u2013174 (2002)","DOI":"10.1109\/CSFW.2002.1021814"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF00196771","volume":"4","author":"D. Beaver","year":"1991","unstructured":"Beaver, D.: Secure multiparty protocols and zero knowledge proof systems tolerating a faulty minority. Journal of Cryptology\u00a04(2), 75\u2013122 (1991)","journal-title":"Journal of Cryptology"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/3-540-48658-5_32","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of cipher block chaining. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 341\u2013358. Springer, Heidelberg (1994)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"3","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology\u00a03(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"#cr-split#-19_CR10.1","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proc. 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 136\u2013145 (2001);","DOI":"10.1109\/SFCS.2001.959888"},{"key":"#cr-split#-19_CR10.2","unstructured":"Extended version in Cryptology ePrint Archive, Report 2000\/67, http:\/\/eprint.iacr.org\/"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Datta, A., Derek, A., Mitchell, J.C., Pavlovic, D.: Secure protocol composition (extended abstract). In: Proc. 1st ACM Workshop on Formal Methods in Security Engineering (FMSE), pp. 11\u201323 (2003)","DOI":"10.1145\/1035429.1035431"},{"key":"19_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game \u2013 or \u2013 a completeness theorem for protocols with honest majority. In: Proc. 19th Annual ACM Symposium on Theory of Computing (STOC), pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-38424-3_6","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"S. Goldwasser","year":"1991","unstructured":"Goldwasser, S., Levin, L.: Fair computation of general functions in presence of immoral majority. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 77\u201393. Springer, Heidelberg (1991)"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences\u00a028, 270\u2013299 (1984)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.: Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology\u00a013(1), 31\u201360 (2000)","journal-title":"Journal of Cryptology"},{"key":"19_CR17","series-title":"International Series in Computer Science","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. International Series in Computer Science. Prentice Hall, Hemel Hempstead (1985)"},{"key":"19_CR18","unstructured":"Johnson, D.M., Javier Thayer, F.: Security and the composition of machines. In: Proc. 1st IEEE Computer Security Foundations Workshop (CSFW), pp. 72\u201389 (1988)"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Lincoln, P., Mitchell, J., Mitchell, M., Scedrov, A.: A probabilistic poly-time framework for protocol analysis. In: Proc. 5th ACM Conference on Computer and Communications Security, pp. 112\u2013121 (1998)","DOI":"10.1145\/288090.288117"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/3-540-48119-2_43","volume-title":"FM\u201999 - Formal Methods","author":"P. Lincoln","year":"1999","unstructured":"Lincoln, P., Mitchell, J., Mitchell, M., Scedrov, A.: Probabilistic polynomial-time equivalence and security analysis. In: Wing, J.M., Woodcock, J.C.P., Davies, J. (eds.) FM 1999. LNCS, vol.\u00a01708, pp. 776\u2013793. Springer, Heidelberg (1999)"},{"key":"19_CR21","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Mantel, H.: On the composition of secure systems. In: Proc. 23rd IEEE Symposium on Security & Privacy, pp. 88\u2013101 (2002)","DOI":"10.1109\/SECPRI.2002.1004364"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"McCullough, D.: Specifications for multi-level security and a hook-up property. In: Proc. 8th IEEE Symposium on Security & Privacy, pp. 161\u2013166 (1987)","DOI":"10.1109\/SP.1987.10009"},{"issue":"6","key":"19_CR24","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1109\/32.55085","volume":"16","author":"D. McCullough","year":"1990","unstructured":"McCullough, D.: A hookup theorem for multilevel security. IEEE Transactions on Software Engineering\u00a016(6), 563\u2013568 (1990)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"McLean, J.: A general theory of composition for trace sets closed under selective interleaving functions. In: Proc. 15th IEEE Symposium on Security & Privacy, pp. 79\u201393 (1994)","DOI":"10.1109\/RISP.1994.296590"},{"issue":"1","key":"19_CR26","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/32.481534","volume":"22","author":"J. McLean","year":"1996","unstructured":"McLean, J.: A general theory of composition for a class of \u201cpossibilistic\u201d security properties. IEEE Transactions on Software Engineering\u00a022(1), 53\u201367 (1996)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"S. Micali","year":"1992","unstructured":"Micali, S., Rogaway, P.: Secure computation. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 392\u2013404. Springer, Heidelberg (1992)"},{"issue":"4","key":"19_CR28","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"7","author":"J. Misra","year":"1981","unstructured":"Misra, J., Chandy, K.M.: Proofs of network of processes. IEEE Transactions on Software Engineering\u00a07(4), 417\u2013426 (1981)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"19_CR29","unstructured":"Pfitzmann, B., Waidner, M.: A general framework for formal notions of \u201csecure\u201d systems. Research Report 11\/94, University of Hildesheim (April 1994), http:\/\/www.semper.org\/sirene\/lit\/abstr94.html\/#PfWa_94"},{"key":"#cr-split#-19_CR30.1","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: Proc. 7th ACM Conference on Computer and Communications Security, pp. 245\u2013254 (2000);","DOI":"10.1145\/352600.352639"},{"key":"#cr-split#-19_CR30.2","unstructured":"Extended version (with Matthias Schunter) IBM Research Report RZ 3206 (May 2000), http:\/\/www.semper.org\/sirene\/publ\/PfSW1_00ReactSimulIBM.ps.gz"},{"key":"#cr-split#-19_CR31.1","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: Proc. 22nd IEEE Symposium on Security & Privacy, pp. 184\u2013200 (2001);","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"#cr-split#-19_CR31.2","unstructured":"Extended version in Cryptology ePrint Archive, Report 2000\/066, http:\/\/eprint.iacr.org\/"},{"issue":"3","key":"19_CR32","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1145\/129393.129396","volume":"14","author":"J. Widom","year":"1992","unstructured":"Widom, J., Gries, D., Schneider, F.B.: Trace-based network proof systems: Expressiveness and completeness. ACM Transactions on Programming Languages and Systems\u00a014(3), 396\u2013416 (1992)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proc. 23rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions. In: Proc. 23rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24638-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:29:07Z","timestamp":1559359747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24638-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210009","9783540246381"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24638-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}