{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T04:20:51Z","timestamp":1747887651706,"version":"3.41.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319167442"},{"type":"electronic","value":"9783319167459"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16745-9_10","type":"book-chapter","created":{"date-parts":[[2015,3,29]],"date-time":"2015-03-29T02:13:35Z","timestamp":1427595215000},"page":"170-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Optimal Proximity Proofs"],"prefix":"10.1007","author":[{"given":"Ioana","family":"Boureanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge","family":"Vaudenay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,28]]},"reference":[{"issue":"2","key":"10_CR1","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., Kardas, 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":"10_CR2","doi-asserted-by":"crossref","unstructured":"Avoine, G., Lauradoux, C., Martin, B.: How secret-sharing can defeat terrorist fraud. In: ACM Conference on Wireless Network Security WISEC 2011, Hamburg, Germany, pp. 145\u2013156. ACM (2011)","DOI":"10.1145\/1998412.1998437"},{"key":"10_CR3","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":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-642-38519-3_23","volume-title":"Information Security and Cryptology","author":"A Bay","year":"2013","unstructured":"Bay, A., Boureanu, I., Mitrokotsa, A., Spulber, I., Vaudenay, S.: The Bussard-Bagga and other distance-bounding protocols under attacks. In: Kuty\u0142owski, M., Yung, M. (eds.) Inscrypt 2012. LNCS, vol. 7763, pp. 371\u2013391. Springer, Heidelberg (2013)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-33481-8_6","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2012","author":"I Boureanu","year":"2012","unstructured":"Boureanu, I., Mitrokotsa, A., Vaudenay, S.: On the pseudorandom function assumption in (secure) distance-bounding protocols. In: Hevia, A., Neven, G. (eds.) LatinCrypt 2012. LNCS, vol. 7533, pp. 100\u2013120. Springer, Heidelberg (2012)"},{"key":"10_CR6","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":"10_CR7","unstructured":"Boureanu, I., Mitrokotsa, A., Vaudenay, S.: Practical & provably secure distance-bounding. J. Comput. Secur. (JCS), IOS Press. Available as IACR Eprint 2013\/465 report (2013, to appear). http:\/\/eprint.iacr.org\/2013\/465.pdf"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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\u201367. Springer, Heidelberg (2014)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Boureanu, I., Mitrokotsa, A., Vaudenay, S.: Practical & provably secure distance-bounding. In: Proceedings of ISC 2013 (to appear)","DOI":"10.1007\/978-3-662-43933-3_4"},{"key":"10_CR10","unstructured":"Boureanu, I., Vaudenay, S.: Optimal proximity proofs. IACR Eprint 2014\/693 report (2014). http:\/\/eprint.iacr.org\/2014\/693.pdf"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/MSP.2015.2","volume":"13","author":"I Boureanu","year":"2015","unstructured":"Boureanu, I., Vaudenay, S.: Challenges in distance-bounding. IEEE Secur. Priv. 13(1), 41\u201348 (2015). doi:10.1109\/MSP.2015.2","journal-title":"IEEE Secur. Priv."},{"key":"10_CR12","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 \u201993","author":"S Brands","year":"1994","unstructured":"Brands, S., Chaum, D.: Distance-bounding protocols (extended abstract). In: Helleseth, T. (ed.) Advances in Cryptology \u2014 EUROCRYPT 1993. LNCS, vol. 765, pp. 344\u2013359. Springer, Heidelberg (1994)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-642-03356-8_23","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"N Chandran","year":"2009","unstructured":"Chandran, N., Goyal, V., Moriarty, R., Ostrovsky, R.: Position based cryptography. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 391\u2013407. Springer, Heidelberg (2009)"},{"issue":"4","key":"10_CR14","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(4), 493\u2013507 (1952)","journal-title":"Ann. Math. Stat."},{"key":"10_CR15","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 S&P 2012, San Francisco, California, USA, pp. 113\u2013127. IEEE Computer Society (2012)","DOI":"10.1109\/SP.2012.17"},{"key":"10_CR16","unstructured":"Desmedt, Y.: Major security problems with the \u201cunforgeable\u201d (feige-)fiat-Shamir proofs of identity and how to overcome them. In: Congress on Computer and Communication Security and Protection Securicom 1988, Paris, France, pp. 147\u2013159. SEDEP, Paris (1988)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-24861-0_4","volume-title":"Information Security","author":"U D\u00fcrholz","year":"2011","unstructured":"D\u00fcrholz, U., Fischlin, M., Kasper, M., Onete, C.: A formal approach to distance-bounding RFID protocols. In: Lai, X., Zhou, J., Li, H. (eds.) ISC 2011. LNCS, vol. 7001, pp. 47\u201362. Springer, Heidelberg (2011)"},{"key":"10_CR18","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":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-642-19348-4_6","volume-title":"Data Privacy Management and Autonomous Spontaneous Security","author":"A \u00d6zhan G\u00fcrel","year":"2011","unstructured":"\u00d6zhan G\u00fcrel, A., Arslan, A., Akg\u00fcn, M.: Non-uniform stepping approach to RFID distance bounding problem. In: Garcia-Alfaro, J., Navarro-Arribas, G., Cavalli, A., Leneutre, J. (eds.) DPM 2010 and SETOP 2010. LNCS, vol. 6514, pp. 64\u201378. Springer, Heidelberg (2011)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Hancke, G.P.: Distance bounding for RFID: effectiveness of terrorist fraud. In: Conference on RFID-Technologies and Applications RFID-TA 2012, Nice, France, pp. 91\u201396. IEEE (2012)","DOI":"10.1109\/RFID-TA.2012.6404574"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Hancke, G.P., Kuhn, M.G.: An RFID distance bounding protocol. In: Conference on Security and Privacy for Emerging Areas in Communications Networks SecureComm 2005, Athens, Greece, pp. 67\u201373. IEEE (2005)","DOI":"10.1109\/SECURECOMM.2005.56"},{"key":"10_CR22","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, 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"10_CR23","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":"10_CR24","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 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.) Information Security and Cryptology ICISC 2008. LNCS, vol. 5461, pp. 98\u2013115. Springer, Heidelberg (2009)"},{"key":"10_CR25","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, 1227\u20131232 (2008)","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Nikov, V., Vauclair, M.: Yet another secure distance-bounding protocol. In: Proceedings of SECRYPT 2008, Porto, Portugal, pp. 218\u2013221. INSTICC Press (2008)","DOI":"10.5220\/0001926402180221"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Reid, J., Nieto, J.M.G., Tang, T., Senadji, B.: Detecting relay attacks with timing-based protocols. In: ACM Symposium on Information, Computer and Communications Security ASIACCS 2007, Singapore, pp. 204\u2013213. ACM (2007)","DOI":"10.1145\/1229285.1229314"},{"key":"10_CR28","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":"10_CR29","unstructured":"Tu, Y.-J., Piramuthu, S.: RFID distance bounding protocols. In: Workshop on RFID Technology RFID 2007, Vienna, Austria, EURASIP (2007). http:\/\/www.eurasip.org\/Proceedings\/Ext\/RFID2007"},{"key":"10_CR30","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)"},{"key":"10_CR31","unstructured":"Vaudenay, S.: Proof of proximity of knowledge. IACR Eprint 2014\/695 report (2014). http:\/\/eprint.iacr.org\/2014\/695.pdf"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Vaudenay, S.: Private and secure public-key distance bounding: application to NFC payment. In: Proceedings of Financial Cryptography 2015 (2015, to appear)","DOI":"10.1007\/978-3-662-47854-7_12"},{"issue":"5","key":"10_CR33","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1587\/transcom.E97.B.930","volume":"E97\u2013B","author":"T-Y Youn","year":"2014","unstructured":"Youn, T.-Y., Hong, D.: Authenticated distance bounding protocol with improved FAR: beyond the minimal bound of FAR. IEICE Trans. Commun. E97\u2013B(5), 930\u2013935 (2014)","journal-title":"IEICE Trans. Commun."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16745-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T18:19:31Z","timestamp":1747851571000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16745-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319167442","9783319167459"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16745-9_10","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":"28 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}