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
    Event2008 International Symposium on Information Theory and its Applications, ISITA2008 - Auckland
    Duration: 2008 Dec 72008 Dec 10

    Other

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

    Fingerprint

    Degradation

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    Yoshida, T., Matsushima, T., & Imai, H. (2008). A ramp scheme for key predistribution system against collusion of users and centers. In 2008 International Symposium on Information Theory and its Applications, ISITA2008 [4895469] https://doi.org/10.1109/ISITA.2008.4895469

    A ramp scheme for key predistribution system against collusion of users and centers. / Yoshida, Takahiro; Matsushima, Toshiyasu; Imai, Hideki.

    2008 International Symposium on Information Theory and its Applications, ISITA2008. 2008. 4895469.

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

    Yoshida, T, Matsushima, T & Imai, H 2008, A ramp scheme for key predistribution system against collusion of users and centers. in 2008 International Symposium on Information Theory and its Applications, ISITA2008., 4895469, 2008 International Symposium on Information Theory and its Applications, ISITA2008, Auckland, 08/12/7. https://doi.org/10.1109/ISITA.2008.4895469
    Yoshida T, Matsushima T, Imai H. A ramp scheme for key predistribution system against collusion of users and centers. In 2008 International Symposium on Information Theory and its Applications, ISITA2008. 2008. 4895469 https://doi.org/10.1109/ISITA.2008.4895469
    Yoshida, Takahiro ; Matsushima, Toshiyasu ; Imai, Hideki. / A ramp scheme for key predistribution system against collusion of users and centers. 2008 International Symposium on Information Theory and its Applications, ISITA2008. 2008.
    @inproceedings{34fcc7eaf24941f1bfa55c4d7162074c,
    title = "A ramp scheme for key predistribution system against collusion of users and centers",
    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.",
    author = "Takahiro Yoshida and Toshiyasu Matsushima and Hideki Imai",
    year = "2008",
    doi = "10.1109/ISITA.2008.4895469",
    language = "English",
    isbn = "9781424420698",
    booktitle = "2008 International Symposium on Information Theory and its Applications, ISITA2008",

    }

    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

    Y1 - 2008

    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

    SN - 9781424420698

    BT - 2008 International Symposium on Information Theory and its Applications, ISITA2008

    ER -