{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:39:05Z","timestamp":1725557945228},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407973"},{"type":"electronic","value":"9783540452157"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45215-7_4","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T20:27:59Z","timestamp":1277324879000},"page":"47-56","source":"Crossref","is-referenced-by-count":0,"title":["Complexity Problems in the Analysis of Information Systems Security"],"prefix":"10.1007","author":[{"given":"A.","family":"Slissenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-45694-5_33","volume-title":"CONCUR 2002 - Concurrency Theory","author":"R. Amadio","year":"2002","unstructured":"Amadio, R., Charatonik, W.: On name generation and set-based analysis in the Dolev-Yao model. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 499\u2013514. Springer, Heidelberg (2002)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 26\u201345. Springer, Heidelberg (1998)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48969-X_1","volume-title":"Lectures on Data Security","author":"M. Bellare","year":"1999","unstructured":"Bellare, M.: Practice-oriented provable security. In: Damg\u00e5rd, I.B. (ed.) EEF School 1998. LNCS, vol.\u00a01561, pp. 1\u201315. Springer, Heidelberg (1999)"},{"volume-title":"Computer Security Handbook","year":"2002","key":"4_CR4","unstructured":"Bosworth, S., Kabay, M.E. (eds.): Computer Security Handbook, vol.\u00a04. John Wiley, Chichester (2002)"},{"key":"4_CR5","unstructured":"Bauer, L., Ligatti, J., Walker, D.: More enforceable security policies. In: Cervesato, I. (ed): Foundations of Computer Security, volume 02-12 of DIKU technical reports (July 25\u201326, 95\u2013104 (2002)"},{"issue":"1\u20133","key":"4_CR6","first-page":"13","volume":"113","author":"D. Beauquier","year":"2002","unstructured":"Beauquier, D., Slissenko, A.: A first order logic for specification of timed algorithms: Basic properties and a decidable class. Annals of Pure and Applied Logic\u00a0113(1\u20133), 13\u201352 (2002)","journal-title":"Annals of Pure and Applied Logic"},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1109\/SFCS.2001.959888","volume-title":"42nd IEEE Symposium on Foundations of Computer Science: proceedings","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: IEEE (ed.) 42nd IEEE Symposium on Foundations of Computer Science: proceedings, Las Vegas, Nevada, USA, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, October 14\u201317, pp. 136\u2013145. IEEE Computer Society Press, Los Alamitos (October 2001);"},{"key":"4_CR8","unstructured":"Comon, H., Cortier, V.: Tree automata with one memory, set constraints and cryptographic protocols. Theoretical Computer Science (2003) (to appear)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1007\/3-540-48224-5_56","volume-title":"Automata, Languages and Programming","author":"H. Comon","year":"2001","unstructured":"Comon, H., Cortier, V., Mitchell, J.: Tree automata with one memory, set constraints, and ping-pong protocols. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 682\u2013693. Springer, Heidelberg (2001)"},{"key":"4_CR10","unstructured":"Comon, H., Shmatikov, V.: Is it possible to decide whether a cryptographic protocol is secure or not? (2002), Draft. 10 pages, Available at \n                    \n                      http:\/\/www.lsv.ens-cachan.fr\/"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0019-9958(82)90401-6","volume":"55","author":"D. Dolev","year":"1982","unstructured":"Dolev, D., Even, S., Karp, R.: On the security of ping-pong protocols. Information and Control\u00a055, 57\u201368 (1982)","journal-title":"Information and Control"},{"key":"4_CR12","unstructured":"Durgin, N., Lincoln, P., Mitchell, J.C., Scedrov, A.: Undecidability of bounded security protocols. In: Proc. of the Workshop on Formal Methods and Security Protocols, Trento, Italy (1999)"},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1145\/641909.641912","volume":"25","author":"C. Fournet","year":"2003","unstructured":"Fournet, C., Gordon, A.D.: Stack inspection: Theory and variants. ACM Transactions on Programming Languages and Systems\u00a025(3), 360\u2013399 (2003)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-36084-0_12","volume-title":"Recent Advances in Intrusion Detection","author":"V. Gorodetski","year":"2002","unstructured":"Gorodetski, V., Kotenko, I.: Attacks against computer network: Formal grammar-based framework and simulation tool. In: Wespi, A., Vigna, G., Deri, L. (eds.) RAID 2002. LNCS, vol.\u00a02516, pp. 219\u2013238. Springer, Heidelberg (2002)"},{"key":"4_CR15","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge, UK, Parts of volumes 2 and 3 (drafts of Chapers 5\u20137) can be found oded\/ (2001), at \n                    \n                      http:\/\/www.wisdom.weizman.ac.il\/"},{"key":"4_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-0261-8","volume-title":"An information security handbook","author":"J. Hunter","year":"2001","unstructured":"Hunter, J.: An information security handbook. Springer, Heidelberg (2001)"},{"key":"4_CR17","first-page":"245","volume-title":"Proceedings of the ACM Symposium on Theory of Computing","author":"J. Katz","year":"2000","unstructured":"Katz, J., Yung, M.: Complete characterization of security notions for probabilistic private-key encryption. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 245\u2013254. ACM Press, New York (2000)"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1145\/288090.288117","volume-title":"Proceedings of the 5th ACM Conference on Computer and Communications Security","author":"P. Lincoln","year":"1998","unstructured":"Lincoln, P., Mitchell, J., Mitchell, M., Scedrov, V.: A probabilistic poly-time framework for protocol analysis. In: Proceedings of the 5th ACM Conference on Computer and Communications Security, San Francisco, California, pp. 112\u2013121. ACM Press, New York (1998)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Necula, G.C.: Proof-carrying code. In: Proceedings of the 24th ACM Symposium on Principles of Programming Languages, Paris, France (January 1997)","DOI":"10.1145\/263699.263712"},{"issue":"1","key":"4_CR20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3233\/JCS-1998-61-205","volume":"6","author":"L.C. Paulson","year":"1998","unstructured":"Paulson, L.C.: The inductive approach to verifying cryptographic protocols. Journal of Computer Security\u00a06(1), 85\u2013128 (1998)","journal-title":"Journal of Computer Security"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/CSFW.2001.930145","volume-title":"Proc. of the 14th Computer Security Foundations Workshop (CSFW 2001)","author":"M. Rusinovich","year":"2001","unstructured":"Rusinovich, M., Turuani, M.: Protocol insecurity with finite number of sessions is NP-complete. In: Proc. of the 14th Computer Security Foundations Workshop (CSFW 2001), pp. 174\u2013190. IEEE Computer Society Press, Los Alamitos (2001)"},{"issue":"1","key":"4_CR22","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/353323.353382","volume":"3","author":"F.B. Schneider","year":"2000","unstructured":"Schneider, F.B.: Enforceable security policies. ACM Transactions on Information and System Security\u00a03(1), 30\u201350 (2000)","journal-title":"ACM Transactions on Information and System Security"},{"key":"4_CR23","volume-title":"Secrets & Lies \u2014 Digital Security in a Networked World","author":"B. Schneier","year":"2000","unstructured":"Schneier, B.: Secrets & Lies \u2014 Digital Security in a Networked World. John Wiley & Sons, Chichester (2000)"},{"key":"4_CR24","series-title":"IEEE Computer Society, Technical Committee on Security and Privacy","first-page":"273","volume-title":"Proceedings of the IEEE Symposium on Research in Security and Privacy","author":"O. Sheyner","year":"2002","unstructured":"Sheyner, O., Jha, S., Wing, J., Lippmann, R., Haines, J.: Automated generation and analysis of attack graphs. In: Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland, CA. IEEE Computer Society, Technical Committee on Security and Privacy, pp. 273\u2013284. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"4_CR25","unstructured":"Slissenko, A.: Minimizing entropy of knowledge representation. In: Proc. of the 2nd International Conf. on Computer Science and Information Technologies, Yerevan, Armenia, National Academy of Sciences of Armenia, August 17\u201322, pp. 2\u20136 (1999)"},{"key":"4_CR26","volume-title":"Introduction to Distributed Algorithms","year":"2000","unstructured":"Tel, G. (ed.): Introduction to Distributed Algorithms, 2nd edn. Cambridge University Press, Cambridge (2000)","edition":"2"},{"key":"4_CR27","first-page":"3","volume-title":"Proceedings of the Symposium on Network and Distributed Systems Security (NDSS 2000)","author":"D. Wagner","year":"2000","unstructured":"Wagner, D., Foster, J.S., Brewer, E.A., Aiken, A.: A first step towards automated detection of buffer overrun vulnerabilities. In: Proceedings of the Symposium on Network and Distributed Systems Security (NDSS 2000), San Diego, pp. 3\u201317. Internet Society, San Diego (2000)"}],"container-title":["Lecture Notes in Computer Science","Computer Network Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45215-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T21:13:56Z","timestamp":1552598036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45215-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407973","9783540452157"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45215-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}