A ramp scheme for key predistribution system against collusion of users and centers

Takahiro Yoshida, Toshiyasu Matsushima, Hideki Imai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publication2008 International Symposium on Information Theory and its Applications, ISITA2008
DOIs
Publication statusPublished - 2008 Dec 1
Event2008 International Symposium on Information Theory and its Applications, ISITA2008 - Auckland, New Zealand
Duration: 2008 Dec 72008 Dec 10

Publication series

Name2008 International Symposium on Information Theory and its Applications, ISITA2008

Conference

Conference2008 International Symposium on Information Theory and its Applications, ISITA2008
CountryNew Zealand
CityAuckland
Period08/12/708/12/10

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'A ramp scheme for key predistribution system against collusion of users and centers'. Together they form a unique fingerprint.

Cite this