An ID-based non-interactive tripartite key agreement protocol with K-resilience

Raylin Tso; Tsuyoshi Takagi; Takeshi Okamoto; Eiji Okamoto

An ID-based non-interactive tripartite key agreement protocol with K-resilience

Raylin Tso, Tsuyoshi Takagi, Takeshi Okamoto, Eiji Okamoto

先進暗号数理デザイン室

研究成果: Chapter in Book/Report/Conference proceeding › Conference contribution

4 被引用数 (Scopus)

抄録

Key agreement protocols are designed so that two or more entities can establish a session key in order to communicate with confidentiality over an open network or to achieve a cryptographic goal such as data integrity. Till date, no (secure) tripartite key agreement protocol could provide authentication for entities without introducing certifications into the protocol or combining the protocol with a digital signature scheme. In addition, at least one-round of data transmission has been required for the current protocols. In this paper, we propose an ID-based tripartite key agreement protocol which is non-interactive. This scheme is secure against a collusion of a maximum of k entities. We also show how this protocol can be modified into an one-round tripartite key agreement protocol so that different session keys can be established in each run of the protocol.

本文言語	英語
ホスト出版物のタイトル	Third IASTED International Conference on Communications and Computer Networks, CCN 2005
編集者	M.Y. Sanadidi
ページ	38-42
ページ数	5
出版ステータス	出版済み - 12 1 2005
イベント	Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005 - Marina del Rey, CA, 米国継続期間: 10 24 2005 → 10 26 2005

出版物シリーズ

名前	Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005

その他

その他	Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005
Country	米国
City	Marina del Rey, CA
Period	10/24/05 → 10/26/05

All Science Journal Classification (ASJC) codes

Engineering(all)

文献へのアクセス

フィンガープリント「An ID-based non-interactive tripartite key agreement protocol with K-resilience」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル

Tso, R., Takagi, T., Okamoto, T., & Okamoto, E. (2005). An ID-based non-interactive tripartite key agreement protocol with K-resilience. In M. Y. Sanadidi (Ed.), Third IASTED International Conference on Communications and Computer Networks, CCN 2005 (pp. 38-42). (Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005).

An ID-based non-interactive tripartite key agreement protocol with K-resilience. / Tso, Raylin; Takagi, Tsuyoshi; Okamoto, Takeshi; Okamoto, Eiji.

Third IASTED International Conference on Communications and Computer Networks, CCN 2005. ed. / M.Y. Sanadidi. 2005. p. 38-42 (Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005).

研究成果: Chapter in Book/Report/Conference proceeding › Conference contribution

Tso, R, Takagi, T, Okamoto, T & Okamoto, E 2005, An ID-based non-interactive tripartite key agreement protocol with K-resilience. in MY Sanadidi (ed.), Third IASTED International Conference on Communications and Computer Networks, CCN 2005. Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005, pp. 38-42, Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005, Marina del Rey, CA, 米国, 10/24/05.

Tso, Raylin ; Takagi, Tsuyoshi ; Okamoto, Takeshi ; Okamoto, Eiji. / An ID-based non-interactive tripartite key agreement protocol with K-resilience. Third IASTED International Conference on Communications and Computer Networks, CCN 2005. editor / M.Y. Sanadidi. 2005. pp. 38-42 (Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005).

@inproceedings{ecc80ff3c9134ceba5de4b5c56d6379e,

title = "An ID-based non-interactive tripartite key agreement protocol with K-resilience",

abstract = "Key agreement protocols are designed so that two or more entities can establish a session key in order to communicate with confidentiality over an open network or to achieve a cryptographic goal such as data integrity. Till date, no (secure) tripartite key agreement protocol could provide authentication for entities without introducing certifications into the protocol or combining the protocol with a digital signature scheme. In addition, at least one-round of data transmission has been required for the current protocols. In this paper, we propose an ID-based tripartite key agreement protocol which is non-interactive. This scheme is secure against a collusion of a maximum of k entities. We also show how this protocol can be modified into an one-round tripartite key agreement protocol so that different session keys can be established in each run of the protocol.",

author = "Raylin Tso and Tsuyoshi Takagi and Takeshi Okamoto and Eiji Okamoto",

year = "2005",

month = dec,

day = "1",

language = "English",

isbn = "0889865469",

series = "Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005",

pages = "38--42",

editor = "M.Y. Sanadidi",

booktitle = "Third IASTED International Conference on Communications and Computer Networks, CCN 2005",

note = "Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005 ; Conference date: 24-10-2005 Through 26-10-2005",

}

TY - GEN

T1 - An ID-based non-interactive tripartite key agreement protocol with K-resilience

AU - Tso, Raylin

AU - Takagi, Tsuyoshi

AU - Okamoto, Takeshi

AU - Okamoto, Eiji

PY - 2005/12/1

Y1 - 2005/12/1

N2 - Key agreement protocols are designed so that two or more entities can establish a session key in order to communicate with confidentiality over an open network or to achieve a cryptographic goal such as data integrity. Till date, no (secure) tripartite key agreement protocol could provide authentication for entities without introducing certifications into the protocol or combining the protocol with a digital signature scheme. In addition, at least one-round of data transmission has been required for the current protocols. In this paper, we propose an ID-based tripartite key agreement protocol which is non-interactive. This scheme is secure against a collusion of a maximum of k entities. We also show how this protocol can be modified into an one-round tripartite key agreement protocol so that different session keys can be established in each run of the protocol.

AB - Key agreement protocols are designed so that two or more entities can establish a session key in order to communicate with confidentiality over an open network or to achieve a cryptographic goal such as data integrity. Till date, no (secure) tripartite key agreement protocol could provide authentication for entities without introducing certifications into the protocol or combining the protocol with a digital signature scheme. In addition, at least one-round of data transmission has been required for the current protocols. In this paper, we propose an ID-based tripartite key agreement protocol which is non-interactive. This scheme is secure against a collusion of a maximum of k entities. We also show how this protocol can be modified into an one-round tripartite key agreement protocol so that different session keys can be established in each run of the protocol.

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

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

M3 - Conference contribution

AN - SCOPUS:33244464726

SN - 0889865469

T3 - Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005

SP - 38

EP - 42

BT - Third IASTED International Conference on Communications and Computer Networks, CCN 2005

A2 - Sanadidi, M.Y.

T2 - Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005

Y2 - 24 October 2005 through 26 October 2005

ER -