{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:48:10Z","timestamp":1725839290645},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319260587"},{"type":"electronic","value":"9783319260594"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26059-4_6","type":"book-chapter","created":{"date-parts":[[2015,11,27]],"date-time":"2015-11-27T16:59:56Z","timestamp":1448643596000},"page":"105-126","source":"Crossref","is-referenced-by-count":11,"title":["Sound Proof of Proximity of Knowledge"],"prefix":"10.1007","author":[{"given":"Serge","family":"Vaudenay","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,28]]},"reference":[{"issue":"2","key":"6_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":"6_CR2","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":"6_CR3","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":"6_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.G.: Identification tokens \u2013 or: solving the chess grandmaster problem. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 169\u2013176. Springer, Heidelberg (1991)"},{"key":"6_CR5","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":"6_CR6","doi-asserted-by":"crossref","unstructured":"Boureanu, I., Mitrokotsa, A., Vaudenay, S.: Practical & Provably Secure Distance- Bounding. IACR Eprint 2013\/465 report (2013)","DOI":"10.1007\/978-3-662-43933-3_4"},{"key":"6_CR7","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":"6_CR8","doi-asserted-by":"crossref","unstructured":"Boureanu, I., Mitrokotsa, A., Vaudenay, S.: Practical & Provably Secure Distance- Bounding. To appear in the Proceedings of ISC 2013 (2013)","DOI":"10.1007\/978-3-662-43933-3_4"},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.3233\/JCS-140518","volume":"23","author":"I Boureanu","year":"2015","unstructured":"Boureanu, I., Mitrokotsa, K., Vaudenay, S.: Practical and provably secure distance- bounding. J. Comput. Secur. (JCS) 23(2), 229\u2013257 (2015)","journal-title":"J. Comput. Secur. (JCS)"},{"key":"6_CR10","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":"6_CR11","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":"6_CR12","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)"},{"issue":"4","key":"6_CR13","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":"6_CR14","doi-asserted-by":"crossref","unstructured":"Cremers, C.J.F., Rasmussen, C.J.F., Schmidt, B., \u010capkun, S.: Distance hijacking attacks on distance bounding protocols. In: IEEE Symposium on Security and Privacy S&P\u201912, San Francisco, California, USA, pp. 113\u2013127. IEEE Computer Society (2012)","DOI":"10.1109\/SP.2012.17"},{"key":"6_CR15","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 France (1988)"},{"key":"6_CR16","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":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"6_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":"6_CR19","doi-asserted-by":"crossref","unstructured":"Gambs, S., Onete, C., Robert, J.-M.: Prover anonymous and deniable distance- bounding authentication. In: ACM Symposium on Information, Computer and Communications Security (ASIACCS 2014), Kyoto, Japan, pp. 501\u2013506. ACM Press (2014)","DOI":"10.1145\/2590296.2590331"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: Proceedings of the 14th ACM Symposium on Theory of Computing, San Fransisco, California, USA, pp. 365\u2013377. ACM Press (1982)","DOI":"10.1145\/800070.802212"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28, 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Hermans, J., Peeters, R., Onete, C.: Efficient, secure, private distance bounding without key updates. In: ACM Conference on Security and Privacy in Wireless and Mobile Networks WISEC 2013, Budapest, Hungary, pp. 195\u2013206. ACM (2013)","DOI":"10.1145\/2462096.2462129"},{"key":"6_CR23","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":"6_CR24","doi-asserted-by":"crossref","unstructured":"K\u0131l\u0131n\u00e7, H., Vaudenay, S.: Optimal Proximity Proof Revisited. To appear in ACNS 2015 (2015)","DOI":"10.1007\/978-3-319-28166-7_23"},{"key":"6_CR25","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":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-662-47854-7_12","volume-title":"Financial Cryptography and Data Security","author":"S Vaudenay","year":"2015","unstructured":"Vaudenay, S.: Private and secure public-key distance bounding. In: B\u00f6hme, R., Okamoto, T. (eds.) FC 2015. LNCS, vol. 8975, pp. 207\u2013216. Springer, Heidelberg (2015)"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Vaudenay, S.: On Privacy for RFID. In: Au, M.-H., Miyaji, A. (eds.) ProvSec 2015. LNCS, vol. 9451, pp. xx\u2013yy. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-319-26059-4_1"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26059-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T14:27:02Z","timestamp":1653661622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26059-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319260587","9783319260594"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26059-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}