Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication

Masahito Hayashi, Takeshi Koshiba

    研究成果: Conference contribution

    1 引用 (Scopus)

    抄録

    For conventional secret sharing, if cheaters can submit possibly forged shares after observing shares of the honest users in the reconstruction phase, they can disturb the protocol and only they can reconstruct the true secret. To overcome the problem, secret sharing scheme with properties of cheater-identification have been proposed. Existing protocols for cheater-identifiable secret sharing assumed non-rushing cheaters or honest majority. In this paper, using message authentication, we remove both conditions simultaneously, and give its universal construction from any secret sharing scheme. To resolve this end, we explicitly propose the concepts of 'individual identification' and 'agreed identification'. For both settings, we provide protocols for cheater-identifiable secret sharing. In our protocols, the security parameter can be set independently of the share size and the underlying finite field size.

    元の言語English
    ホスト出版物のタイトル2018 IEEE International Symposium on Information Theory, ISIT 2018
    出版者Institute of Electrical and Electronics Engineers Inc.
    ページ2614-2618
    ページ数5
    2018-June
    ISBN(印刷物)9781538647806
    DOI
    出版物ステータスPublished - 2018 8 15
    イベント2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States
    継続期間: 2018 6 172018 6 22

    Other

    Other2018 IEEE International Symposium on Information Theory, ISIT 2018
    United States
    Vail
    期間18/6/1718/6/22

    Fingerprint

    Message Authentication
    Secret Sharing
    Authentication
    Secret Sharing Scheme
    Galois field
    Resolve

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Information Systems
    • Modelling and Simulation
    • Applied Mathematics

    これを引用

    Hayashi, M., & Koshiba, T. (2018). Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication. : 2018 IEEE International Symposium on Information Theory, ISIT 2018 (巻 2018-June, pp. 2614-2618). [8437751] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2018.8437751

    Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication. / Hayashi, Masahito; Koshiba, Takeshi.

    2018 IEEE International Symposium on Information Theory, ISIT 2018. 巻 2018-June Institute of Electrical and Electronics Engineers Inc., 2018. p. 2614-2618 8437751.

    研究成果: Conference contribution

    Hayashi, M & Koshiba, T 2018, Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication. : 2018 IEEE International Symposium on Information Theory, ISIT 2018. 巻. 2018-June, 8437751, Institute of Electrical and Electronics Engineers Inc., pp. 2614-2618, 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 18/6/17. https://doi.org/10.1109/ISIT.2018.8437751
    Hayashi M, Koshiba T. Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication. : 2018 IEEE International Symposium on Information Theory, ISIT 2018. 巻 2018-June. Institute of Electrical and Electronics Engineers Inc. 2018. p. 2614-2618. 8437751 https://doi.org/10.1109/ISIT.2018.8437751
    Hayashi, Masahito ; Koshiba, Takeshi. / Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication. 2018 IEEE International Symposium on Information Theory, ISIT 2018. 巻 2018-June Institute of Electrical and Electronics Engineers Inc., 2018. pp. 2614-2618
    @inproceedings{3cd1858be2e1463e9a5a782835a4dafa,
    title = "Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication",
    abstract = "For conventional secret sharing, if cheaters can submit possibly forged shares after observing shares of the honest users in the reconstruction phase, they can disturb the protocol and only they can reconstruct the true secret. To overcome the problem, secret sharing scheme with properties of cheater-identification have been proposed. Existing protocols for cheater-identifiable secret sharing assumed non-rushing cheaters or honest majority. In this paper, using message authentication, we remove both conditions simultaneously, and give its universal construction from any secret sharing scheme. To resolve this end, we explicitly propose the concepts of 'individual identification' and 'agreed identification'. For both settings, we provide protocols for cheater-identifiable secret sharing. In our protocols, the security parameter can be set independently of the share size and the underlying finite field size.",
    keywords = "Cheater-identification, Message authentication, Rushing cheater, Secret sharing, Universal construction, Without honest majority",
    author = "Masahito Hayashi and Takeshi Koshiba",
    year = "2018",
    month = "8",
    day = "15",
    doi = "10.1109/ISIT.2018.8437751",
    language = "English",
    isbn = "9781538647806",
    volume = "2018-June",
    pages = "2614--2618",
    booktitle = "2018 IEEE International Symposium on Information Theory, ISIT 2018",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",

    }

    TY - GEN

    T1 - Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication

    AU - Hayashi, Masahito

    AU - Koshiba, Takeshi

    PY - 2018/8/15

    Y1 - 2018/8/15

    N2 - For conventional secret sharing, if cheaters can submit possibly forged shares after observing shares of the honest users in the reconstruction phase, they can disturb the protocol and only they can reconstruct the true secret. To overcome the problem, secret sharing scheme with properties of cheater-identification have been proposed. Existing protocols for cheater-identifiable secret sharing assumed non-rushing cheaters or honest majority. In this paper, using message authentication, we remove both conditions simultaneously, and give its universal construction from any secret sharing scheme. To resolve this end, we explicitly propose the concepts of 'individual identification' and 'agreed identification'. For both settings, we provide protocols for cheater-identifiable secret sharing. In our protocols, the security parameter can be set independently of the share size and the underlying finite field size.

    AB - For conventional secret sharing, if cheaters can submit possibly forged shares after observing shares of the honest users in the reconstruction phase, they can disturb the protocol and only they can reconstruct the true secret. To overcome the problem, secret sharing scheme with properties of cheater-identification have been proposed. Existing protocols for cheater-identifiable secret sharing assumed non-rushing cheaters or honest majority. In this paper, using message authentication, we remove both conditions simultaneously, and give its universal construction from any secret sharing scheme. To resolve this end, we explicitly propose the concepts of 'individual identification' and 'agreed identification'. For both settings, we provide protocols for cheater-identifiable secret sharing. In our protocols, the security parameter can be set independently of the share size and the underlying finite field size.

    KW - Cheater-identification

    KW - Message authentication

    KW - Rushing cheater

    KW - Secret sharing

    KW - Universal construction

    KW - Without honest majority

    UR - http://www.scopus.com/inward/record.url?scp=85052486618&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85052486618&partnerID=8YFLogxK

    U2 - 10.1109/ISIT.2018.8437751

    DO - 10.1109/ISIT.2018.8437751

    M3 - Conference contribution

    AN - SCOPUS:85052486618

    SN - 9781538647806

    VL - 2018-June

    SP - 2614

    EP - 2618

    BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -