{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T04:33:01Z","timestamp":1726029181124},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030190514"},{"type":"electronic","value":"9783030190521"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19052-1_13","type":"book-chapter","created":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:11:42Z","timestamp":1558573902000},"page":"192-213","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Multiset Rewriting Model for Specifying and Verifying Timing Aspects of Security Protocols"],"prefix":"10.1007","author":[{"given":"Musab A.","family":"Alturki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tajana","family":"Ban Kirigin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Max","family":"Kanovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vivek","family":"Nigam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carolyn","family":"Talcott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Alturki, M.A., Kanovich, M., Ban Kirigin, T., Nigam, V., Scedrov, A., Talcott, C.: Statistical model checking of distance fraud attacks on the Hancke-Kuhn family of protocols. In: Proceedings of the 2018 Workshop on Cyber-Physical Systems Security and PrivaCy, pp. 60\u201371. ACM (2018)","DOI":"10.1145\/3264888.3264895"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/2019599.2019601","volume":"14","author":"DA Basin","year":"2011","unstructured":"Basin, D.A., Capkun, S., Schaller, P., Schmidt, B.: Formal reasoning about physical properties of security protocols. ACM Trans. Inf. Syst. Secur. 14(2), 16 (2011)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BFb0055875","volume-title":"Computer Security\u2014ESORICS 1998","author":"G Bella","year":"1998","unstructured":"Bella, G., Paulson, L.C.: Kerberos version IV: inductive analysis of the secrecy goals. In: Quisquater, J.-J., Deswarte, Y., Meadows, C., Gollmann, D. (eds.) ESORICS 1998. LNCS, vol. 1485, pp. 361\u2013375. Springer, Heidelberg (1998). \n                    https:\/\/doi.org\/10.1007\/BFb0055875"},{"key":"13_CR4","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\u2014EUROCRYPT 1993","author":"S Brands","year":"1994","unstructured":"Brands, S., Chaum, D.: Distance-bounding protocols. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 344\u2013359. Springer, Heidelberg (1994). \n                    https:\/\/doi.org\/10.1007\/3-540-48285-7_30"},{"key":"13_CR5","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":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-662-46666-7_15","volume-title":"Principles of Security and Trust","author":"V Cheval","year":"2015","unstructured":"Cheval, V., Cortier, V.: Timing attacks in security protocols: symbolic framework and proof techniques. In: Focardi, R., Myers, A. (eds.) POST 2015. LNCS, vol. 9036, pp. 280\u2013299. Springer, Heidelberg (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-662-46666-7_15"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-642-14577-3_5","volume-title":"Financial Cryptography and Data Security","author":"T Chothia","year":"2010","unstructured":"Chothia, T., Smirnov, V.: A traceability attack against e-passports. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 20\u201334. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-14577-3_5"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Cremers, C., Rasmussen, K.B., Schmidt, B., Capkun, S.: Distance Hijacking attacks on distance bounding protocols. In: 2012 IEEE Symposium on Security and Privacy, pp. 113\u2013127 (2012). \n                    https:\/\/doi.org\/10.1109\/SP.2012.17","DOI":"10.1109\/SP.2012.17"},{"issue":"2","key":"13_CR9","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 Trans. Inf. Theory 29(2), 198\u2013208 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.3233\/JCS-2004-12203","volume":"12","author":"NA Durgin","year":"2004","unstructured":"Durgin, N.A., Lincoln, P., Mitchell, J.C., Scedrov, A.: Multiset rewriting and the complexity of bounded security protocols. J. Comput. Secur. 12(2), 247\u2013311 (2004)","journal-title":"J. Comput. Secur."},{"key":"13_CR11","volume-title":"A Mathematical Introduction to Logic","author":"HB Enderton","year":"1972","unstructured":"Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press, Cambridge (1972)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-03829-7_1","volume-title":"Foundations of Security Analysis and Design V","author":"S Escobar","year":"2009","unstructured":"Escobar, S., Meadows, C., Meseguer, J.: Maude-NPA: cryptographic protocol analysis modulo equational properties. In: Aldini, A., Barthe, G., Gorrieri, R. (eds.) FOSAD 2007\u20132009. LNCS, vol. 5705, pp. 1\u201350. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-03829-7_1"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/10722599_14","volume-title":"Computer Security - ESORICS 2000","author":"N Evans","year":"2000","unstructured":"Evans, N., Schneider, S.: Analysing time dependent security properties in CSP using PVS. In: Cuppens, F., Deswarte, Y., Gollmann, D., Waidner, M. (eds.) ESORICS 2000. LNCS, vol. 1895, pp. 222\u2013237. Springer, Heidelberg (2000). \n                    https:\/\/doi.org\/10.1007\/10722599_14"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-36575-3_9","volume-title":"Programming Languages and Systems","author":"R Gorrieri","year":"2003","unstructured":"Gorrieri, R., Locatelli, E., Martinelli, F.: A simple language for real-time cryptographic protocol analysis. In: Degano, P. (ed.) ESOP 2003. LNCS, vol. 2618, pp. 114\u2013128. Springer, Heidelberg (2003). \n                    https:\/\/doi.org\/10.1007\/3-540-36575-3_9\n                    \n                  . \n                    http:\/\/dl.acm.org\/citation.cfm?id=1765712.1765723"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Hancke, G.P., Kuhn, M.G.: An RFID distance bounding protocol. In: First International Conference on Security and Privacy for Emerging Areas in Communications Networks, SECURECOMM 2005, pp. 67\u201373 (2005). \n                    https:\/\/doi.org\/10.1109\/SECURECOMM.2005.56","DOI":"10.1109\/SECURECOMM.2005.56"},{"issue":"3\u20134","key":"13_CR16","first-page":"363","volume":"79","author":"G Jakubowska","year":"2007","unstructured":"Jakubowska, G., Penczek, W.: Modelling and checking timed authentication of security protocols. Fundamenta Informaticae 79(3\u20134), 363\u2013378 (2007)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.ic.2014.07.011","volume":"238","author":"M Kanovich","year":"2014","unstructured":"Kanovich, M., Ban Kirigin, T., Nigam, V., Scedrov, A.: Bounded memory Dolev-Yao adversaries in collaborative systems. Inf. Comput. 238, 233\u2013261 (2014)","journal-title":"Inf. Comput."},{"key":"13_CR18","unstructured":"Kanovich, M., Ban Kirigin, T., Nigam, V., Scedrov, A., Talcott, C.: Compliance in real time multiset rewriting models. \n                    https:\/\/arxiv.org\/abs\/1811.04826"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-662-46666-7_14","volume-title":"Principles of Security and Trust","author":"M Kanovich","year":"2015","unstructured":"Kanovich, M., Kirigin, T.B., Nigam, V., Scedrov, A., Talcott, C.: Discrete vs. dense times in the analysis of cyber-physical security protocols. In: Focardi, R., Myers, A. (eds.) POST 2015. LNCS, vol. 9036, pp. 259\u2013279. Springer, Heidelberg (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-662-46666-7_14"},{"key":"13_CR20","unstructured":"Kanovich, M., Ban Kirigin, T., Nigam, V., Scedrov, A., Talcott, C.: Can we mitigate the attacks on distance-bounding protocols by using challenge-response rounds repeatedly? In: FCS (2016)"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-44878-7_14","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"M Kanovich","year":"2016","unstructured":"Kanovich, M., Ban Kirigin, T., Nigam, V., Scedrov, A., Talcott, C.: Timed multiset rewriting and the verification of time-sensitive distributed systems. In: Fr\u00e4nzle, M., Markey, N. (eds.) FORMATS 2016. LNCS, vol. 9884, pp. 228\u2013244. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-44878-7_14"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Kanovich, M., Rowe, P., Scedrov, A.: Policy compliance in collaborative systems. In: Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium, CSF 2009, pp. 218\u2013233. IEEE Computer Society, Washington, DC (2009). \n                    https:\/\/doi.org\/10.1109\/CSF.2009.19","DOI":"10.1109\/CSF.2009.19"},{"key":"13_CR23","unstructured":"Kanovich, M.I., Ban Kirigin, T., Nigam, V., Scedrov, A., Talcott, C.L.: Towards timed models for cyber-physical security protocols (2014). Available in Nigam\u2019s homepage"},{"issue":"6","key":"13_CR24","doi-asserted-by":"publisher","first-page":"585","DOI":"10.3233\/JCS-0560","volume":"25","author":"MI Kanovich","year":"2017","unstructured":"Kanovich, M.I., Ban Kirigin, T., Nigam, V., Scedrov, A., Talcott, C.L.: Time, computational complexity, and probability in the analysis of distance-bounding protocols. J. Comput. Secur. 25(6), 585\u2013630 (2017). \n                    https:\/\/doi.org\/10.3233\/JCS-0560","journal-title":"J. Comput. Secur."},{"issue":"3","key":"13_CR25","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1017\/S096012951500016X","volume":"27","author":"MI Kanovich","year":"2017","unstructured":"Kanovich, M.I., Ban Kirigin, T., Nigam, V., Scedrov, A., Talcott, C.L., Perovic, R.: A rewriting framework and logic for activities subject to regulations. Math. Struct. Comput. Sci. 27(3), 332\u2013375 (2017). \n                    https:\/\/doi.org\/10.1017\/S096012951500016X","journal-title":"Math. Struct. Comput. Sci."},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Lowe, G.: Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In: TACAS, pp. 147\u2013166 (1996)","DOI":"10.1007\/3-540-61042-1_43"},{"issue":"2","key":"13_CR27","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. Logic Program. 26(2), 113\u2013131 (1996). \n                    https:\/\/doi.org\/10.1016\/0743-1066(95)00095-X\n                    \n                  . \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/074310669500095X","journal-title":"J. Logic Program."},{"issue":"1\u20132","key":"13_CR28","doi-asserted-by":"publisher","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. J. Comput. Secur. 9(1\u20132), 143\u2013164 (2001). \n                    http:\/\/dl.acm.org\/citation.cfm?id=374742.374757","journal-title":"J. Comput. Secur."},{"key":"13_CR29","series-title":"Advances in Information Security","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-0-387-46276-9_12","volume-title":"Secure Localization and Time Synchronization for Wireless Sensor and Ad Hoc Networks","author":"CA Meadows","year":"2007","unstructured":"Meadows, C.A., Poovendran, R., Pavlovic, D., Chang, L., Syverson, P.F.: Distance bounding protocols: authentication logic analysis and collusion attacks. In: Poovendran, R., Roy, S., Wang, C. (eds.) Secure Localization and Time Synchronization for Wireless Sensor and Ad Hoc Networks. ADIS, vol. 30, pp. 279\u2013298. Springer, Boston (2007). \n                    https:\/\/doi.org\/10.1007\/978-0-387-46276-9_12"},{"issue":"12","key":"13_CR30","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/359657.359659","volume":"21","author":"RM Needham","year":"1978","unstructured":"Needham, R.M., Schroeder, M.D.: Using encryption for authentication in large networks of computers. Commun. ACM 21(12), 993\u2013999 (1978). \n                    https:\/\/doi.org\/10.1145\/359657.359659","journal-title":"Commun. ACM"},{"key":"13_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-319-45741-3_23","volume-title":"Computer Security \u2013 ESORICS 2016","author":"V Nigam","year":"2016","unstructured":"Nigam, V., Talcott, C., Aires Urquiza, A.: Towards the automated verification of cyber-physical security protocols: bounding the number of timed intruders. In: Askoxylakis, I., Ioannidis, S., Katsikas, S., Meadows, C. (eds.) ESORICS 2016, Part II. LNCS, vol. 9879, pp. 450\u2013470. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-45741-3_23"},{"key":"13_CR32","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.entcs.2010.08.007","volume":"265","author":"D Pavlovic","year":"2010","unstructured":"Pavlovic, D., Meadows, C.: Bayesian authentication: quantifying security of the Hancke-Kuhn protocol. Electron. Notes Theoret. Comput. Sci. 265, 97\u2013122 (2010)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"13_CR33","unstructured":"Rowe, P.: Policy compliance, confidentiality and complexity in collaborative systems. Ph.D. thesis. University of Pennsylvania (2009)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Security, Protocols, and Equational Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19052-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:13:46Z","timestamp":1558574026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19052-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030190514","9783030190521"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19052-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}