TY - GEN
T1 - A ramp scheme for key predistribution system against collusion of users and centers
AU - Yoshida, Takahiro
AU - Matsushima, Toshiyasu
AU - Imai, Hideki
PY - 2008/12/1
Y1 - 2008/12/1
N2 - In this paper, we consider a ramp scheme for Key Predistribution System (KPS). In the ramp scheme, it can be regarded as one kind of generalization of KPS, and the required resources can be reduced at the cost of a security degradation which depends on the size of users. We define a ramp scheme for KPS, show lower bound on the amount of user's information needed to generate a common key, and design a protocol that realize a ramp scheme for KPS.
AB - In this paper, we consider a ramp scheme for Key Predistribution System (KPS). In the ramp scheme, it can be regarded as one kind of generalization of KPS, and the required resources can be reduced at the cost of a security degradation which depends on the size of users. We define a ramp scheme for KPS, show lower bound on the amount of user's information needed to generate a common key, and design a protocol that realize a ramp scheme for KPS.
UR - http://www.scopus.com/inward/record.url?scp=77951143829&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77951143829&partnerID=8YFLogxK
U2 - 10.1109/ISITA.2008.4895469
DO - 10.1109/ISITA.2008.4895469
M3 - Conference contribution
AN - SCOPUS:77951143829
SN - 9781424420698
T3 - 2008 International Symposium on Information Theory and its Applications, ISITA2008
BT - 2008 International Symposium on Information Theory and its Applications, ISITA2008
T2 - 2008 International Symposium on Information Theory and its Applications, ISITA2008
Y2 - 7 December 2008 through 10 December 2008
ER -