We propose a privacy-preserving protocol for the discovery of nearby friends. In this scenario, Alice wants to verify whether any of her friends is close to her or not. This should be done without disclosing any information about Alice to her friends and also any of the other parties’ information to Alice. In this paper, we present a protocol based on the homomorphic property of Goldwasser-Micali cryptosystem to protect each user’s location in proximity queries. However, an active adversary could learn, if two users are “close” to each other due to the vulnerability of the Goldwasser-Micali to IND-CCA2 attacks and malleability of homomorphic encryption schemes. Our protocol solves this problem with the authenticated encryption scheme called encrypt-then-mac [5]. We implemented our proposed protocol on the Android platform and we show that the proposed system and protocol can achieve a high level of privacy and secrecy.
CITATION STYLE
Hezaveh, M., & Adams, C. (2017). Privacy preserving discovery of nearby-friends. In Lecture Notes in Business Information Processing (Vol. 289, pp. 41–55). Springer Verlag. https://doi.org/10.1007/978-3-319-59041-7_3
Mendeley helps you to discover research relevant for your work.