Safeguarding Location Privacy in Wireless Ad-Hoc Networks
Identifieur interne : 003038 ( Istex/Curation ); précédent : 003037; suivant : 003039Safeguarding Location Privacy in Wireless Ad-Hoc Networks
Auteurs : Tanzima Hashem [Australie] ; Lars Kulik [Australie]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2007.
Abstract
Abstract: We present a novel algorithm that safeguards the location privacy of users accessing location-based services via mobile devices. Our technique exploits the capability of mobile devices to form wireless ad-hoc networks in order to hide a user’s identity and position. Local ad-hoc networks enable us to separate an agent’s request for location information, the query initiator, from the agent that actually requests this service on its behalf, the query requestor. Since a query initiator can select itself or one of the k − 1 agents in its ad-hoc network as a query requestor, the query initiator remains k-anonymous. In addition, the location revealed to the location service provider is a rectangle instead of an exact coordinate. We develop an anonymous selection algorithm that selects a query requestor with near-uniform randomness, which is a key component to ensure anonymity in an ad-hoc network. Our experiments show that a system can ensure a high quality of service and maintain a high degree of privacy in terms of anonymity and obfuscation while accessing location-based services.
Url:
DOI: 10.1007/978-3-540-74853-3_22
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :003038
Links to Exploration step
ISTEX:1D94B713E6BE61C9192732B1117AE302C83FB005Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Safeguarding Location Privacy in Wireless Ad-Hoc Networks</title><author><name sortKey="Hashem, Tanzima" sort="Hashem, Tanzima" uniqKey="Hashem T" first="Tanzima" last="Hashem">Tanzima Hashem</name><affiliation wicri:level="1"><mods:affiliation>National ICT Australia, Department of Computer Science and Software Engineering, University of Melbourne, Victoria, 3010, Australia</mods:affiliation><country xml:lang="fr">Australie</country><wicri:regionArea>National ICT Australia, Department of Computer Science and Software Engineering, University of Melbourne, Victoria, 3010</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: thashem@csse.unimelb.edu.au</mods:affiliation><country wicri:rule="url">Australie</country></affiliation></author><author><name sortKey="Kulik, Lars" sort="Kulik, Lars" uniqKey="Kulik L" first="Lars" last="Kulik">Lars Kulik</name><affiliation wicri:level="1"><mods:affiliation>National ICT Australia, Department of Computer Science and Software Engineering, University of Melbourne, Victoria, 3010, Australia</mods:affiliation><country xml:lang="fr">Australie</country><wicri:regionArea>National ICT Australia, Department of Computer Science and Software Engineering, University of Melbourne, Victoria, 3010</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: lars@csse.unimelb.edu.au</mods:affiliation><country wicri:rule="url">Australie</country></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:1D94B713E6BE61C9192732B1117AE302C83FB005</idno><date when="2007" year="2007">2007</date><idno type="doi">10.1007/978-3-540-74853-3_22</idno><idno type="url">https://api.istex.fr/document/1D94B713E6BE61C9192732B1117AE302C83FB005/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">003038</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003038</idno><idno type="wicri:Area/Istex/Curation">003038</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Safeguarding Location Privacy in Wireless Ad-Hoc Networks</title><author><name sortKey="Hashem, Tanzima" sort="Hashem, Tanzima" uniqKey="Hashem T" first="Tanzima" last="Hashem">Tanzima Hashem</name><affiliation wicri:level="1"><mods:affiliation>National ICT Australia, Department of Computer Science and Software Engineering, University of Melbourne, Victoria, 3010, Australia</mods:affiliation><country xml:lang="fr">Australie</country><wicri:regionArea>National ICT Australia, Department of Computer Science and Software Engineering, University of Melbourne, Victoria, 3010</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: thashem@csse.unimelb.edu.au</mods:affiliation><country wicri:rule="url">Australie</country></affiliation></author><author><name sortKey="Kulik, Lars" sort="Kulik, Lars" uniqKey="Kulik L" first="Lars" last="Kulik">Lars Kulik</name><affiliation wicri:level="1"><mods:affiliation>National ICT Australia, Department of Computer Science and Software Engineering, University of Melbourne, Victoria, 3010, Australia</mods:affiliation><country xml:lang="fr">Australie</country><wicri:regionArea>National ICT Australia, Department of Computer Science and Software Engineering, University of Melbourne, Victoria, 3010</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: lars@csse.unimelb.edu.au</mods:affiliation><country wicri:rule="url">Australie</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2007</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">1D94B713E6BE61C9192732B1117AE302C83FB005</idno><idno type="DOI">10.1007/978-3-540-74853-3_22</idno><idno type="ChapterID">22</idno><idno type="ChapterID">Chap22</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We present a novel algorithm that safeguards the location privacy of users accessing location-based services via mobile devices. Our technique exploits the capability of mobile devices to form wireless ad-hoc networks in order to hide a user’s identity and position. Local ad-hoc networks enable us to separate an agent’s request for location information, the query initiator, from the agent that actually requests this service on its behalf, the query requestor. Since a query initiator can select itself or one of the k − 1 agents in its ad-hoc network as a query requestor, the query initiator remains k-anonymous. In addition, the location revealed to the location service provider is a rectangle instead of an exact coordinate. We develop an anonymous selection algorithm that selects a query requestor with near-uniform randomness, which is a key component to ensure anonymity in an ad-hoc network. Our experiments show that a system can ensure a high quality of service and maintain a high degree of privacy in terms of anonymity and obfuscation while accessing location-based services.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003038 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 003038 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= TelematiV1
|flux= Istex
|étape= Curation
|type= RBID
|clé= ISTEX:1D94B713E6BE61C9192732B1117AE302C83FB005
|texte= Safeguarding Location Privacy in Wireless Ad-Hoc Networks
}}
| This area was generated with Dilib version V0.6.31. |  |