{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:15:47Z","timestamp":1743077747122,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030620769"},{"type":"electronic","value":"9783030620776"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-62077-6_11","type":"book-chapter","created":{"date-parts":[[2020,10,28]],"date-time":"2020-10-28T11:25:37Z","timestamp":1603884337000},"page":"146-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Assumption-Based Analysis of Distance-Bounding Protocols with cpsa"],"prefix":"10.1007","author":[{"given":"Paul D.","family":"Rowe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua D.","family":"Guttman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John D.","family":"Ramsdell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,28]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: 28th ACM Symposium on Principles of Programming Languages (POPL 2001), pp. 104\u2013115 (2001)","DOI":"10.1145\/373243.360213"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"AlTurki, M.A., Kanovich, M.I., Kirigin, T.B., Nigam, V., Scedrov, A., Talcott, C.L.: Statistical model checking of distance fraud attacks on the hancke-kuhn family of protocols. In: Lie, D., Mannan, M. (eds) Proceedings of the 2018 Workshop on Cyber-Physical Systems Security and PrivaCy, CPS-SPC@CCS 2018, Toronto, ON, Canada, 19 October 2018, pp. 60\u201371. ACM (2018)","DOI":"10.1145\/3264888.3264895"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-030-19052-1_13","volume-title":"Foundations of Security, Protocols, and Equational Reasoning","author":"MA Alturki","year":"2019","unstructured":"Alturki, M.A., Ban Kirigin, T., Kanovich, M., Nigam, V., Scedrov, A., Talcott, C.: A multiset rewriting model for specifying and verifying timing aspects of security protocols. In: Guttman, J.D., Landwehr, C.E., Meseguer, J., Pavlovic, D. (eds.) Foundations of Security, Protocols, and Equational Reasoning. LNCS, vol. 11565, pp. 192\u2013213. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-19052-1_13"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Avoine, G., et al.: A terrorist-fraud resistant and extractor-free anonymous distance-bounding protocol. In: Karri, R., Sinanoglu, O., Sadeghi, A.-R., Yi, X. (eds.) Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, AsiaCCS 2017, Abu Dhabi, United Arab Emirates, 2\u20136 April 2017, pp. 800\u2013814. ACM (2017)","DOI":"10.1145\/3052973.3053000"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Avoine, G., et al.: A terrorist-fraud resistant and extractor-free anonymous distance-bounding protocol. IACR Cryptology ePrint Archive 2017, 297 (2017)","DOI":"10.1145\/3052973.3053000"},{"key":"11_CR6","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 \u2014 EUROCRYPT 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). \nhttps:\/\/doi.org\/10.1007\/3-540-48285-7_30"},{"key":"11_CR7","unstructured":"Chothia, T., de Ruiter, J., Smyth, B.: Modelling and analysis of a hierarchy of distance bounding attacks. In: Enck, W., Felt, A.P. (eds.) 27th USENIX Security Symposium, USENIX Security 2018, Baltimore, MD, USA, 15\u201317 August 2018, pp. 1563\u20131580. USENIX Association (2018)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-662-47854-7_11","volume-title":"Financial Cryptography and Data Security","author":"T Chothia","year":"2015","unstructured":"Chothia, T., Garcia, F.D., de Ruiter, J., van den Breekel, J., Thompson, M.: Relay cost bounding for contactless EMV payments. In: B\u00f6hme, R., Okamoto, T. (eds.) FC 2015. LNCS, vol. 8975, pp. 189\u2013206. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-47854-7_11"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Cremers, C.J.F., Rasmussen, K.B., Schmidt, B., \u010capkun, S.: Distance hijacking attacks on distance bounding protocols. In: IEEE Symposium on Security and Privacy, SP 2012, San Francisco, California, USA, 21\u201323 May 2012, pp. 113\u2013127. IEEE Computer Society (2012)","DOI":"10.1109\/SP.2012.17"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-030-17138-4_7","volume-title":"Principles of Security and Trust","author":"A Debant","year":"2019","unstructured":"Debant, A., Delaune, S.: Symbolic verification of distance bounding protocols. In: Nielson, F., Sands, D. (eds.) POST 2019. LNCS, vol. 11426, pp. 149\u2013174. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-17138-4_7"},{"key":"11_CR11","unstructured":"Desmedt, Y.: Major security problems with the \u2018unforgeable\u2019 (feige)-fiat-shamir proofs of identity and how to overcome them. In: SECURICOM 1988, pp. 15\u201317 (1988)"},{"key":"11_CR12","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, 198\u2013208 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"247","DOI":"10.3233\/JCS-2004-12203","volume":"12","author":"N Durgin","year":"2004","unstructured":"Durgin, N., Lincoln, P., Mitchell, J., Scedrov, A.: Multiset rewriting and the complexity of bounded security protocols. J. Comput. Secur. 12(2), 247\u2013311 (2004). Initial version appeared in Workshop on Formal Methods and Security Protocols, 1999","journal-title":"J. Comput. Secur."},{"key":"11_CR14","unstructured":"Guttman, J.D.: Shapes: surveying crypto protocol runs. In: Cortier, V., Kremer, S. (eds.) Formal Models and Techniques for Analyzing Security Protocols, Cryptology and Information Security Series. IOS Press (2011)"},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"201","DOI":"10.3233\/JCS-140497","volume":"22","author":"JD Guttman","year":"2014","unstructured":"Guttman, J.D.: Establishing and preserving protocol security goals. J. Comput. Secur. 22(2), 201\u2013267 (2014)","journal-title":"J. Comput. Secur."},{"key":"11_CR16","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, Athens, Greece, 5\u20139 September 2005, pp. 67\u201373. IEEE (2005)"},{"key":"11_CR17","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-44878-7_14"},{"issue":"6","key":"11_CR18","doi-asserted-by":"publisher","first-page":"585","DOI":"10.3233\/JCS-0560","volume":"25","author":"MI Kanovich","year":"2017","unstructured":"Kanovich, M.I., Kirigin, T.B., 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)","journal-title":"J. Comput. Secur."},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-10433-6_9","volume-title":"Cryptology and Network Security","author":"CH Kim","year":"2009","unstructured":"Kim, C.H., Avoine, G.: RFID distance bounding protocol with mixed challenges to prevent relay attacks. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 119\u2013133. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-10433-6_9"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-00730-9_7","volume-title":"Information Security and Cryptology \u2013 ICISC 2008","author":"CH Kim","year":"2009","unstructured":"Kim, C.H., Avoine, G., Koeune, F., Standaert, F.-X., Pereira, O.: The swiss-knife RFID distance bounding protocol. In: Lee, P.J., Cheon, J.H. (eds.) ICISC 2008. LNCS, vol. 5461, pp. 98\u2013115. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-00730-9_7"},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","first-page":"55","DOI":"10.3233\/JCS-1996-4104","volume":"4","author":"UM Maurer","year":"1996","unstructured":"Maurer, U.M., Schmid, P.E.: A calculus for security bootstrapping in distributed systems. J. Comput. Secur. 4(1), 55\u201380 (1996)","journal-title":"J. Comput. Secur."},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Mauw, S., Smith, Z., Toro-Pozo, J., Trujillo-Rasua, R.: Distance-bounding protocols: Verification without time and location. In: 2018 IEEE Symposium on Security and Privacy, SP 2018, Proceedings, 21\u201323 May 2018, San Francisco, California, USA, pp. 549\u2013566. IEEE Computer Society (2018)","DOI":"10.1109\/SP.2018.00001"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Mauw, S., Smith, Z., Toro-Pozo, J., Trujillo-Rasua, R.: Post-collusion security and distance bounding. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, London, UK, 11\u201315 November 2019, pp. 941\u2013958. ACM (2019)","DOI":"10.1145\/3319535.3345651"},{"key":"11_CR24","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. Advances in Information Security, vol. 30, pp. 279\u2013298. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-0-387-46276-9_12"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-642-39799-8_48","volume-title":"Computer Aided Verification","author":"S Meier","year":"2013","unstructured":"Meier, S., Schmidt, B., Cremers, C., Basin, D.: The TAMARIN prover for the symbolic analysis of security protocols. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 696\u2013701. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39799-8_48"},{"issue":"9","key":"11_CR26","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1002\/wcm.590","volume":"8","author":"J Munilla","year":"2008","unstructured":"Munilla, J., Peinado, A.: Distance bounding protocols for RFID enhanced by using void-challenges and analysis in noisy channels. Wirel. Commun. Mobile Comput. 8(9), 1227\u20131232 (2008)","journal-title":"Wirel. Commun. Mobile Comput."},{"key":"11_CR27","unstructured":"Ramsdell, J.D.: Deducing security goals from shape analysis sentences. The MITRE Corporation (2012). \nhttp:\/\/arxiv.org\/abs\/1204.0480"},{"key":"11_CR28","unstructured":"Ramsdell, J.D., Guttman, J.D.: CPSA4: A cryptographic protocol shapes analyzer (2017). \nhttps:\/\/github.com\/mitre\/cpsaexp"},{"key":"11_CR29","unstructured":"Ramsdell, J.D., Guttman, J.D., Liskov, M.D., Rowe, P.D.: The CPSA Specification: A Reduction System for Searching for Shapes in Cryptographic Protocols. The MITRE Corporation (2009). \nhttp:\/\/hackage.haskell.org\/package\/cpsa\n\n. source distribution, doc directory"},{"key":"11_CR30","unstructured":"Rasmussen, K.B., Capkun, S.: Realization of RF distance bounding. In: 19th USENIX Security Symposium, Washington, DC, USA, 11\u201313 August 2010, Proceedings, pp. 389\u2013402. USENIX Association (2010)"},{"key":"11_CR31","unstructured":"Reid, J., Nieto, J.M.G., Tang, T., Senadji, B.: Detecting relay attacks with timing-based protocols. In: Bao, F., Miller, S. (eds.) Proceedings of the 2007 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2007, Singapore, 20\u201322 March 2007, pp. 204\u2013213. ACM (2007)"},{"key":"11_CR32","doi-asserted-by":"publisher","unstructured":"Rowe, P.D., Guttman, J.D., Liskov, M.D.: Measuring protocol strength with security goals. Int. J. Inf. Secur. 15(6), 575\u2013596 (2016). \nhttps:\/\/doi.org\/10.1007\/s10207-016-0319-z\n\n. \nhttp:\/\/web.cs.wpi.edu\/~guttman\/pubs\/ijis_measuring-security.pdf","DOI":"10.1007\/s10207-016-0319-z"},{"key":"11_CR33","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-13446-3_6","volume-title":"Trust Management IV","author":"FJ Thayer","year":"2010","unstructured":"Thayer, F.J., Swarup, V., Guttman, J.D.: Metric strand spaces for locale authentication protocols. In: Nishigaki, M., J\u00f8sang, A., Murayama, Y., Marsh, S. (eds.) IFIPTM 2010. IAICT, vol. 321, pp. 79\u201394. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13446-3_6"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, and Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62077-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,28]],"date-time":"2020-10-28T12:07:36Z","timestamp":1603886856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-62077-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030620769","9783030620776"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62077-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}