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

摘要

In (k,m) -DOT1n scheme, the sender's 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 Pinkas's 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.