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

D 2014

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

ŠEDĚNKA, Jaroslav a Paolo GASTI

Základní údaje

Originální název

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

Autoři

ŠEDĚNKA, Jaroslav (203 Česká republika, garant, domácí) a Paolo GASTI (380 Itálie)

Vydání

New York, USA, Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security, od s. 99-110, 12 s. 2014

Nakladatel

ACM

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Japonsko

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

elektronická verze "online"

Odkazy

URL

Kód RIV

RIV/00216224:14310/14:00082022

Organizační jednotka

Přírodovědecká fakulta

ISBN

978-1-4503-2800-5

DOI

http://dx.doi.org/10.1145/2590296.2590307

Klíčová slova anglicky

secuee multiparty computation; homomorphic encryption; privacy-preserving distance computation

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 25. 4. 2016 21:32, Mgr. Jaroslav Šeděnka, Ph.D.

Anotace

V originále

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. Our distance computation protocols runs, in fact, in 54 to 78 ms on a commodity Android smartphone. Similarly, our proximity tests require between 1.2 s and 2.8 s on the same platform. The imprecision introduced by our protocols is very small, i.e., between 0.1% and 3% on average, depending on the distance.

Návaznosti

EE2.3.20.0051, projekt VaV

Název: Algebraické metody v kvantové logice

Přiložené soubory

p99-sedenka.pdf

Vyhledat podobné dokumenty

pp-local-asiaccs14.pdf

Požádat o autorskou verzi souboru

Citovat

ŠEDĚNKA, Jaroslav a Paolo GASTI. Privacy-Preserving Distance Computation and Proximity Testing on Earth, Done Right. Online. In Shiho Moriai. Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security. New York, USA: ACM, 2014, s. 99-110. ISBN 978-1-4503-2800-5. Dostupné z: https://dx.doi.org/10.1145/2590296.2590307.

@inproceedings{1183358,
   author = {Šeděnka, Jaroslav and Gasti, Paolo},
   address = {New York, USA},
   booktitle = {Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security},
   doi = {http://dx.doi.org/10.1145/2590296.2590307},
   editor = {Shiho Moriai},
   keywords = {secuee multiparty computation; homomorphic encryption; privacy-preserving distance computation},
   howpublished = {elektronická verze "online"},
   language = {eng},
   location = {New York, USA},
   isbn = {978-1-4503-2800-5},
   pages = {99-110},
   publisher = {ACM},
   title = {Privacy-Preserving Distance Computation and Proximity Testing on Earth, Done Right},
   url = {http://dl.acm.org/citation.cfm?doid=2590296.2590307},
   year = {2014}
}

TY  - JOUR
ID  - 1183358
AU  - Šeděnka, Jaroslav - Gasti, Paolo
PY  - 2014
TI  - Privacy-Preserving Distance Computation and Proximity Testing on Earth, Done Right
PB  - ACM
CY  - New York, USA
SN  - 9781450328005
KW  - secuee multiparty computation
KW  - homomorphic encryption
KW  - privacy-preserving distance computation
UR  - http://dl.acm.org/citation.cfm?doid=2590296.2590307
L2  - http://dl.acm.org/citation.cfm?doid=2590296.2590307
N2  - 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. Our distance computation protocols runs, in fact, in 54 to 78 ms on a commodity Android smartphone. Similarly, our proximity tests require between 1.2 s and 2.8 s on the same platform. The imprecision introduced by our protocols is very small, i.e., between 0.1% and 3% on average, depending on the distance.
ER  -

ŠEDĚNKA, Jaroslav a Paolo GASTI. Privacy-Preserving Distance Computation and Proximity Testing on Earth, Done Right. Online. In Shiho Moriai. \textit{Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security}. New York, USA: ACM, 2014, s.~99-110. ISBN~978-1-4503-2800-5. Dostupné z: https://dx.doi.org/10.1145/2590296.2590307.

Podrobný výpis o publikaci