Privacy-Preserving Distance Computation and Proximity Testing on Earth, Done Right

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F14%3A00082022" target="_blank" >RIV/00216224:14310/14:00082022 - isvavai.cz</a>

Výsledek na webu

<a href="http://dl.acm.org/citation.cfm?doid=2590296.2590307" target="_blank" >http://dl.acm.org/citation.cfm?doid=2590296.2590307</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/2590296.2590307" target="_blank" >10.1145/2590296.2590307</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Privacy-Preserving Distance Computation and Proximity Testing on Earth, Done Right

Popis výsledku v původním jazyce

In recent years, the availability of GPS-enabled smartphones have made location-based services extremely popular. A multitude of applications rely on location information to provide a wide range of services. Location information is, however, extremely sensitive and can be easily abused. In this paper, we introduce the first protocols for secure computation of distance and for proximity testing over a sphere. Our secure distance protocols allow two parties, Alice and Bob, to determine their mutual distance without disclosing any additional information about their location. Through our secure proximity testing protocols, Alice only learns if Bob is in close proximity, i.e., within some arbitrary distance. Our techniques rely on three different representations of Earth, which provide different trade-os between accuracy and performance. We show, via experiments on a prototype implementation, that our protocols are practical on resource- constrained smartphone devices.

Název v anglickém jazyce

Privacy-Preserving Distance Computation and Proximity Testing on Earth, Done Right

Popis výsledku anglicky

In recent years, the availability of GPS-enabled smartphones have made location-based services extremely popular. A multitude of applications rely on location information to provide a wide range of services. Location information is, however, extremely sensitive and can be easily abused. In this paper, we introduce the first protocols for secure computation of distance and for proximity testing over a sphere. Our secure distance protocols allow two parties, Alice and Bob, to determine their mutual distance without disclosing any additional information about their location. Through our secure proximity testing protocols, Alice only learns if Bob is in close proximity, i.e., within some arbitrary distance. Our techniques rely on three different representations of Earth, which provide different trade-os between accuracy and performance. We show, via experiments on a prototype implementation, that our protocols are practical on resource- constrained smartphone devices.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/EE2.3.20.0051" target="_blank" >EE2.3.20.0051: Algebraické metody v kvantové logice</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2014

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security

ISBN

9781450328005

ISSN

—

e-ISSN

—

Počet stran výsledku

12

Strana od-do

99-110

Název nakladatele

ACM

Místo vydání

New York, USA

Místo konání akce

Kyoto, Japan

Datum konání akce

1. 1. 2014

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—