Abstract
The vehicular ad hoc network (VANET) has become a hot topic in recent years. With the development of VANETs, how to achieve secure and efficient machine learning in VANETs is an urgent problem to be solved. Besides, how to ensure that users obtain the accurate results of machine learning is also a challenge. Based on the homomorphic encryption and secure multiparty computing technology, a flexible and privacy-preserving collaborative filtering scheme is proposed to accomplish the personalized recommendation for users, which is based on users’ interests and locations. On the one hand, the data can be updated by users flexibly to ensure the freshness and accuracy of the dataset of interest. On the other hand, the weighted values of user interest can be safely sorted to improve the accuracy of collaborative filtering effectively. Moreover, a novel collaborative filtering algorithm based on the homomorphic encryption technology is designed, which can guarantee that the calculated decryption result by machine learning is the same as the plaintext. Note that the privacy of user data can be preserved during machine learning in this algorithm. Both theoretical and experimental analyses demonstrate that the proposed scheme is secure and efficient for collaborative filtering in cloud computing in VANETs.
- [1] . 2016. Understanding spurious message forwarding in VANET beaconless dissemination protocols: An analytical approach. IEEE Transactions on Vehicular Technology 65, 4 (2016), 2243–2258.Google Scholar
- [2] . 2004. Strong conditional oblivious transfer and computing on intervals. In International Conference on the Theory and Application of Cryptology and Information Security.Google Scholar
- [3] . 2010. Improved primitives for secure multiparty integer computation. In International Conference on Security and Cryptography for Networks. Google Scholar
Digital Library
- [4] . 2007. A collaborative filtering recommendation algorithm based on influence sets. Journal of Software7 (2007), 139–148.Google Scholar
- [5] . 2018. User feature collaborative filtering algorithm integrating item factors. Computer Science and Application 8, 11 (2018), 1689–1695.Google Scholar
Cross Ref
- [6] . 2018. Bootstrapping for approximate homomorphic encryption. In Annual International Conference on the Theory and Applications of Cryptographic Techniques.Google Scholar
- [7] . 2016. MoZo: A moving zone based routing protocol using pure V2V communication in VANETs. IEEE Transactions on Mobile Computing 16, 5 (2016), 1357–1370. Google Scholar
Digital Library
- [8] . 2017. High-throughput secure three-party computation for malicious adversaries and an honest majority. In Annual International Conference on the Theory and Applications of Cryptographic Techniques.Google Scholar
- [9] . 1987. How to play any mental game. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing. Google Scholar
Digital Library
- [10] . 2015. Time aware and data sparsity tolerant web service recommendation based on improved collaborative filtering. IEEE Transactions on Services Computing 8, 5 (2015), 782–794.Google Scholar
Cross Ref
- [11] . 2010. Uncertain neighbors’ collaborative filtering recommendation algorithm. Chinese Journal of Computers 33, 8 (2010), 1369–1377.Google Scholar
Cross Ref
- [12] . 2016. Secure two-party distance computation protocol based on privacy homomorphism and scalar product in wireless sensor networks. Tsinghua Science and Technology 21, 4 (2016), 385–396.Google Scholar
Cross Ref
- [13] . 2011. A transitivity aware matrix factorization model for recommendation in social networks. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence
(IJCAI’11) . Google ScholarDigital Library
- [14] . 2018. Anonymous and traceable group data sharing in cloud computing. IEEE Transactions on Information Forensics and Security 13, 4 (2018), 912–925.Google Scholar
- [15] . 2005. An efficient solution to the millionaires’ problem based on homomorphic encryption. In International Conference on Applied Cryptography and Network Security. Google Scholar
Digital Library
- [16] . 2009. A proof of security of Yao’s protocol for two-party computation. Journal of Cryptology 22, 2 (2009), 161–188. Google Scholar
Digital Library
- [17] . 2012. Enhancing collaborative filtering by user interest expansion via personalized ranking. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 42, 1 (2012), 218–233. Google Scholar
Digital Library
- [18] . 2019. Research on parallelization of collaborative filtering algorithm based on spark. Computer Technology and Development 29, 1 (2019), 85–89.Google Scholar
- [19] . 2004. Fairplay–A secure two-party computation system. In Proceedings of the 13th Conference on USENIX Security Symposium - Volume 13
(SSYM’04) . USENIX Association, 20. Google ScholarDigital Library
- [20] . 2015. Research on social recommender systems. Journal of Software 26, 6 (2015), 1356–1372.
DOI: DOI: https://doi.org/10.13328/j.cnki.jos.004831Google Scholar - [21] . 2007. Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In Proceedings of the 10th International Conference on Practice and Theory in Public-Key Cryptography
(PKC’07) . Google ScholarDigital Library
- [22] . 2015. A threshold anonymous authentication protocol for VANETs. IEEE Transactions on Vehicular Technology 65, 3 (2015), 1–1.Google Scholar
- [23] . 2017. Content-centric group user authentication for secure social networks. IEEE Transactions on Emerging Topics in Computing 8, 3 (2017), 833–844.Google Scholar
- [24] . 2018. Block design-based key agreement for group data sharing in cloud computing. IEEE Transactions on Dependable and Secure Computing 16, 6 (2017), 996–1010.Google Scholar
- [25] . 2017. Block design-based key agreement for group data sharing in cloud computing. IEEE Transactions on Dependable and Secure Computing 16, 6 (2017), 996–1010.Google Scholar
Cross Ref
- [26] . 2018. An efficient method for autoencoder-based collaborative filtering. Concurrency and Computation Practice and Experience 31, 1 (2018), e4507.Google Scholar
- [27] . 2013. Joint social and content recommendation for user-generated videos in online social network. IEEE Transactions on Multimedia 15 (
2013), 698–709. DOI: DOI: https://doi.org/10.1109/TMM.2012.2237022 Google ScholarCross Ref
- [28] . 2017. Efficient solutions to two-party and multiparty millionaires’ problem. Security and Communication Networks 2017 (2017), 1–11.Google Scholar
- [29] . 1982. Protocols for secure computation. In 23rd Annual Symposium on Foundations of Computer Science, 1982 (SFCS’08). Google Scholar
Digital Library
- [30] . 1986. How to generate and exchange secrets. In 27th Annual Symposium on Foundations of Computer Science, 1986. Google Scholar
Digital Library
- [31] . 2015. Interest prediction in social networks based on Markov chain modeling on clustered users. Concurrency and Computation Practice and Experience 28, 14 (2015), 3895–3909.Google Scholar
Digital Library
Index Terms
A Flexible and Privacy-Preserving Collaborative Filtering Scheme in Cloud Computing for VANETs
Recommendations
Privacy-preserving Collaborative Filtering for the Cloud
CLOUDCOM '11: Proceedings of the 2011 IEEE Third International Conference on Cloud Computing Technology and ScienceRating-based collaborative filtering (CF) enables the prediction of the rating that a user will give to an item, based on the ratings of other items given by other users. However, doing this while preserving the privacy of rating data from individual ...
An algorithm for efficient privacy-preserving item-based collaborative filtering
Collaborative filtering (CF) methods are widely adopted by existing recommender systems, which can analyze and predict user "ratings" or "preferences" of newly generated items based on user historical behaviors. However, privacy issue arises in this ...
A hybrid algorithm for secure cloud computing
Cloud computing is a developing technology that is yet unclear to many security issues. Data in the untrusted clouds can be encrypted using an encryption algorithm. Randomising this data provides more security which can be achieved by padding concept in ...






Comments