IEEE Access · 2021 · 10 citations · 25 references
ComputingCloud ComputingComputer ScienceCloud InfrastructureCloud SecurityRecommender SystemsCloud Privacy ProtectionData ProtectionPrivacy-preserving ProtocolsPrivacy-preserving RecommendationRecommendation SystemsSecure Data SharingBlockchain-based Data SecurityBlockchain-based Data SharingCloud Computing ResourcesSecure RecommendationSensitive Information ProtectionUser Preference ProtectionWeb Services
With the rapid development of cloud computing, a large number of web services have been emerging quickly, which brings a heavy burden for users to choose the services they preferred. In order to suggest web services for users, recommendation algorithms are needed and many of them have been investigated recently. However, most of the existing recommendation schemes are based on centralized historical data, which may lead to single point of failure. Generally, the data contains a lot of sensitive information that cloud may expose the privacy of users, which makes most cloud platforms reluctant to share their own data. In order to solve the above issues, the secure data sharing among cloud platforms is necessary for better recommendation, which can maximize the profits. In this paper, we propose a blockchain-assisted collaborative service recommendation scheme ( <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$BC - SRDS$ </tex-math></inline-formula> ). Specifically, we adopt the ciphertext-policy attribute-based encryption (CP-ABE) algorithm to encrypt the data, which ensures the data confidentiality and realizes secure data sharing. Then, we utilize the blockchain to share data, such that the DoS attack, DDoS attack and single point of failure can be avoided. Meanwhile, the data integrity, tampering-proof of data are guaranteed through the blockchain. And we use locality-sensitive hashing algorithm to recommend the services for users. Finally, it is proved through the security analysis that <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$BC - SRDS$ </tex-math></inline-formula> is capable of achieving data confidentiality, data integrity and tampering-proof. A series of experiments show that <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$BC - SRDS$ </tex-math></inline-formula> achieves better recommendation accuracy compared with the existing schemes.
25
Ciphertext-Policy Attribute-Based Encryption
John Bethencourt, Amit Sahai, Brent Waters · 2007 · 4.9K citations · Full text
Probabilistic Matrix Factorization
Andriy Mnih, Ruslan Salakhutdinov · Neural Information Processing Systems · 2007 · 3.6K citations
Similarity Search in High Dimensions via Hashing
Aristides Gionis, Piotr Indyk, Rajeev Motwani · 1999 · 3.1K citations
Cheng-Kang Hsieh, Longqi Yang, Yin Cui et al. · 2017 · 552 citations · Full text