{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:29:41Z","timestamp":1743060581348,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402029"},{"type":"electronic","value":"9783642402036"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40203-6_18","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T02:48:53Z","timestamp":1376448533000},"page":"309-326","source":"Crossref","is-referenced-by-count":5,"title":["Bounded Memory Protocols and Progressing 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":[{"issue":"1","key":"18_CR1","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":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/3-540-48285-7_30","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"S. Brands","year":"1994","unstructured":"Brands, S., Chaum, D.: Distance bounding protocols. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 344\u2013359. Springer, Heidelberg (1994)"},{"key":"18_CR3","unstructured":"Cervesato, I., Durgin, N.A., Lincoln, P., Mitchell, J.C., Scedrov, A.: A Meta-Notation for Protocol Analysis. In: CSFW, pp. 55\u201369 (1999)"},{"key":"18_CR4","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":"18_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"All About Maude - A High-Performance Logical Framework","author":"M. Clavel","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.: All About Maude. LNCS, vol.\u00a04350. Springer, Heidelberg (2007)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: STOC (1971)","DOI":"10.1145\/800157.805047"},{"issue":"2","key":"18_CR7","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":"18_CR8","doi-asserted-by":"crossref","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":"18_CR9","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":"18_CR10","doi-asserted-by":"crossref","unstructured":"Harrison, M.A., Ruzzo, W.L., Ullman, J.D.: On protection in operating systems. In: SOSP (1975)","DOI":"10.1145\/800213.806517"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-19751-2_2","volume-title":"Formal Aspects of Security and Trust","author":"M. Kanovich","year":"2011","unstructured":"Kanovich, M., Kirigin, T.B., Nigam, V., Scedrov, A.: Bounded memory Dolev-Yao adversaries in collaborative systems. Inf. Comput. Accepted for Publication. An extended abstract appeared in: Degano, P., Etalle, S., Guttman, J. (eds.) FAST 2010. LNCS, vol.\u00a06561, pp. 18\u201333. Springer, Heidelberg (2011)"},{"key":"18_CR12","unstructured":"Kanovich, M., Kirigin, T.B., Nigam, V., Scedrov, A.: Progressing collaborative systems. In: FCS-PrivMod (2010)"},{"key":"18_CR13","unstructured":"Kanovich, M., Kirigin, T.B., Nigam, V., Scedrov, A.: Bounded Memory Protocols and Progressing Collaborative Systems (Technical Report), \n                    \n                      http:\/\/www.nigam.info\/docs\/fcs13-tr.pdf"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Rowe, P., Scedrov, A.: Policy compliance in collaborative systems. In: CSF (2009)","DOI":"10.1109\/CSF.2009.19"},{"key":"18_CR15","unstructured":"Kanovich, M.I., Kirigin, T.B., Nigam, V., Scedrov, A., Talcott, C.L., Perovic, R.: A rewriting framework for activities subject to regulations. In: RTA (2012)"},{"issue":"3-4","key":"18_CR16","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10817-010-9190-1","volume":"46","author":"M.I. Kanovich","year":"2011","unstructured":"Kanovich, M.I., Rowe, P., Scedrov, A.: Collaborative planning with confidentiality. J. Autom. Reasoning\u00a046(3-4), 389\u2013421 (2011)","journal-title":"J. Autom. Reasoning"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Meadows, C., Poovendran, R., Pavlovic, D., Chang, L., Syverson, P.F.: Distance bounding protocols: Authentication logic analysis and collusion attacks. In: Advances in Information Security (2007)","DOI":"10.21236\/ADA459088"},{"issue":"12","key":"18_CR18","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/359657.359659","volume":"21","author":"R.M. Needham","year":"1978","unstructured":"Needham, R.M., Schroeder, M.D.: Using encryption for authentication in large networks of computers. Commun. ACM\u00a021(12), 993\u2013999 (1978)","journal-title":"Commun. ACM"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Nigam, V., Kirigin, T.B., Scedrov, A., Talcott, C.L., Kanovich, M.I., Perovic, R.: Towards an automated assistant for clinical investigations. In: IHI (2012)","DOI":"10.1145\/2110363.2110456"},{"issue":"1-3","key":"18_CR20","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."}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40203-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:44:59Z","timestamp":1559508299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40203-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402029","9783642402036"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40203-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}