{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T14:11:44Z","timestamp":1758636704296,"version":"3.40.4"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319115689"},{"type":"electronic","value":"9783319115696"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11569-6_23","type":"book-chapter","created":{"date-parts":[[2014,9,27]],"date-time":"2014-09-27T05:00:33Z","timestamp":1411794033000},"page":"289-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Complexity of Distance Fraud Attacks in Graph-Based Distance Bounding"],"prefix":"10.1007","author":[{"given":"Rolando","family":"Trujillo-Rasua","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,28]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: ICDE, pp. 3\u201314 (1995)","DOI":"10.1109\/ICDE.1995.380415"},{"issue":"2","key":"23_CR2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.3233\/JCS-2010-0408","volume":"19","author":"G Avoine","year":"2011","unstructured":"Avoine, G., Bing\u00f6l, M.A., Karda\u015f, S., Lauradoux, C., Martin, B.: A framework for analyzing RFID distance bounding protocols. J. Comput. Secur. 19(2), 289\u2013317 (2011)","journal-title":"J. Comput. Secur."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Avoine, G., Tchamkerten, A.: An efficient distance bounding RFID\u00a0authentication\u00a0protocol: balancing false-acceptance rate and memory requirement. In: Samarati, P., Yung, M., Martinelli, F., Ardagna, C.A. (eds.) ISC 2009. LNCS, vol. 5735, pp. 250\u2013261. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-04474-8_21"},{"key":"23_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. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 344\u2013359. Springer, Heidelberg (1994)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Campagna, A., Pagh, R.: On finding frequent patterns in event sequences. In: ICDM \u201910, pp. 755\u2013760 (2010)","DOI":"10.1109\/ICDM.2010.132"},{"key":"23_CR6","unstructured":"Chand, C., Thakkar, A., Amit, G.: Sequential pattern mining: Survey and current research challenges. Int. J. Soft Comput. Eng. 2(1) (2012)"},{"key":"23_CR7","doi-asserted-by":"crossref","DOI":"10.1201\/9781439864159","volume-title":"On Numbers and Games","author":"JH Conway","year":"2000","unstructured":"Conway, J.H.: On Numbers and Games, 2nd edn. AK Peters Ltd., Natick (2000)","edition":"2"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-48184-2_3","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"YG Desmedt","year":"1988","unstructured":"Desmedt, Y.G., Goutier, C., Bengio, S.: Special uses and abuses of the Fiat Shamir passport protocol. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 21\u201339. Springer, Heidelberg (1988)"},{"key":"23_CR9","unstructured":"Drimer, S., Murdoch, S.J.: Keep your enemies close: distance bounding against smartcard relay attacks. In: USINEX, pp. 1\u201316 (2007)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-642-16822-2_4","volume-title":"Radio Frequency Identification: Security and Privacy Issues","author":"L Francis","year":"2010","unstructured":"Francis, L., Hancke, G., Mayes, K., Markantonakis, K.: Practical NFC peer-to-peer relay attack using mobile phones. In: Ors Yalcin, S.B. (ed.) RFIDSec 2010. LNCS, vol. 6370, pp. 35\u201349. Springer, Heidelberg (2010)"},{"key":"23_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, NY (1979)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Hancke, G.P., Kuhn, M.G.: An RFID distance bounding protocol. In: SECURECOMM, pp. 67\u201373 (2005)","DOI":"10.1109\/SECURECOMM.2005.56"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Hancke, G.P., Kuhn, M.G.: Attacks on time-of-flight distance bounding channels. In: WiSec \u201908, pp. 194\u2013202 (2008)","DOI":"10.1145\/1352533.1352566"},{"issue":"5","key":"23_CR14","doi-asserted-by":"publisher","first-page":"1618","DOI":"10.1109\/TWC.2011.030411.101158","volume":"10","author":"CH Kim","year":"2011","unstructured":"Kim, C.H., Avoine, G.: RFID distance bounding protocols with mixed challenges. IEEE Trans. Wireless Commun. 10(5), 1618\u20131626 (2011)","journal-title":"IEEE Trans. Wireless Commun."},{"issue":"3","key":"23_CR15","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Min. Knowl. Discov. 1(3), 259\u2013289 (1997)","journal-title":"Data Min. Knowl. Discov."},{"key":"23_CR16","unstructured":"Oren, Y., Wool, A.: Relay attacks on RFID-based electronic voting systems. Cryptology ePrint Archive, Report 2009\/422 (2009)"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-12-S14-S3","volume":"12","author":"M Shimizu","year":"2011","unstructured":"Shimizu, M., Nagamochi, H., Akutsu, T.: Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies. BMC Bioinform. 12, 1\u20139 (2011)","journal-title":"BMC Bioinform."},{"issue":"10\u201311","key":"23_CR18","doi-asserted-by":"publisher","first-page":"1416","DOI":"10.1016\/j.dam.2012.02.002","volume":"160","author":"T Akutsu","year":"2012","unstructured":"Akutsu, T., Tatsuya, D., Fukagawa, D., Jansson, J., Sadakane, K.: Inferring a graph from path frequency. Discrete Appl. Math. 160(10\u201311), 1416\u20131428 (2012)","journal-title":"Discrete Appl. Math."},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-642-16822-2_19","volume-title":"Radio Frequency Identification: Security and Privacy Issues","author":"R Trujillo-Rasua","year":"2010","unstructured":"Trujillo-Rasua, R., Martin, B., Avoine, G.: The poulidor distance-bounding protocol. In: Ors Yalcin, S.B. (ed.) RFIDSec 2010. LNCS, vol. 6370, pp. 239\u2013257. Springer, Heidelberg (2010)"},{"key":"23_CR20","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)"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-73275-4_8","volume-title":"Security and Privacy in Ad-hoc and Sensor Networks","author":"D Singel\u00e9e","year":"2007","unstructured":"Singel\u00e9e, D., Preneel, B.: Distance bounding in noisy environments. In: Stajano, F., Meadows, C., Capkun, S., Moore, T. (eds.) ESAS 2007. LNCS, vol. 4572, pp. 101\u2013115. Springer, Heidelberg (2007)"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Xin, W., Yang, T., Tang, C., Hu, J., Chen, Z.: A distance bounding protocol using error state and punishment. In: IMCCC, pp. 436\u2013440 (2011)","DOI":"10.1109\/IMCCC.2011.115"},{"issue":"9","key":"23_CR23","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. Mob. Comput. 8(9), 1227\u20131232 (2008)","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Yang, G.: The complexity of mining maximal frequent itemsets and maximal frequent patterns. In: KDD \u201904, pp. 344\u2013353 (2004)","DOI":"10.1145\/1014052.1014091"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Mobile and Ubiquitous Systems: Computing, Networking, and Services"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11569-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T21:52:35Z","timestamp":1746395555000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11569-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115689","9783319115696"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11569-6_23","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"28 September 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}