{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:06:05Z","timestamp":1761973565726,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385186"},{"type":"electronic","value":"9783642385193"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38519-3_23","type":"book-chapter","created":{"date-parts":[[2013,5,2]],"date-time":"2013-05-02T07:59:28Z","timestamp":1367481568000},"page":"371-391","source":"Crossref","is-referenced-by-count":18,"title":["The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks"],"prefix":"10.1007","author":[{"given":"Asl\u0131","family":"Bay","sequence":"first","affiliation":[]},{"given":"Ioana","family":"Boureanu","sequence":"additional","affiliation":[]},{"given":"Aikaterini","family":"Mitrokotsa","sequence":"additional","affiliation":[]},{"given":"Iosif","family":"Spulber","sequence":"additional","affiliation":[]},{"given":"Serge","family":"Vaudenay","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-20901-7_10","volume-title":"Coding and Cryptology","author":"G. Hanrot","year":"2011","unstructured":"Hanrot, G., Pujol, X., Stehl\u00e9, D.: Algorithms for the shortest and closest lattice vector problems. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol.\u00a06639, pp. 159\u2013190. Springer, Heidelberg (2011)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Avoine, G., Lauradoux, C., Martin, B.: How Secret-sharing can Defeat Terrorist Fraud. In: Proceedings of the 4th ACM Conference on Wireless Network Security \u2013 WiSec 2011, Hamburg, Germany. ACM Press (June 2011)","DOI":"10.1145\/1998412.1998437"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica\u00a06(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"23_CR4","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 \u201990","author":"T. Beth","year":"1991","unstructured":"Beth, T., Desmedt, Y.: Identification tokens \u2013 or: Solving the chess grandmaster problem. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 169\u2013176. Springer, Heidelberg (1991)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-68697-5_11","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"D. Boneh","year":"1996","unstructured":"Boneh, D., Venkatesan, R.: Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 129\u2013142. Springer, Heidelberg (1996)"},{"key":"23_CR6","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.\u00a07533, pp. 100\u2013120. Springer, Heidelberg (2012)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/3-540-48285-7_30","volume-title":"Advances in Cryptology - EUROCRYPT 1993","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)"},{"key":"23_CR8","unstructured":"Bussard, L.: Trust Establishment Protocols for Communicating Devices. PhD thesis, Ecole Nationale Sup\u00e9rieure des T\u00e9l\u00e9communications, Institut Eur\u00e9com, T\u00e9l\u00e9com Paris (2004)"},{"key":"23_CR9","unstructured":"Bussard, L., Bagga, W.: Distance-Bounding Proof of Knowledge Protocols to Avoid Terrorist Fraud Attacks. Technical Report RR-04-109, Institute EURECOM (May 2004)"},{"key":"23_CR10","series-title":"IFIP","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, vol.\u00a0181, pp. 223\u2013238. Springer, Boston (2005)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"\u010capkun, S., Butty\u00e1n, 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_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25385-0_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"Y. Chen","year":"2011","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: Better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 1\u201320. Springer, Heidelberg (2011)"},{"issue":"4","key":"23_CR13","first-page":"493","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. Statistics\u00a023(4), 493\u2013507 (1952)","journal-title":"Statistics"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/11964254_9","volume-title":"Security and Privacy in Ad-Hoc and Sensor Networks","author":"J. Clulow","year":"2006","unstructured":"Clulow, J., Hancke, G.P., Kuhn, M.G., Moore, T.: So Near and Yet So Far: Distance-Bounding Attacks in Wireless Networks. In: Butty\u00e1n, L., Gligor, V., Westhoff, D. (eds.) ESAS 2006. LNCS, vol.\u00a04357, pp. 83\u201397. Springer, Heidelberg (2006)"},{"key":"23_CR15","unstructured":"Desmedt, Y.: Major Security Problems with the \u201cUnforgeable\u201d (Feige)-Fiat-Shamir Proofs of Identity and How to Overcome Them, Paris, France, March 15-17, pp. 147\u2013159. SEDEP (1988)"},{"key":"23_CR16","unstructured":"Drimer, S., Murdoch, S.J.: Keep your enemies close: distance bounding against smartcard relay attacks. In: Proceedings of 16th USENIX Security Symposium, pp. 7:1\u20137:16. USENIX Association, Berkeley (2007)"},{"key":"23_CR17","unstructured":"Francillon, A., Danev, B., \u010capkun, S.: Relay attacks on passive keyless entry and start systems in modern cars. Cryptology ePrint Archive, Report 2010\/332 (2010), http:\/\/eprint.iacr.org\/"},{"issue":"4","key":"23_CR18","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/MSP.2005.1458289","volume":"22","author":"S. Gezici","year":"2005","unstructured":"Gezici, S., Tian, Z., Biannakis, G.B., Kobayashi, H., Molisch, A.F., Poor, V., Sahinoglu, Z.: Localization via ultra-wideband radius: a look at positioning aspects for future sensor networks. IEEE Signal Processing Magazine\u00a022(4), 70\u201384 (2005)","journal-title":"IEEE Signal Processing Magazine"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Gilbert, H., Robshaw, M., Sibert, H.: An Active Attack Against HB+ - A Provably Secure Lightweight Authentication Protocol. Technical report, IACR Cryptology ePrint Archive 237 (2005)","DOI":"10.1049\/el:20052622"},{"key":"23_CR20","volume-title":"IEEE International Conference on RFID-Technology and Applications \u2013 IEEE RFID TA 2012","author":"G. Hancke","year":"2012","unstructured":"Hancke, G.: Distance-bounding for RFID: Effectiveness of \u2018terrorist fraud\u2019 in the presence of bit errors. In: IEEE International Conference on RFID-Technology and Applications \u2013 IEEE RFID TA 2012. IEEE Press, Nice (2012)"},{"key":"23_CR21","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"},{"issue":"301","key":"23_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. Journal of the American Statistical Association\u00a058(301), 13\u201330 (1963)","journal-title":"Journal of the American Statistical Association"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/11535218_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"A. Juels","year":"2005","unstructured":"Juels, A., Weis, S.A.: Authenticating Pervasive Devices with Human Protocols. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 293\u2013308. Springer, Heidelberg (2005)"},{"key":"23_CR24","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":"C.H. 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.\u00a05888, pp. 119\u2013133. Springer, Heidelberg (2009)"},{"key":"23_CR25","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":"C.H. 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.\u00a05461, pp. 98\u2013115. Springer, Heidelberg (2009)"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Kuhn, M., Luecken, H., Tippenhauer, N.O.: UWB Impulse Radio Based Distance Bounding. In: Proceedings of the 7th Workshop on Positioning, Navigation and Communication 2010, WPNC 2010 (2010)","DOI":"10.1109\/WPNC.2010.5653801"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Lee, J.-Y., Scholtz, R.A.: Ranging in a Dense Multipath Environment using an UWB Radio Link. IEEE Journal on Selected Areas in Communications\u00a020(9) (2002)","DOI":"10.1109\/JSAC.2002.805060"},{"key":"23_CR28","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring Polynomials with Rational Coefficients. Mathematische Annalen\u00a0261, 515\u2013534 (1982), 10.1007\/BF01457454","journal-title":"Mathematische Annalen"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Meadows, C., Syverson, P., Chang, L.: Towards More Efficient Distance Bounding Protocols for Use in Sensor Networks. In: Proceedings of the International Conference on Security and Privacy in Communication Networks (SECURECOMM 2006), pp. 1\u20135 (2006)","DOI":"10.1109\/SECCOMW.2006.359532"},{"key":"23_CR30","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. Wireless Communications and Mobile Computing\u00a08, 1227\u20131232 (2008)","journal-title":"Wireless Communications and Mobile Computing"},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Munilla, J., Peinado, A.: Security Analysis of Tu and Piramuthu\u2019s Protocol. In: New Technologies, Mobility and Security \u2013 NTMS 2008, Tangier, Morocco, pp. 1\u20135. IEEE Computer Society (November 2008)","DOI":"10.1109\/NTMS.2008.ECP.88"},{"issue":"3","key":"23_CR32","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00145-002-0021-3","volume":"15","author":"P.Q. Nguyen","year":"2002","unstructured":"Nguyen, P.Q., Shparlinski, I.: The Insecurity of the Digital Signature Algorithm with Partially Known Nonces. J. Cryptology\u00a015(3), 151\u2013176 (2002)","journal-title":"J. Cryptology"},{"key":"23_CR33","doi-asserted-by":"crossref","unstructured":"Nikov, V., Vauclair, M.: Yet Another Secure Distance-Bounding Protocol. In: Proceedings of the Conference on Security and Cryptography (SECRYPT 2008), pp. 218\u2013221 (July 2008)","DOI":"10.5220\/0001926402180221"},{"key":"23_CR34","doi-asserted-by":"crossref","unstructured":"Reid, J., Gonzalez Nieto, J.M., Tang, T., Senadji, B.: Detecting Relay Attacks with Timing-based Protocols. In: ASIACCS 2007: Proceedings of the 2nd ACM Symposium on Information, Computer and Communications Security, pp. 204\u2013213. ACM (2007)","DOI":"10.1145\/1229285.1229314"},{"issue":"04","key":"23_CR35","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1017\/S0963548300001371","volume":"3","author":"C.P. Schnorr","year":"1994","unstructured":"Schnorr, C.P.: Block Reduced Lattice Bases and Successive Minima. Combinatorics, Probability and Computing\u00a03(04), 507\u2013522 (1994)","journal-title":"Combinatorics, Probability and Computing"},{"key":"23_CR36","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P., Euchner, M.: Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. Math. Programming, 181\u2013191 (1993)","DOI":"10.1007\/BF01581144"},{"key":"23_CR37","unstructured":"Shoup, V.: NTL: A Library for Doing Number Theory, http:\/\/shoup.net\/ntl"},{"key":"23_CR38","doi-asserted-by":"crossref","unstructured":"Singel\u00e9e, D., Preneel, B.: Location Verification Using Secure Distance Bounding Protocols. In: Proceedings of the IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS 2005), pp. 834\u2013840 (2005)","DOI":"10.1109\/MAHSS.2005.1542879"},{"key":"23_CR39","unstructured":"Tu, Y.-J., Piramuthu, S.: RFID Distance Bounding Protocols. In: First International EURASIP Workshop on RFID Technology (2007)"},{"key":"23_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-76900-2_5","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"S. Vaudenay","year":"2007","unstructured":"Vaudenay, S.: On Privacy Models for RFID. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 68\u201387. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38519-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T07:58:00Z","timestamp":1745999880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38519-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385186","9783642385193"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38519-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}