{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:40:24Z","timestamp":1774946424831,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":54,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540327318","type":"print"},{"value":"9783540327325","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11681878_20","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T07:41:35Z","timestamp":1141112495000},"page":"380-403","source":"Crossref","is-referenced-by-count":69,"title":["Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols"],"prefix":"10.1007","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Herzog","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Blanchet, B.: Analyzing security protocols with secrecy types and logic programs. In: Conference Record of POPL 2002: The 2pth SIGPLANSIGACT Symposium on Principles of Programming Languages, January 2002, pp. 33\u201344 (2002)","DOI":"10.1145\/565816.503277"},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.: A calculus for cryptographic protocols: the SPI calculus. Information and Computation\u00a0148(1), 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-45500-0_4","volume-title":"Theoretical Aspects of Computer Software","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., J\u00fcrjens, J.: Formal eavesdropping and its computational interpretation. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 82\u201394. Springer, Heidelberg (2001)"},{"issue":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00145-001-0014-7","volume":"15","author":"M. Abadi","year":"2002","unstructured":"Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology\u00a015(2), 103\u2013127 (2002)","journal-title":"Journal of Cryptology"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/11555827_22","volume-title":"Computer Security \u2013 ESORICS 2005","author":"P. Ad\u00e3o","year":"2005","unstructured":"Ad\u00e3o, P., Bana, G., Herzog, J.C., Scedrov, A.: Soundness of formal encryption in the presence of key-cycles. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol.\u00a03679, pp. 374\u2013396. Springer, Heidelberg (2005)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A composable cryptographic library with nested operations (extended abstract). In: Proceedings of the 10th ACM conference on computer and communications security (CCS) (October 2003), Full version available at, http:\/\/eprint.iacr.org\/2003\/015\/","DOI":"10.1145\/948109.948140"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","first-page":"140","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"M. Backes","year":"2003","unstructured":"Backes, M., Pfitzmann, B.: A cryptographically sound security proof of the Needham-Schroeder-Lowe public-key protocol. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 140\u2013152. Springer, Heidelberg (2003)"},{"key":"20_CR8","unstructured":"Backes, M., Pfitzmann, B.: Relating symbolic and cryptographic secrecy. Cryptology ePrint Archive, Report 2004\/300 (November 2004), http:\/\/eprint.iacr.org\/"},{"issue":"2","key":"20_CR9","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":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-48329-2_21","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Rogaway, P.: Entity authentication and key distribution. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 232\u2013249. Springer, Heidelberg (1994), Full version of paper available at, http:\/\/www-cse.ucsd.edu\/users\/mihir\/"},{"key":"20_CR11","volume-title":"Proceedings of the 2004 IEEE Symposium on Security and Privacy (S&P)","author":"B. Blanchet","year":"2004","unstructured":"Blanchet, B.: Automatic proof of strong secrecy for security protocols. In: Proceedings of the 2004 IEEE Symposium on Security and Privacy (S&P), Oakland, CA, USA, May 2004. IEEE, Los Alamitos (2004)"},{"key":"20_CR12","unstructured":"Blanchet, B.: ProVerif automatic cryptographic protocol verifier user manual (November 2004), Available at, http:\/\/www.di.ens.fr\/blanchet\/crypto-eng.html"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo random bits. In: Proceedings of the 22th Annual Syposium on Foundations of Computer Science (FOCS 1982), pp. 112\u2013117 (1982)","DOI":"10.1109\/SFCS.1982.72"},{"issue":"4","key":"20_CR14","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing\u00a013(4), 850\u2013864 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/77648.77649","volume":"8","author":"M. Burrows","year":"1990","unstructured":"Burrows, M., Abadi, M., Needham, R.: A logic of authentication. ACM Transactions in Computer Systems\u00a08(1), 18\u201336 (February 1990)","journal-title":"ACM Transactions in Computer Systems"},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"20_CR17","first-page":"136","volume-title":"42nd Annual Syposium on Foundations of Computer Science (FOCS 2001)","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universal composable security: A new paradigm for cryptographic protocols. In: 42nd Annual Syposium on Foundations of Computer Science (FOCS 2001), October 2001, pp. 136\u2013145. IEEE Computer Society, Los Alamitos (2001)"},{"key":"20_CR18","first-page":"219","volume-title":"Proceedings of the 17th IEEE Computer Security Foundations Workshop (CSFW 16)","author":"R. Canetti","year":"2004","unstructured":"Canetti, R.: Universally composable signature, certification, and authentication. In: Proceedings of the 17th IEEE Computer Security Foundations Workshop (CSFW 16), June 2004, pp. 219\u2013233. IEEE Computer Society, Los Alamitos (2004)"},{"key":"20_CR19","unstructured":"Canetti, R., Herzog, J.: Universally composable symbolic analysis of cryptographic protocols (the case of encryption-based mutual authentication and key exchange). Cryptology ePrint Archive, Report 2004\/334 (2004)"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-44987-6_28","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Krawczyk, H.: Analysis of key-exchange protocols and their use for building secure channels. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 453\u2013474. Springer, Heidelberg (2001)"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-45146-4_16","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R. Canetti","year":"2003","unstructured":"Canetti, R., Rabin, T.: Universal composition with joint state. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 265\u2013281. Springer, Heidelberg (2003)"},{"key":"20_CR22","volume-title":"Proceedings of the 12th IEEE Computer Security Foundations Workshop (CSFW 12)","author":"I. Cervesato","year":"1999","unstructured":"Cervesato, I., Durgin, N.A., Lincoln, P.D., Mitchell, J.C., Scedrov, A.: A metanotion for protocol analysis. In: Proceedings of the 12th IEEE Computer Security Foundations Workshop (CSFW 12), June 1999. IEEE Computer Society, Los Alamitos (1999)"},{"issue":"2","key":"20_CR23","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. SIAM Journal of Computing\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM Journal of Computing"},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public-key protocols. IEEE Transactions on Information Theory\u00a029, 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"20_CR25","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(2), 270\u2013299 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR26","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)"},{"issue":"1","key":"20_CR27","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"20_CR28","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital-signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing\u00a017(2), 281\u2013308 (April 1988)","journal-title":"SIAM J. Computing"},{"key":"20_CR29","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2005.03.003","volume":"340","author":"J. Herzog","year":"2005","unstructured":"Herzog, J.: A computational interpretation of dolev-yao adversaries. Theoretical Computer Science\u00a0340, 57\u201381 (June 2005)","journal-title":"Theoretical Computer Science"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/978-3-540-45146-4_32","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Herzog","year":"2003","unstructured":"Herzog, J., Liskov, M., Micali, S.: Plaintext awareness via key registration. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 548\u2013564. Springer, Heidelberg (2003)"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-540-45146-4_31","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"O. Horvitz","year":"2003","unstructured":"Horvitz, O., Gligor, V.: Weak key authenticity and the computational completeness of formal encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 530\u2013547. Springer, Heidelberg (2003)"},{"key":"20_CR32","volume-title":"Proceedings of the 2004 IEEE Symposium on Security and Privacy (S&P)","author":"P. Laud","year":"2004","unstructured":"Laud, P.: Symmetric encryption in automatic analyses for confidentiality against active adversaries. In: Proceedings of the 2004 IEEE Symposium on Security and Privacy (S&P), Oakland, CA, USA, May 2004. IEEE, Los Alamitos (2004)"},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Lincoln, P.D., Mitchell, J.C., Mitchell, M., Scedrov, A.: A probabilistic polytime framework for protocol analysis. In: Proceedings of the 5th ACM Conference on Computer and Communication Security (CCS 1998), November 1998, pp. 112\u2013121 (1998)","DOI":"10.1145\/288090.288117"},{"key":"20_CR34","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.D. Lincoln","year":"1999","unstructured":"Lincoln, P.D., Mitchell, J.C., Mitchell, M., Scedrov, A.: Probabilistic polynomial-time equivalence and security protocols. In: Wing, J.M., Woodcock, J.C.P., Davies, J. (eds.) FM 1999. LNCS, vol.\u00a01708, pp. 776\u2013793. Springer, Heidelberg (1999)"},{"key":"20_CR35","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(95)00144-2","volume":"56","author":"G. Lowe","year":"1995","unstructured":"Lowe, G.: An attack on the Needham\u2013Schroeder public-key authentication protocol. Information Processing Letters\u00a056, 131\u2013133 (1995)","journal-title":"Information Processing Letters"},{"key":"20_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-61042-1_43","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Lowe","year":"1996","unstructured":"Lowe, G.: Breaking and fixing the Needham\u2013Schroeder public-key protocol using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol.\u00a01055, pp. 147\u2013166. Springer, Heidelberg (1996)"},{"key":"20_CR37","volume-title":"Proceedings of the 12th IEEE Computer Security Foundations Workshop (CSFW 12)","author":"N. Lynch","year":"1999","unstructured":"Lynch, N.: I\/O automaton models and proofs for shared-key communication systems. In: Proceedings of the 12th IEEE Computer Security Foundations Workshop (CSFW 12). IEEE Computer Society, Los Alamitos (June 1999)"},{"key":"20_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-46017-9_14","volume-title":"Model Checking Software","author":"P. Maggi","year":"2002","unstructured":"Maggi, P., Sisto, R.: Using SPIN to verify security protocols. In: Bo\u0161na\u010dki, D., Leue, S. (eds.) SPIN 2002. LNCS, vol.\u00a02318, pp. 187\u2013204. Springer, Heidelberg (2002)"},{"key":"20_CR39","doi-asserted-by":"crossref","unstructured":"Meadows, C.: Applying formal methods to the analysis of a key management protocol. The Journal of Computer Security 1(1) (January 1992)","DOI":"10.3233\/JCS-1992-1102"},{"issue":"2","key":"20_CR40","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0743-1066(95)00095-X","volume":"26","author":"C. Meadows","year":"1996","unstructured":"Meadows, C.: The nrl protocol analyzer: An overview. J. Log. Program.\u00a026(2), 113\u2013131 (1996)","journal-title":"J. Log. Program."},{"issue":"2","key":"20_CR41","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1137\/0217025","volume":"17","author":"S. Micali","year":"1988","unstructured":"Micali, S., Rackoff, C., Sloan, B.: The notion of security for probabilistic cryptosystems. SIAM Journal on Computing\u00a017(2), 412\u2013426 (April 1988)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR42","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 (abstract). In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 392\u2013404. Springer, Heidelberg (1992)"},{"key":"20_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-30576-7_10","volume-title":"Theory of Cryptography","author":"D. Micciancio","year":"2005","unstructured":"Micciancio, D., Panjwani, S.: Adaptive security of symbolic encryption. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 169\u2013187. Springer, Heidelberg (2005)"},{"key":"20_CR44","unstructured":"Micciancio, D., Warinschi, B.: Completeness theorems for the Abadi- Rogaway logic of encrypted expressions. In: Workshop on Issues in the Theory of Security (WITS 2002) (January 2002)"},{"issue":"1","key":"20_CR45","doi-asserted-by":"publisher","first-page":"99","DOI":"10.3233\/JCS-2004-12105","volume":"12","author":"D. Micciancio","year":"2004","unstructured":"Micciancio, D., Warinschi, B.: Completeness theorems for the Abadi- Rogaway logic of encrypted expressions. Journal of Computer Security\u00a012(1), 99\u2013129 (2004)","journal-title":"Journal of Computer Security"},{"key":"20_CR46","first-page":"141","volume-title":"Proceedings of the 1997 IEEE Symposium on Security and Privacy","author":"J.C. Mitchell","year":"1997","unstructured":"Mitchell, J.C., Mitchell, M., Stern, U.: Automated analysis of cryptographic protocols using Mur\u03d5. In: Proceedings of the 1997 IEEE Symposium on Security and Privacy, pp. 141\u2013153. IEEE Computer Society Press, Los Alamitos (1997)"},{"issue":"12","key":"20_CR47","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/359657.359659","volume":"21","author":"R. Needham","year":"1978","unstructured":"Needham, R., Schroeder, M.: Using encryption for authentication in large networks of computers. Communications of the ACM\u00a021(12), 993\u2013999 (1978)","journal-title":"Communications of the ACM"},{"key":"20_CR48","unstructured":"Patil, A.: On symbolic analysis of cryptographic protocols. Master\u2019s thesis, Massachusetts Institute of Technology (May 2005)"},{"key":"20_CR49","first-page":"245","volume-title":"Proceedings of the 7th ACM Conference on Computer and Communication Security (CCS 2000)","author":"B. Pfitzmann","year":"2000","unstructured":"Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: Proceedings of the 7th ACM Conference on Computer and Communication Security (CCS 2000), November 2000, pp. 245\u2013254. ACM Press, New York (2000)"},{"key":"20_CR50","unstructured":"Rackoff, C.: Personal communication (1995)"},{"key":"20_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"C. Rackoff","year":"1992","unstructured":"Rackoff, C., Simon, D.: Noninteractive zero-knowledge proof of knowledge and the chosen-ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 433\u2013444. Springer, Heidelberg (1992)"},{"key":"20_CR52","series-title":"Lecture Notes in Computer Science","volume-title":"Programming Languages and Systems","year":"2005","unstructured":"Sagiv, M. (ed.): ESOP 2005. LNCS, vol.\u00a03444. Springer, Heidelberg (2005)"},{"key":"20_CR53","volume-title":"Proceedings of the 12th IEEE Computer Security Foundations Workshop (CSFW 12)","author":"D. Song","year":"1999","unstructured":"Song, D.: Athena, an automatic checker for security protocol analysis. In: Proceedings of the 12th IEEE Computer Security Foundations Workshop (CSFW 12), June 1999. IEEE Computer Society, Los Alamitos (1999)"},{"issue":"2\/3","key":"20_CR54","doi-asserted-by":"publisher","first-page":"191","DOI":"10.3233\/JCS-1999-72-304","volume":"7","author":"F.J.T. F\u00e1brega","year":"1999","unstructured":"F\u00e1brega, F.J.T., Herzog, J.C., Guttman, J.D.: Strand spaces: Proving security protocols correct. Journal of Computer Security\u00a07(2\/3), 191\u2013230 (1999)","journal-title":"Journal of Computer Security"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11681878_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:46Z","timestamp":1619507806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11681878_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327318","9783540327325"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/11681878_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}