Show simple item record

An efficient privacy-preserving solution for finding the nearest doctor

dc.contributor.authorDrosatos, George
dc.contributor.authorEfraimidis, Pavlos S.
dc.date.accessioned2021-03-17T09:03:11Z
dc.date.available2021-03-17T09:03:11Z
dc.date.issued2012-10-30
dc.identifier.urihttp://hdl.handle.net/11728/11762
dc.description.abstractIn this work, we define the Nearest Doctor Problem for finding the nearest doctor in case of an emergency and present a privacy-preserving protocol for solving it. The solution is based on cryptographic primitives and makes use of the current location of each participating doctor. The protocol is efficient and protects the privacy of the doctors’ locations. A prototype implementing the proposed solution for a community of doctors that use mobile devices to obtain their current location is presented. The prototype is evaluated on experimental communities with up to several hundred doctor agents.en_UK
dc.language.isoenen_UK
dc.publisherPersonal and Ubiquitous Computing volumeen_UK
dc.relation.ispartofseries;vol. 18
dc.rightsSpringer-Verlag London 2012en_UK
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/en_UK
dc.subjectNearest Doctor Problemen_UK
dc.subjectCryptographic primitivesen_UK
dc.titleAn efficient privacy-preserving solution for finding the nearest doctoren_UK
dc.typeArticleen_UK
dc.doiDOI 10.1007/s00779-012-0619-xen_UK


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Springer-Verlag London 2012
Except where otherwise noted, this item's license is described as Springer-Verlag London 2012