{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:52:58Z","timestamp":1743011578656,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662466650"},{"type":"electronic","value":"9783662466667"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-46666-7_14","type":"book-chapter","created":{"date-parts":[[2015,3,30]],"date-time":"2015-03-30T18:57:12Z","timestamp":1427741832000},"page":"259-279","source":"Crossref","is-referenced-by-count":13,"title":["Discrete vs. Dense Times in the Analysis of Cyber-Physical Security Protocols"],"prefix":"10.1007","author":[{"given":"Max","family":"Kanovich","sequence":"first","affiliation":[]},{"given":"Tajana Ban","family":"Kirigin","sequence":"additional","affiliation":[]},{"given":"Vivek","family":"Nigam","sequence":"additional","affiliation":[]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[]},{"given":"Carolyn","family":"Talcott","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30080-9_1","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Decision problems for timed automata: A survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol.\u00a03185, pp. 1\u201324. Springer, Heidelberg (2004)"},{"issue":"2","key":"14_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/2019599.2019601","volume":"14","author":"D.A. 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.\u00a014(2), 16 (2011)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"14_CR3","unstructured":"Boureanu, I., Mitrokotsa, A., Vaudenay, S.: Practical & provably secure distance-bounding. IACR Cryptology ePrint Archive, 2013:465 (2013)"},{"key":"14_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 - EUROCRYPT \u201993","author":"S. Brands","year":"1994","unstructured":"Brands, S., Chaum, D.: Distance-bounding protocols (extended abstract). In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 344\u2013359. Springer, Heidelberg (1994)"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1109\/JSAC.2005.861380","volume":"24","author":"S. Capkun","year":"2006","unstructured":"Capkun, S., Hubaux, J.-P.: Secure positioning in wireless networks. IEEE Journal on Selected Areas in Communications\u00a024(2), 221\u2013232 (2006)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"14_CR6","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":"14_CR7","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 - A High-Performance Logical Framework. LNCS, vol.\u00a04350. Springer, Heidelberg (2007)"},{"issue":"6","key":"14_CR8","doi-asserted-by":"crossref","first-page":"619","DOI":"10.3233\/JCS-2007-15603","volume":"15","author":"R. Corin","year":"2007","unstructured":"Corin, R., Etalle, S., Hartel, P.H., Mader, A.: Timed analysis of security protocols. J. Comput. Secur.\u00a015(6), 619\u2013645 (2007)","journal-title":"J. Comput. Secur."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Cremers, C.J.F., Rasmussen, K.B., Schmidt, B., Capkun, S.: Distance hijacking attacks on distance bounding protocols. In: SP (2012)","DOI":"10.1109\/SP.2012.17"},{"issue":"2","key":"14_CR10","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":"14_CR11","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":"14_CR12","unstructured":"Enderton, H.B.: A mathematical introduction to logic. Academic Press (1972)"},{"key":"14_CR13","series-title":"LNCS","first-page":"1","volume-title":"FOSAD 2007","author":"S. Escobar","year":"2009","unstructured":"Escobar, S., Meadows, C., Meseguer Maude-NPA, J.: Cryptographic Protocol Analysis Modulo Equational Properties. In: Aldini, A., Barthe, G., Gorrieri, R. (eds.) FOSAD 2007. LNCS, vol.\u00a05705, pp. 1\u201350. Springer, Heidelberg (2009)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Ganeriwal, S., P\u00f6pper, C., Capkun, S., Srivastava, M.B.: Secure time synchronization in sensor networks. ACM Trans. Inf. Syst. Secur., 11(4) (2008)","DOI":"10.1145\/1380564.1380571"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Kirigin, T.B., Nigam, V., Scedrov, A.: Bounded memory Dolev-Yao adversaries in collaborative systems. Inf. Comput. (2014)","DOI":"10.1016\/j.ic.2014.07.011"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-40203-6_18","volume-title":"Computer Security \u2013 ESORICS 2013","author":"M. Kanovich","year":"2013","unstructured":"Kanovich, M., Ban Kirigin, T., Nigam, V., Scedrov, A.: Bounded memory protocols and progressing collaborative systems. In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol.\u00a08134, pp. 309\u2013326. Springer, Heidelberg (2013)"},{"key":"14_CR17","unstructured":"Kanovich, M.I., Kirigin, T.B., Nigam, V., Scedrov, A., Talcott, C.L.: Towards timed models for cyber-physical security protocols. Available on Nigam\u2019s homepage (2014)"},{"key":"14_CR18","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, pp. 305\u2013322 (2012)"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Kanovich, M.I., Kirigin, T.B., Nigam, V., Scedrov, A., Talcott, C.L., Perovic, R.: A rewriting framework and logic for activities subject to regulations (2014), submitted, available on Nigam\u2019s homepage","DOI":"10.21236\/ADA626172"},{"issue":"3-4","key":"14_CR20","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"},{"issue":"5-6","key":"14_CR21","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00236-010-0121-8","volume":"47","author":"R. Lanotte","year":"2010","unstructured":"Lanotte, R., Maggiolo-Schettini, A., Troina, A.: Reachability results for timed automata with unbounded data structures. Acta Inf.\u00a047(5-6), 279\u2013311 (2010)","journal-title":"Acta Inf."},{"key":"14_CR22","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":"14_CR23","unstructured":"Malladi, S., Bruhadeshwar, B., Kothapalli, K.: Automatic analysis of distance bounding protocols, CoRR, abs\/1003.5383 (2010)"},{"key":"14_CR24","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: Secure Localization and Time Synchronization for Wireless Sensor and Ad Hoc Networks, pp. 279\u2013298 (2007)","DOI":"10.1007\/978-0-387-46276-9_12"},{"issue":"12","key":"14_CR25","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":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-36213-2_27","volume-title":"Security Protocols XVII","author":"D. Pavlovic","year":"2013","unstructured":"Pavlovic, D., Meadows, C.: Deriving ephemeral authentication using channel axioms. In: Christianson, B., Malcolm, J.A., Maty\u00e1\u0161, V., Roe, M. (eds.) Security Protocols 2009. LNCS, vol.\u00a07028, pp. 240\u2013261. Springer, Heidelberg (2013)"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","first-page":"363","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"S. Sarukkai","year":"2003","unstructured":"Sarukkai, S., Suresh, S.P.: Tagging makes secrecy decidable with unbounded nonces as well. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 363\u2013374. Springer, Heidelberg (2003)"},{"key":"14_CR28","unstructured":"Ravi, K., Varun, G.H., Vamsi, P.T.: Rfid based security system. International Journal of Innovative Technology and Exploring Engineering 2 (2013)"},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-76929-3_17","volume-title":"Advances in Computer Science \u2013 ASIAN 2007. Computer and Network Security","author":"M.-H. Wang","year":"2007","unstructured":"Wang, M.-H.: Secure verification of location claims with simultaneous distance modification. In: Cervesato, I. (ed.) ASIAN 2007. LNCS, vol.\u00a04846, pp. 181\u2013195. Springer, Heidelberg (2007)"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Sun, K., Ning, P., Wang, C.: Tinysersync: secure and resilient time synchronization in wireless sensor networks. In: CCS, pp. 264\u2013277 (2006)","DOI":"10.1145\/1180405.1180439"},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/978-3-642-04444-1_38","volume-title":"Computer Security \u2013 ESORICS 2009","author":"N.O. Tippenhauer","year":"2009","unstructured":"Tippenhauer, N.O., \u010capkun, S.: ID-based secure distance bounding and localization. In: Backes, M., Ning, P. (eds.) ESORICS 2009. LNCS, vol.\u00a05789, pp. 621\u2013636. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Principles of Security and Trust"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46666-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:55:01Z","timestamp":1559138101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46666-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662466650","9783662466667"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46666-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}