AN IMPROVED (k,m) - DOT1n SCHEME FOR ARBITRARY K

摘要：

In (k,m) -DOT1n scheme, the senders privacy can not be guaranteed,even if the protocol itself is security,if we can not ensure that a receiver gets information from at most k servers.In Naor and Pinkass scheme, they give two solutions that are applicable for the case k >m/2,in Nikov et al.s scheme, they avoid this problem by means of implementing a m-out-of-m access structure.In this paper,we put forward a settlement for arbitrary k, in which the receiver only can choose k servers to interactive and solve the problem getting the desired security.

关键词： Distributed Oblivious Transfer Polynomial Interpolation Privacy Preserving

作者: Juan Xie Yanqin Zhu Xizhao Luo

作者单位: School of Computer Science and Technology,Soochow University Suzhou 215006,P.R.China School of Computer Science and Technology,Soochow University Suzhou 215006,P.R.China;Jiangsu Provinc

会议类型: 国际会议

会议名称: 2009 International Symposium on Computer Science and Technology(2009 中国宁波国际计算机科学与技术学术大会)

会议地点: 宁波

会议语种:英文

页码: 139-142

在线出版日期: 2009-11-20（万方平台首次上网日期，不代表论文的发表时间）