{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T23:40:07Z","timestamp":1740958807593,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642197505"},{"type":"electronic","value":"9783642197512"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19751-2_2","type":"book-chapter","created":{"date-parts":[[2011,2,24]],"date-time":"2011-02-24T10:55:17Z","timestamp":1298544917000},"page":"18-33","source":"Crossref","is-referenced-by-count":3,"title":["Bounded Memory Dolev-Yao Adversaries in Collaborative Systems"],"prefix":"10.1007","author":[{"given":"Max","family":"Kanovich","sequence":"first","affiliation":[]},{"given":"Tajana","family":"Ban Kirigin","sequence":"additional","affiliation":[]},{"given":"Vivek","family":"Nigam","sequence":"additional","affiliation":[]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/3-540-44618-4_28","volume-title":"CONCUR 2000 - Concurrency Theory","author":"R.M. Amadio","year":"2000","unstructured":"Amadio, R.M., Lugiez, D.: On the reachability problem in cryptographic protocols. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 380\u2013394. Springer, Heidelberg (2000)"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/S0304-3975(02)00090-7","volume":"290","author":"R.M. Amadio","year":"2003","unstructured":"Amadio, R.M., Lugiez, D., Vanack\u00e8re, V.: On the symbolic reduction of processes with cryptographic functions. Theor. Comput. Sci.\u00a0290(1), 695\u2013740 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Barth, A., Datta, A., Mitchell, J.C., Nissenbaum, H.: Privacy and contextual integrity: Framework and applications. In: IEEE Symposium on Security and Privacy (2006)","DOI":"10.1109\/SP.2006.32"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Barth, A., Mitchell, J.C., Datta, A., Sundaram, S.: Privacy and utility in business processes. In: CSF, pp. 279\u2013294 (2007)","DOI":"10.1109\/CSF.2007.26"},{"issue":"1-2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2006.08.040","volume":"367","author":"F. Butler","year":"2006","unstructured":"Butler, F., Cervesato, I., Jaggard, A.D., Scedrov, A., Walstad, C.: Formal analysis of Kerberos 5. Theor. Comput. Sci.\u00a0367(1-2), 57\u201387 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"2-4","key":"2_CR6","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/j.ic.2007.05.005","volume":"206","author":"I. Cervesato","year":"2008","unstructured":"Cervesato, I., Jaggard, A.D., Scedrov, A., Tsay, J.-K., Walstad, C.: Breaking and fixing public-key Kerberos. Inf. Comput.\u00a0206(2-4), 402\u2013424 (2008)","journal-title":"Inf. Comput."},{"issue":"1-3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.tcs.2005.01.015","volume":"338","author":"Y. Chevalier","year":"2005","unstructured":"Chevalier, Y., K\u00fcsters, R., Rusinowitch, M., Turuani, M.: An NP decision procedure for protocol insecurity with XOR. Theor. Comput. Sci.\u00a0338(1-3), 247\u2013274 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A. Church","year":"1940","unstructured":"Church, A.: A formulation of the simple theory of types. J. Symbolic Logic\u00a05, 56\u201368 (1940)","journal-title":"J. Symbolic Logic"},{"key":"2_CR9","unstructured":"Clark, J., Jacob, J.: A survey of authentication protocol literature: Version 1.0 (1997), http:\/\/www.cs.york.ac.uk\/~jac\/papers\/drareview.ps.gz"},{"key":"2_CR10","first-page":"271","volume-title":"LICS 2003","author":"H. Comon-Lundh","year":"2003","unstructured":"Comon-Lundh, H., Shmatikov, V.: Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In: LICS 2003, p. 271. IEEE Computer Society, Los Alamitos (2003)"},{"issue":"2","key":"2_CR11","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(2), 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"247","DOI":"10.3233\/JCS-2004-12203","volume":"12","author":"N.A. Durgin","year":"2004","unstructured":"Durgin, N.A., Lincoln, P., Mitchell, J.C., Scedrov, A.: Multiset rewriting and the complexity of bounded security protocols. Journal of Computer Security\u00a012(2), 247\u2013311 (2004)","journal-title":"Journal of Computer Security"},{"key":"2_CR13","first-page":"244","volume":"52","author":"J. Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for Petri nets - a survey. Bulletin of the EATCS\u00a052, 244\u2013262 (1994)","journal-title":"Bulletin of the EATCS"},{"key":"2_CR14","first-page":"14","volume-title":"SOSP 1975","author":"M.A. Harrison","year":"1975","unstructured":"Harrison, M.A., Ruzzo, W.L., Ullman, J.D.: On protection in operating systems. In: SOSP 1975, pp. 14\u201324. ACM, New York (1975)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Kirigin, T.B., Nigam, V., Scedrov, A.: Bounded memory Dolev-Yao adversaries in collaborative systems (2010), ftp:\/\/ftp.cis.upenn.edu\/pub\/papers\/scedrov\/FAST2010-TR.pdf","DOI":"10.1007\/978-3-642-19751-2_2"},{"key":"2_CR16","unstructured":"Kanovich, M., Kirigin, T.B., Nigam, V., Scedrov, A.: Progressing collaborative systems. In: FCS-PrivMod (2010)"},{"key":"2_CR17","first-page":"218","volume-title":"CSF 2009","author":"M. Kanovich","year":"2009","unstructured":"Kanovich, M., Rowe, P., Scedrov, A.: Policy compliance in collaborative systems. In: CSF 2009, pp. 218\u2013233. IEEE Computer Society, Los Alamitos (2009)"},{"key":"2_CR18","unstructured":"Kanovich, M., Rowe, P., Scedrov, A.: Collaborative planning with confidentiality. Journal of Automated Reasoning (2010) (to appear); This is an extended version of a previous paper which appeared in CSF 2007"},{"key":"2_CR19","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-Schroeder public-key protocol using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol.\u00a01055, pp. 147\u2013166. Springer, Heidelberg (1996)"},{"key":"2_CR20","volume-title":"Communicating and Mobile Systems : The \u03c0-calculus","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile Systems: The \u03c0-calculus. Cambridge University Press, New York (1999)"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(77)90014-7","volume":"4","author":"Y.L.N.D. Jones","year":"1977","unstructured":"Jones, Y.L.N.D., Landweber, L.H.: Complexity of some problems in Petri nets. Theoretical Computer Science\u00a04, 277\u2013299 (1977)","journal-title":"Theoretical Computer Science"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Roscoe, A.W.: Proving security protocols with model checkers by data independence techniques. In: CSFW, pp. 84\u201395 (1998)","DOI":"10.1109\/CSFW.1998.683158"},{"issue":"1-3","key":"2_CR23","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0304-3975(02)00490-5","volume":"299","author":"M. Rusinowitch","year":"2003","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with a finite number of sessions and composed keys is NP-complete. Theor. Comput. Sci.\u00a0299(1-3), 451\u2013475 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR24","unstructured":"Wang, G., Qing, S.: Two new attacks against Otway-Reese protocol. In: IFIP\/SEC 2000, Information Security, pp. 137\u2013139 (2000)"}],"container-title":["Lecture Notes in Computer Science","Formal Aspects of Security and Trust"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19751-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T23:21:53Z","timestamp":1740957713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19751-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642197505","9783642197512"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19751-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}