skip to main content
10.1145/1839294.1839316acmotherconferencesArticle/Chapter ViewAbstractPublication PagespetraConference Proceedingsconference-collections
research-article

A privacy-preserving protocol for finding the nearest doctor in an emergency

Published:23 June 2010Publication History

ABSTRACT

In this work, we define the Nearest Doctor Problem (NDP) for finding the closest doctor in case of an emergency and present a secure multi-party computation for solving it. The solution is based on a privacy-preserving cryptographic protocol and makes use of the current location of each participating doctor. The protocol is efficient and protects the privacy of the location of all doctors. A prototype implementing the proposed solution for a community of doctors that use mobile devices to obtain their current location is presented.

References

  1. A. Acquisti, S. Gritzalis, C. Lambrinoudakis, and S. De Capitani di Vimercati. Digital privacy. Auerbach Publications, Taylor & Francis Group, 6000 Broken Sound ParkWay NW, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. Bickson, D. Dolev, G. Bezman, and B. Pinkas. Peer-to-peer secure multi-party numerical computation. Peer-to-Peer Computing, IEEE International Conference on, 0:257--266, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. Chi-Chih Yao. Protocols for secure computations. In Proceedings of Twenty-third IEEE Symposium on Foundations of Computer Science, pages 160--164. Chicago, Illinois, November 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. V. Ciriani, S. De Capitani di Vimercati, S. Foresti, and P. Samarati. Advances in Information Security, volume 33. Springer US, 2007.Google ScholarGoogle Scholar
  5. R. Dingledine, N. Mathewson, and P. Syverson. Tor: The second-generation onion router. In Proceedings of the 13th USENIX Security Symposium, pages 303--320, August 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. P. S. Efraimidis, G. Drosatos, F. Nalbadis, and A. Tasidou. Towards privacy in personal data management. Journal on Information Management & Computer Security, 17(4), 2009.Google ScholarGoogle Scholar
  7. Europe's Information Society. eSafety, November 2009. http://ec.europa.eu/esafety.Google ScholarGoogle Scholar
  8. D. Hook. Beginning Cryptography with Java. Wiley Publishing, Inc., Indianapolis, In 46256, USA, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, Inc., Boca Raton, FL, USA, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. N. B. Priyantha, A. Chakraborty, and H. Balakrishnan. The cricket location-support system. In 6th ACM MOBICOM, Boston, MA, August 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. Reed, P. Syverson, and D. Goldschlag. Anonymous connections and onion routing. IEEE Journal on Selected Areas in Communications, 16(4), 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. G. Stamatelatos, G. Drosatos, and P. S. Efraimidis. Quantum: A peer-to-peer network for distributed computations with enhanced privacy. In EYRHKA 2009 Conference Proceedings, pages 201--210. 3rd Pan-hellenic Scientific Student Conference on Informatics, September 2009.Google ScholarGoogle Scholar
  13. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In ACM SIGCOMM'01, pages 149--160. San Diego, CA, August 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. R. Want, A. Hopper, a. Veronica Falc and J. Gibbons. The active badge location system. ACM Transactions on Information Systems (TOIS), 10(1):91--102, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. A. Ward, A. Jones, and A. Hopper. A new location technique for the active office. IEEE Personal Communications, 4(5):42--47, October 1997.Google ScholarGoogle Scholar
  16. Wikipedia. Onion routing, November 2009. http://en.wikipedia.org/wiki/Onion_routing.Google ScholarGoogle Scholar
  17. M. Yokoo and K. Suzuki. Secure multi-agent dynamic programming based on homomorphic encryption and its application to combinatorial auctions. In AAMAS'02. Bologna, Italy, July 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A privacy-preserving protocol for finding the nearest doctor in an emergency

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Other conferences
            PETRA '10: Proceedings of the 3rd International Conference on PErvasive Technologies Related to Assistive Environments
            June 2010
            452 pages
            ISBN:9781450300711
            DOI:10.1145/1839294

            Copyright © 2010 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 23 June 2010

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader