{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:38Z","timestamp":1750307738705,"version":"3.41.0"},"reference-count":3,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T00:00:00Z","timestamp":1207008000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMOBILE Mob. Comput. Commun. Rev."],"published-print":{"date-parts":[[2008,4]]},"abstract":"<jats:p>Location information is playing a larger and larger part within services in today's world and for this reason, users require some way of providing their location which can be trusted by third parties. Until recently, GPS has been accepted as an adequate solution but with user privacy and information security becoming more sensitive issues, a new method of gathering trustworthy location information must be developed. We believe that enlisting the aid of neighbouring devices, while employing proper security measures, provides the basis of such a method, and propose one such method of our own, based upon distance-bounding protected by security protocols.<\/jats:p>","DOI":"10.1145\/1394555.1394564","type":"journal-article","created":{"date-parts":[[2008,8,5]],"date-time":"2008-08-05T13:35:10Z","timestamp":1217943310000},"page":"47-49","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A system for secure verification of location claims"],"prefix":"10.1145","volume":"12","author":[{"given":"Michelle","family":"Graham","sequence":"first","affiliation":[{"name":"Dublin City University"}]}],"member":"320","published-online":{"date-parts":[[2008,4]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"344","volume-title":"Theory and Application of Cryptographic Techniques","author":"Brands Stefan","year":"1993"},{"key":"e_1_2_1_2_1","unstructured":"Definition and description of a Faraday Cage. http:\/\/www.wisegeek.com\/what-is-a-faraday-cage.htm. webpage February 2007.  Definition and description of a Faraday Cage. http:\/\/www.wisegeek.com\/what-is-a-faraday-cage.htm. webpage February 2007."},{"volume-title":"Princeton University","year":"2003","author":"Brent","key":"e_1_2_1_3_1"}],"container-title":["ACM SIGMOBILE Mobile Computing and Communications Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1394555.1394564","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1394555.1394564","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:53Z","timestamp":1750253933000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1394555.1394564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":3,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["10.1145\/1394555.1394564"],"URL":"https:\/\/doi.org\/10.1145\/1394555.1394564","relation":{},"ISSN":["1559-1662","1931-1222"],"issn-type":[{"type":"print","value":"1559-1662"},{"type":"electronic","value":"1931-1222"}],"subject":[],"published":{"date-parts":[[2008,4]]},"assertion":[{"value":"2008-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}