当前位置: X-MOL 学术Concurr. Comput. Pract. Exp. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Privacy preservation auction in a dynamic social network
Concurrency and Computation: Practice and Experience ( IF 2 ) Pub Date : 2020-10-18 , DOI: 10.1002/cpe.6058
Xiangyu Hu 1 , Zhiping Jin 2 , Lefeng Zhang 1 , Andi Zhou 1 , Dayong Ye 1
Affiliation  

The growing popularity of users in online social network gives a big opportunity for online auction. The famous Information Diffusion Mechanism (IDM) is an excellent methods even meet the incentive compatibility and individual rationality. Although the existing auction in online social network has considered the buyers' information has not known by the seller, current mechanism still cannot preserve the information such as prices. In this paper, we propose a novel mechanism which modeled the auction process in online social network and preserved users' privacy by using differential privacy mechanism. Our mechanism can successfully process the auction and at the same time preserve clients' price information from neighbors. We achieved these by adding Laplace noise for its valuation and the number of valuation seller received in the auction process. We also formulate this mechanism on the real network to show the feasibility and effective of the proposed mechanism.

中文翻译:

动态社交网络中的隐私保护拍卖

在线社交网络用户的日益普及为在线拍卖提供了巨大的机会。著名的信息扩散机制(IDM) 是一种很好的方法,甚至可以满足激励相容性和个体理性。虽然现有的在线社交网络拍卖已经考虑到买家信息不为卖家所知,但现有机制仍无法保存价格等信息。在本文中,我们提出了一种新颖的机制,该机制对在线社交网络中的拍卖过程进行了建模,并通过使用差分隐私机制来保护用户的隐私。我们的机制可以成功处理拍卖,同时保留邻居的客户价格信息。我们通过为其估值和拍卖过程中收到的估值卖家数量添加拉普拉斯噪声来实现这些。我们还在真实网络上制定了这种机制,以展示所提出机制的可行性和有效性。
更新日期:2020-10-18
down
wechat
bug