{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T12:27:55Z","timestamp":1745584075934},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662436127"},{"type":"electronic","value":"9783662436134"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-662-43613-4_12","type":"book-chapter","created":{"date-parts":[[2014,5,20]],"date-time":"2014-05-20T03:56:40Z","timestamp":1400558200000},"page":"182-198","source":"Crossref","is-referenced-by-count":3,"title":["Uniform Protection for Multi-exposed Targets"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Vigo","sequence":"first","affiliation":[]},{"given":"Flemming","family":"Nielson","sequence":"additional","affiliation":[]},{"given":"Hanne Riis","family":"Nielson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Amoroso, E.: Fundamentals of Computer Security Technology. Prentice-Hall (1994)","DOI":"10.1016\/0142-0496(94)90187-2"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-35861-6_12","volume-title":"Formal Aspects of Component Software","author":"H.R. Nielson","year":"2013","unstructured":"Nielson, H.R., Nielson, F., Vigo, R.: A Calculus for Quality. In: P\u0103s\u0103reanu, C.S., Sala\u00fcn, G. (eds.) FACS 2012. LNCS, vol.\u00a07684, pp. 188\u2013204. Springer, Heidelberg (2013)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-04444-1_21","volume-title":"Computer Security \u2013 ESORICS 2009","author":"S. M\u00f6dersheim","year":"2009","unstructured":"M\u00f6dersheim, S., Vigan\u00f2, L.: Secure Pseudonymous Channels. In: Backes, M., Ning, P. (eds.) ESORICS 2009. LNCS, vol.\u00a05789, pp. 337\u2013354. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"12_CR4","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-2), 85\u2013128 (1998)","journal-title":"Journal of Computer Security"},{"key":"12_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/3-540-48660-7_29","volume-title":"Automated Deduction - CADE-16","author":"C. Weidenbach","year":"1999","unstructured":"Weidenbach, C.: Towards an automatic analysis of security protocols in first-order logic. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 314\u2013328. Springer, Heidelberg (1999)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-36377-7_11","volume-title":"The Essence of Computation","author":"H. Riis Nielson","year":"2002","unstructured":"Riis Nielson, H., Nielson, F.: Flow Logic: A Multi-paradigmatic Approach to Static Analysis. In: Mogensen, T.\u00c6., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol.\u00a02566, pp. 223\u2013244. Springer, Heidelberg (2002)"},{"issue":"4","key":"12_CR7","doi-asserted-by":"crossref","first-page":"363","DOI":"10.3233\/JCS-2009-0339","volume":"17","author":"B. Blanchet","year":"2009","unstructured":"Blanchet, B.: Automatic verification of correspondences for security protocols. Journal of Computer Security\u00a017(4), 363\u2013434 (2009)","journal-title":"Journal of Computer Security"},{"issue":"9","key":"12_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1995376.1995394","volume":"54","author":"L. Moura de","year":"2011","unstructured":"de Moura, L., Bj\u00f8rner, N.: Satisfiability modulo theories: introduction and applications. Communications of the ACM\u00a054(9), 69\u201377 (2011)","journal-title":"Communications of the ACM"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/11814948_18","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"R. Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A.: On SAT Modulo Theories and Optimization Problems. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 156\u2013169. Springer, Heidelberg (2006)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-12002-2_8","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Cimatti","year":"2010","unstructured":"Cimatti, A., Franz\u00e9n, A., Griggio, A., Sebastiani, R., Stenico, C.: Satisfiability Modulo the Theory of Costs: Foundations and Applications. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 99\u2013113. Springer, Heidelberg (2010)"},{"issue":"1","key":"12_CR11","doi-asserted-by":"crossref","first-page":"143","DOI":"10.3233\/JCS-2001-91-206","volume":"9","author":"C. Meadows","year":"2001","unstructured":"Meadows, C.: A cost-based framework for analysis of denial of service in networks. Journal of Computer Security\u00a09(1), 143\u2013164 (2001)","journal-title":"Journal of Computer Security"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-642-31424-7_30","volume-title":"Computer Aided Verification","author":"I. Dillig","year":"2012","unstructured":"Dillig, I., Dillig, T., McMillan, K., Aiken, A.: Minimum Satisfying Assignments for SMT. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol.\u00a07358, pp. 394\u2013409. Springer, Heidelberg (2012)"},{"key":"12_CR13","unstructured":"The MITRE Corporation: Common Weakness Enumeration. Weak Password Recovery Mechanism for Forgotten Password (ID:640), \n                    \n                      http:\/\/cwe.mitre.org"},{"key":"12_CR14","unstructured":"Open Web Application Security Project: Choosing and Using Security Questions Cheat Sheet, \n                    \n                      http:\/\/www.owasp.org"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Alvim, M.S., Chatzikokolakis, K., Palamidessi, C., Smith, G.: Measuring Information Leakage Using Generalized Gain Functions. In: 25th IEEE Computer Security Foundations Symposium (CSF 2012), pp. 265\u2013279. IEEE (2012)","DOI":"10.1109\/CSF.2012.26"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Vigo, R.: The Cyber-Physical Attacker. In: Ortmeier, F., Daniel, P. (eds.) SAFECOMP 2012 Workshops. LNCS, vol.\u00a07613, pp. 347\u2013356. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-33675-1_31"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/11496137_7","volume-title":"Applied Cryptography and Network Security","author":"V. Griffith","year":"2005","unstructured":"Griffith, V., Jakobsson, M.: Messin\u2019 with Texas Deriving Mother\u2019s Maiden Names Using Public Records. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 91\u2013103. Springer, Heidelberg (2005)"},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/S0304-3975(01)00140-2","volume":"283","author":"F. Nielson","year":"2002","unstructured":"Nielson, F., Nielson, H.R., Hansen, R.R.: Validating firewalls using flow logics. Theoretical Computer Science\u00a0283(2), 381\u2013418 (2002)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43613-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T17:31:17Z","timestamp":1558891877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43613-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662436127","9783662436134"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43613-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}