Efficient Privacy-Preserving Chatting Scheme with Degree of Interest Verification for Vehicular Social Networks

Abstract

Wireless communication capabilities of Vehicular Ad Hoc Networks (VANETs) have been utilized in various cutting-edge applications such as Vehicular Social Networks (VSNs). One of the benefits of VSNs is sharing of common-interest information among vehicle drivers. Drivers may benefit from identifying neighbors that have interest common with them alongwith the extent of their interest. However, there are some privacy issues that should be addressed. Revealing the nature and degree of interests (DOI) of drivers can be in violation of their privacy. In this paper, we propose an efficient chatting scheme among drivers that preserves such privacy. We use attribute based encryption (ABE) technique for anonymous common interest verification and homomorphic encryption technique for anonymous DOI verification. Moreover, we propose an efficient search mechanism to enable vehicles to check if they have common interests with low computation and communication overhead. To secure conversation, a key agreement protocol is used to enable the drivers that have the same interest and the desired DOI to establish a shared secret key. Our extensive evaluations demonstrate that our scheme can successfully preserve drivers' privacy with low communication and computation overhead.

A Survey on Secure Computation Based on Homomorphic Encryption in Vehicular Ad Hoc Networks

“…They are compared in Table 1. Ozdemir's homomorphic encryption scheme [150] Data management framework Aggregate data Center database server calculates the final aggregation result [151] Modified FHE scheme Aggregation protocol Aggregate data Avoid leaking distance estimation [152] Improved 2-DNF algorithm [25] Polygons spatial query scheme Search data The location-based services user can inquire any polygonal area to obtain accurate results [ Paillier Time-sharing method Implement matching task The vehicle owner chooses the requester, which has the minimum cost value [158] Partial homomorphic encryption Search method Query the ciphertexts of vehicle records Support the subset of structured query language queries on the ciphertexts [159] Partial homomorphic encryption Chatting mechanism Verify common interest and degree of interest, check vehicles'common interests…”

“…In order to protect drivers' privacy, Rabieh et al [159] proposed a secure chatting mechanism. In this mechanism, attribute-based encryption is used to verify common interests anonymously.…”

Privacy-Preserving Schemes for Ad Hoc Social Networks: A Survey

“…More precisely, Lu et al in [21] proposes a protocol, called FLIP, which is based on authenticated key exchange (AKE) protocols [64]. Based on degree of interest verification, Rabieh et al [26] uses the attribute based encryption in order to preserve the interest privacy.…”

“…Year Paper Year Paper Year [9] 2008 [10] 2011 [11] 2013 [12] 2010 [13] 2011 [14] 2014 [15] 2010 [16] 2011 [17] 2014 [18] 2010 [19] 2012 [20] 2014 [21] 2010 [22] 2012 [23] 2015 [24] 2010 [25] 2012 [26] 2015 [27] 2011 [28] 2012 [29] 2016 [30] 2011 [31] 2012 [32] 2016 [33] 2011 [34] 2012 [35] 2016 [36] 2011 [37] 2013 [38] 2016 [39] 2011 [40] 2013 [41] 2016…”