{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:15:53Z","timestamp":1748751353396,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319281650"},{"type":"electronic","value":"9783319281667"}],"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"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-28166-7_23","type":"book-chapter","created":{"date-parts":[[2016,1,8]],"date-time":"2016-01-08T15:29:04Z","timestamp":1452266944000},"page":"478-494","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimal Proximity Proofs Revisited"],"prefix":"10.1007","author":[{"given":"Handan","family":"K\u0131l\u0131n\u00e7","sequence":"first","affiliation":[]},{"given":"Serge","family":"Vaudenay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,9]]},"reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-04474-8_21","volume-title":"Information Security","author":"G Avoine","year":"2009","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)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-38424-3_12","volume-title":"Advances in Cryptology-CRYPTO 1990","author":"T Beth","year":"1991","unstructured":"Beth, T., Desmedt, Y.: Identification tokens or: solving the chess grandmaster problem. In: Menezes, A.J., Vanstone, S.A. (eds.) Advances in Cryptology-CRYPTO 1990. LNCS, vol. 537, pp. 169\u2013176. Springer, Heidelberg (1991)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-40392-7_8","volume-title":"Lightweight Cryptography for Security and Privacy","author":"I Boureanu","year":"2013","unstructured":"Boureanu, I., Mitrokotsa, A., Vaudenay, S.: Secure and lightweight distance-bounding. In: Avoine, G., Kara, O. (eds.) LightSec 2013. LNCS, vol. 8162, pp. 97\u2013113. Springer, Heidelberg (2013)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-3-662-43933-3_4","volume-title":"Fast Software Encryption","author":"I Boureanu","year":"2014","unstructured":"Boureanu, I., Mitrokotsa, A., Vaudenay, S.: Towards secure distance bounding. In: Moriai, S. (ed.) FSE 2013. LNCS, vol. 8424, pp. 55\u201368. Springer, Heidelberg (2014)"},{"key":"23_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27659-5_18","volume-title":"Practical and Provably Secure Distance-Bounding","author":"I Boureanu","year":"2015","unstructured":"Boureanu, I., Mitrokotsa, A., Vaudenay, S.: Practical and Provably Secure Distance-Bounding. IOS Press, Amsterdam (2015)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/978-3-319-16745-9_10","volume-title":"Information Security and Cryptology","author":"I Boureanu","year":"2015","unstructured":"Boureanu, I., Vaudenay, S.: Optimal proximity proofs. In: Lin, D., Yung, M., Zhou, J. (eds.) Inscrypt 2014. LNCS, vol. 8957, pp. 170\u2013190. Springer, Heidelberg (2015)"},{"key":"23_CR7","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_CR8","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/0-387-25660-1_15","volume-title":"Security and Privacy in the Age of Ubiquitous Computing","author":"L Bussard","year":"2005","unstructured":"Bussard, L., Bagga, W.: Distance-bounding proof of knowledge to avoid real-time attacks. In: Sasaki, R., Qing, S., Okamoto, E., Yoshiura, H. (eds.) Security and Privacy in the Age of Ubiquitous Computing. IFIP AICT, vol. 181, pp. 223\u2013238. Springer, Heidelberg (2005)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Capkun, S., Buttyan, L., Hubaux, J.-P.: Sector: secure tracking of node encounters in multi-hop wireless networks. In: ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN), pp. 21\u201332 (2003)","DOI":"10.1145\/986858.986862"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 493\u2013507 (1952)","journal-title":"Ann. Math. Stat."},{"key":"23_CR11","doi-asserted-by":"crossref","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 (SP), pp. 113\u2013127. IEEE (2012)","DOI":"10.1109\/SP.2012.17"},{"key":"23_CR12","unstructured":"Desmedt, Y.: Major security problems with the unforgeable (Feige-) Fiat-Shamir proofs of identity and how to overcome them. In: Congress on Computer and Communication Security and Protection Securicom 1988, pp. 147\u2013159. SEDEP, Paris (1988)"},{"key":"23_CR13","unstructured":"Drimer, S., Murdoch, S.J.: Keep your enemies close: distance bounding against smartcard relay attacks. In: USENIX Security (2007)"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-642-38980-1_26","volume-title":"Applied Cryptography and Network Security","author":"M Fischlin","year":"2013","unstructured":"Fischlin, M., Onete, C.: Terrorism in distance bounding: modeling terrorist-fraud resistance. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 414\u2013431. Springer, Heidelberg (2013)"},{"key":"23_CR15","doi-asserted-by":"crossref","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. IEEE (2005)","DOI":"10.1109\/SECURECOMM.2005.56"},{"issue":"301","key":"23_CR16","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cose.2014.06.001","volume":"45","author":"A Mitrokotsa","year":"2014","unstructured":"Mitrokotsa, A., Onete, C., Vaudenay, S.: Location leakage in distance bounding: why location privacy does not work. Comput. Secur. 45, 199\u2013209 (2014)","journal-title":"Comput. Secur."},{"issue":"9","key":"23_CR18","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_CR19","doi-asserted-by":"crossref","unstructured":"Rasmussen, K.B., \u010capkun, S.: Location privacy of distance bounding protocols. In: Proceedings of the 15th ACM Conference on Computer and Communications Security, pp. 149\u2013160. ACM (2008)","DOI":"10.1145\/1455770.1455791"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Reid, J., Nieto, J.M.G., Tang, T., Senadji, B.: Detecting relay attacks with timing-based protocols. In: Proceedings of the 2nd ACM Symposium on Information, Computer and Communications Security, pp. 204\u2013213. ACM (2007)","DOI":"10.1145\/1229285.1229314"},{"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","unstructured":"Tu, Y.-J., Piramuthu, S.: RFID distance bounding protocols. In: First International EURASIP Workshop on RFID Technology, pp. 67\u201368 (2007)"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-41227-1_1","volume-title":"Provable Security","author":"S Vaudenay","year":"2013","unstructured":"Vaudenay, S.: On modeling terrorist frauds. In: Susilo, W., Reyhanitabar, R. (eds.) ProvSec 2013. LNCS, vol. 8209, pp. 1\u201320. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28166-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T02:42:50Z","timestamp":1748745770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28166-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319281650","9783319281667"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28166-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 January 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}