{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:26:24Z","timestamp":1725981984258},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319935232"},{"type":"electronic","value":"9783319935249"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-93524-9_12","type":"book-chapter","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T02:37:00Z","timestamp":1529462220000},"page":"177-188","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting Two-Hop Distance-Bounding Protocols: Are You Really Close Enough?"],"prefix":"10.1007","author":[{"given":"Nektaria","family":"Kaloudi","sequence":"first","affiliation":[]},{"given":"Aikaterini","family":"Mitrokotsa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,21]]},"reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/MSP.2015.87","volume":"13","author":"C Dimitrakakis","year":"2015","unstructured":"Dimitrakakis, C., Mitrokotsa, A.: Distance-bounding protocols: are you close enough? IEEE Secur. Priv. 13(4), 47\u201351 (2015)","journal-title":"IEEE Secur. Priv."},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-21356-9_1","volume-title":"Cryptography and Information Security in the Balkans","author":"A Mitrokotsa","year":"2015","unstructured":"Mitrokotsa, A.: Authentication in constrained settings. In: Ors, B., Preneel, B. (eds.) BalkanCryptSec 2014. LNCS, vol. 9024, pp. 3\u201312. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21356-9_1"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Dimitrakakis, C., Mitrokotsa, A., Vaudenay, S.: Expected loss bounds for authentication in constrained channels. In: Proceedings of INFOCOM 2012, Orlando, Florida, March 2012","DOI":"10.1109\/INFCOM.2012.6195788"},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"309","DOI":"10.3233\/JCS-140521","volume":"23","author":"C Dimitrakakis","year":"2015","unstructured":"Dimitrakakis, C., Mitrokotsa, A., Vaudenay, S.: Expected loss analysis for authentication in constrained channels. J. Comput. Secur. 23(3), 309\u2013329 (2015)","journal-title":"J. Comput. Secur."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1093\/comjnl\/bxt033","volume":"56","author":"A Mitrokotsa","year":"2013","unstructured":"Mitrokotsa, A., Peris-Lopez, P., Dimitrakakis, C., Vaudenay, S.: On selecting the nonce length in distance-bounding protocols. Comput. J. 56, 1216\u20131227 (2013)","journal-title":"Comput. J."},{"key":"12_CR6","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."},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-25243-3_7","volume-title":"Information and Communications Security","author":"J-P Aumasson","year":"2011","unstructured":"Aumasson, J.-P., Mitrokotsa, A., Peris-Lopez, P.: A note on a privacy-preserving distance-bounding protocol. In: Qing, S., Susilo, W., Wang, G., Liu, D. (eds.) ICICS 2011. LNCS, vol. 7043, pp. 78\u201392. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25243-3_7"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.future.2016.05.031","volume":"80","author":"E Pagnin","year":"2016","unstructured":"Pagnin, E., Yang, A., Hu, Q., Hancke, G., Mitrokotsa, A.: HB+ DB: distance bounding meets human based authentication. Future Gener. Comput. Syst. 80, 627\u2013639 (2016)","journal-title":"Future Gener. Comput. Syst."},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1109\/LCOMM.2010.02.091946","volume":"14","author":"A Mitrokotsa","year":"2010","unstructured":"Mitrokotsa, A., Dimitrakakis, C., Peris-Lopez, P., Castro, J.C.H.: Reid et al\u2019.s distance bounding protocol and mafia fraud attacks over noisy channels. IEEE Commun. Lett. 14(2), 121\u2013123 (2010)","journal-title":"IEEE Commun. Lett."},{"key":"12_CR10","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). https:\/\/doi.org\/10.1007\/978-3-642-38519-3_23"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Mitrokotsa, A., Onete, C., Vaudenay, S.: Mafia fraud attack against the RC distance-bounding protocol. In: Proceedings of the 2012 IEEE RFID Technology and Applications (IEEE RFID T-A), pp. 74\u201379. IEEE Press, Nice, November 2012","DOI":"10.1109\/RFID-TA.2012.6404571"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Pagnin, E., Yang, A., Hancke, G.P., Mitrokotsa, A.: HB+ DB, mitigating man-in-the-middle attacks against HB+ with distance bounding. In: Proceedings of the 8th ACM Conference on Security & Privacy in Wireless and Mobile Networks, New York, NY, USA, 22\u201326 June 2015, pp. 3:1\u20133:6 (2015)","DOI":"10.1145\/2766498.2766516"},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.3233\/JCS-140518","volume":"23","author":"I Boureanu","year":"2015","unstructured":"Boureanu, I., Mitrokotsa, A., Vaudenay, S.: Practical and provably secure distance-bounding. J. Comput. Secur. 23(2), 229\u2013257 (2015)","journal-title":"J. Comput. Secur."},{"key":"12_CR14","unstructured":"Boureanu, I., Mitrokotsa, A., Vaudenay, S.: Practical and provably secure distance-bounding. In: Proceedings of the 16th Information Security Conference (ISC), Dallas, Texas, USA, November 2013"},{"issue":"7","key":"12_CR15","first-page":"1365","volume":"20","author":"C Karlsson","year":"2016","unstructured":"Karlsson, C., Mitrokotsa, A.: Grouping-proof-distance-bounding protocols: keep all your friends close. IEEE Commun. Lett. 20(7), 1365\u20131368 (2016)","journal-title":"IEEE Commun. Lett."},{"issue":"7","key":"12_CR16","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1109\/LCOMM.2015.2434373","volume":"19","author":"E Pagnin","year":"2015","unstructured":"Pagnin, E., Hancke, G., Mitrokotsa, A.: Using distance-bounding protocols to securely verify the proximity of two-hop neighbours. IEEE Commun. Lett. 19(7), 1173\u20131176 (2015)","journal-title":"IEEE Commun. Lett."},{"key":"12_CR17","unstructured":"Mitrokotsa, A., Onete, C., Pagnin, E., Perera, M.: Multi-hop distance estimation: how far are you? Cryptology ePrint Archive, Report 2017\/705 (2017). http:\/\/eprint.iacr.org\/2017\/705"},{"key":"12_CR18","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). https:\/\/doi.org\/10.1007\/978-3-642-00730-9_7"},{"key":"12_CR19","unstructured":"Tu, Y.J., Piramuthu, S.: RFID distance bounding protocols. In: Proceeidngs of 1st International EURASIP Workshop on RFID Technology (2007)"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Shih, C.Y., Marr\u00f3n, P.J.: Cola: complexity-reduced trilateration approach for 3D localization in wireless sensor networks. In: 2010 Fourth International Conference on Sensor Technologies and Applications (SENSORCOMM), pp. 24\u201332, July 2010","DOI":"10.1109\/SENSORCOMM.2010.11"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-92862-1_7","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"C Papamanthou","year":"2008","unstructured":"Papamanthou, C., Preparata, F.P., Tamassia, R.: Algorithms for location estimation based on RSSI sampling. In: Fekete, S.P. (ed.) ALGOSENSORS 2008. LNCS, vol. 5389, pp. 72\u201386. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92862-1_7"}],"container-title":["Lecture Notes in Computer Science","Information Security Theory and Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93524-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,19]],"date-time":"2019-10-19T14:26:53Z","timestamp":1571495213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-93524-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319935232","9783319935249"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93524-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}