Preserving data privacy in social recommendation
Social recommendation is a method which requires the participants of both user’s historical behavior data and social network,which generally belong to different parties,such as recommendation system service provider and social network service provider.Considering the fact that in order to maintain t...
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2015-12-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015322/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539588167827456 |
|---|---|
| author | Shu-shu LIU An LIU Lei ZHAO Guan-feng LIU Zhi-xu LI Kai ZHENG Xiao-fang ZHOU |
| author_facet | Shu-shu LIU An LIU Lei ZHAO Guan-feng LIU Zhi-xu LI Kai ZHENG Xiao-fang ZHOU |
| author_sort | Shu-shu LIU |
| collection | DOAJ |
| description | Social recommendation is a method which requires the participants of both user’s historical behavior data and social network,which generally belong to different parties,such as recommendation system service provider and social network service provider.Considering the fact that in order to maintain the value of their own data interests and user’s privacy,none of them will provide data information to the other,two privacy preserving protocols are proposed for efficient computation of social recommendation which needs the cooperation of two parties (recommendation system service provider and social network service provider).Both protocols enable two parties to compute the social recommendation without revealing their private data to each other.The protocol based on the well-known oblivious transfer multiplication has a low cost,and is suitable for the application of high efficiency requirements.And the one based on homomorphic cryptosystem has a better privacy preserving,and is more suitable for the application of higher data privacy requirements.Experimental results on the four real datasets show those two protocols are efficient and practical.Users are suggested to choose the appropriate protocol according to their own need. |
| format | Article |
| id | doaj-art-7d193d1eb3984f5d8ab53f024762e31f |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2015-12-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-7d193d1eb3984f5d8ab53f024762e31f2025-01-14T06:54:10ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2015-12-013613113859697174Preserving data privacy in social recommendationShu-shu LIUAn LIULei ZHAOGuan-feng LIUZhi-xu LIKai ZHENGXiao-fang ZHOUSocial recommendation is a method which requires the participants of both user’s historical behavior data and social network,which generally belong to different parties,such as recommendation system service provider and social network service provider.Considering the fact that in order to maintain the value of their own data interests and user’s privacy,none of them will provide data information to the other,two privacy preserving protocols are proposed for efficient computation of social recommendation which needs the cooperation of two parties (recommendation system service provider and social network service provider).Both protocols enable two parties to compute the social recommendation without revealing their private data to each other.The protocol based on the well-known oblivious transfer multiplication has a low cost,and is suitable for the application of high efficiency requirements.And the one based on homomorphic cryptosystem has a better privacy preserving,and is more suitable for the application of higher data privacy requirements.Experimental results on the four real datasets show those two protocols are efficient and practical.Users are suggested to choose the appropriate protocol according to their own need.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015322/recommendation systemoblivious transferhomomorphic encryptionYao’s protocol |
| spellingShingle | Shu-shu LIU An LIU Lei ZHAO Guan-feng LIU Zhi-xu LI Kai ZHENG Xiao-fang ZHOU Preserving data privacy in social recommendation Tongxin xuebao recommendation system oblivious transfer homomorphic encryption Yao’s protocol |
| title | Preserving data privacy in social recommendation |
| title_full | Preserving data privacy in social recommendation |
| title_fullStr | Preserving data privacy in social recommendation |
| title_full_unstemmed | Preserving data privacy in social recommendation |
| title_short | Preserving data privacy in social recommendation |
| title_sort | preserving data privacy in social recommendation |
| topic | recommendation system oblivious transfer homomorphic encryption Yao’s protocol |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015322/ |
| work_keys_str_mv | AT shushuliu preservingdataprivacyinsocialrecommendation AT anliu preservingdataprivacyinsocialrecommendation AT leizhao preservingdataprivacyinsocialrecommendation AT guanfengliu preservingdataprivacyinsocialrecommendation AT zhixuli preservingdataprivacyinsocialrecommendation AT kaizheng preservingdataprivacyinsocialrecommendation AT xiaofangzhou preservingdataprivacyinsocialrecommendation |