{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:14Z","timestamp":1750306634680,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,4]],"date-time":"2014-06-04T00:00:00Z","timestamp":1401840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"LYRICS Project and by an NSERC discovery","award":["ANR-11-INS-0013"],"award-info":[{"award-number":["ANR-11-INS-0013"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,4]]},"DOI":"10.1145\/2590296.2590331","type":"proceedings-article","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T18:18:31Z","timestamp":1401473911000},"page":"501-506","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Prover anonymous and deniable distance-bounding authentication"],"prefix":"10.1145","author":[{"given":"S\u00e9bastien","family":"Gambs","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Rennes 1 -- Inria\/IRISA, Rennes, France"}]},{"given":"Cristina","family":"Onete","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Rennes 1 -- Inria\/IRISA, Rennes, France"}]},{"given":"Jean-Marc","family":"Robert","sequence":"additional","affiliation":[{"name":"ETS Montr\u00e9al, Montr\u00e9al, Canada"}]}],"member":"320","published-online":{"date-parts":[[2014,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04474-8_21"},{"key":"e_1_3_2_1_2_1","series-title":"LNCS","first-page":"97","volume-title":"Proc. of LightSec'13","author":"Boureanu I.","year":"2013","unstructured":"I. Boureanu , A. Mitrokotsa , and S. Vaudenay . Secure and lightweight distance-bounding . In Proc. of LightSec'13 , volume 8162 of LNCS , pages 97 -- 113 . Springer-Verlag , 2013 . I. Boureanu, A. Mitrokotsa, and S. Vaudenay. Secure and lightweight distance-bounding. In Proc. of LightSec'13, volume 8162 of LNCS, pages 97--113. Springer-Verlag, 2013."},{"key":"e_1_3_2_1_3_1","series-title":"LNCS","first-page":"344","volume-title":"Proc. of EUROCRYPT'93","author":"Brands S.","year":"1993","unstructured":"S. Brands and D. Chaum . Distance-bounding protocols . In Proc. of EUROCRYPT'93 , volume 765 of LNCS , pages 344 -- 359 . Springer-Verlag , 1993 . S. Brands and D. Chaum. Distance-bounding protocols. In Proc. of EUROCRYPT'93, volume 765 of LNCS, pages 344--359. Springer-Verlag, 1993."},{"key":"e_1_3_2_1_4_1","first-page":"222","volume-title":"Proc. of Security and Privacy, IFIP","author":"Bussard L.","year":"2005","unstructured":"L. Bussard and W. Bagga . Distance-bounding proof of knowledge to avoid real-time attacks . In Proc. of Security and Privacy, IFIP , pages 222 -- 238 . Springer-Verlag , 2005 . L. Bussard and W. Bagga. Distance-bounding proof of knowledge to avoid real-time attacks. In Proc. of Security and Privacy, IFIP, pages 222--238. Springer-Verlag, 2005."},{"key":"e_1_3_2_1_5_1","series-title":"LNCS","first-page":"21","volume-title":"Proc. of CRYPTO'87","author":"Desmedt Y.","year":"1988","unstructured":"Y. Desmedt , C. Goutier , and S. Bengio . Special uses and abuses of the Fiat-Shamir passport protocol . In Proc. of CRYPTO'87 , volume 293 of LNCS , pages 21 -- 39 . Springer-Verlag , 1988 . Y. Desmedt, C. Goutier, and S. Bengio. Special uses and abuses of the Fiat-Shamir passport protocol. In Proc. of CRYPTO'87, volume 293 of LNCS, pages 21--39. Springer-Verlag, 1988."},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","first-page":"47","volume-title":"Proc. of ISC'11","author":"Durholz U.","year":"2011","unstructured":"U. Durholz , M. Fischlin , M. Kasper , and C. Onete . A formal approach to distance bounding RFID protocols . In Proc. of ISC'11 , volume 7001 of LNCS , pages 47 -- 62 . Springer-Verlag , 2011 . U. Durholz, M. Fischlin, M. Kasper, and C. Onete. A formal approach to distance bounding RFID protocols. In Proc. of ISC'11, volume 7001 of LNCS, pages 47--62. Springer-Verlag, 2011."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2462096.2462128"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38980-1_26"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECURECOMM.2005.56"},{"key":"e_1_3_2_1_11_1","series-title":"LNCS","first-page":"568","volume-title":"Proc. of ESORICS'11","author":"Hermans J.","year":"2011","unstructured":"J. Hermans , A. Pashalidis , F. Vercauteren , and B. Preneel . A new RFID privacy model . In Proc. of ESORICS'11 , volume 6879 of LNCS , pages 568 -- 587 . Springer-Verlag , 2011 . J. Hermans, A. Pashalidis, F. Vercauteren, and B. Preneel. A new RFID privacy model. In Proc. of ESORICS'11, volume 6879 of LNCS, pages 568--587. Springer-Verlag, 2011."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2462096.2462129"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10433-6_9"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368310.1368352"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229285.1229314"},{"key":"e_1_3_2_1_17_1","series-title":"LNCS","first-page":"68","volume-title":"Proc. of ASIACRYPT'07","author":"Vaudenay S.","year":"2007","unstructured":"S. Vaudenay . On privacy models for RFID . In Proc. of ASIACRYPT'07 , volume 4883 of LNCS , pages 68 -- 87 . Springer-Verlag , 2007 . S. Vaudenay. On privacy models for RFID. In Proc. of ASIACRYPT'07, volume 4883 of LNCS, pages 68--87. Springer-Verlag, 2007."}],"event":{"name":"ASIA CCS '14: 9th ACM Symposium on Information, Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Kyoto Japan","acronym":"ASIA CCS '14"},"container-title":["Proceedings of the 9th ACM symposium on Information, computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2590296.2590331","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2590296.2590331","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:52Z","timestamp":1750229752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2590296.2590331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,4]]},"references-count":15,"alternative-id":["10.1145\/2590296.2590331","10.1145\/2590296"],"URL":"https:\/\/doi.org\/10.1145\/2590296.2590331","relation":{},"subject":[],"published":{"date-parts":[[2014,6,4]]},"assertion":[{"value":"2014-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}