EFFICIENT AUTHENTICATED ID-BASED GROUP KEY AGREEMENT PROTOCOL

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

ARIFI M.; GARDESHI M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Advanced Defense Science and Technology Year:2011 | Volume:2 | Issue:2 (4) Page(s): 139-150

Download Full-Text

Persian Verion

View:

1,487

Download:

Cites:

Information Journal Paper

Title

EFFICIENT AUTHENTICATED ID-BASED GROUP KEY AGREEMENT PROTOCOL

Author(s)

ARIFI M. | GARDESHI M. | Issue Writer Certificate

Keywords

GROUP KEY AGREEMENTQ3

ID-BASED AUTHENTICATIONQ3

BILINEAR PAIRINGQ3

TREE STRUCTUREQ3

Abstract

Group key exchange protocols play main role in group applications such as computer networks, telecommunication and military systems. Given the wide range of usage of group applications, research and design of these protocols can play an important role in securing international exchanges, trade and military issues. Most existing group key exchange protocols establish multi-party or group key exchange protocols based on extending the two party well known Diffie-Hellman key exchanges. The security of these protocols is based on this assumption that difficulty of solving group Diffie-Hellman problem can be reduced to the difficulty of two party Diffie-Hellman problems. In spite of this assumption, Group key exchanges are not simply extension of two party protocols. In fact there are many differences and challenges that must be considered in design and implementation of these protocols. This difference is due to essential difference between peer to peer communication and group communication. In group communication in addition to considering the main goal e.g. obtaining group session key, consideration of group member changing is important too. In this paper, a Dynamic ID-based GROUP KEY AGREEMENT protocol based on Weil pairing is proposed. This complete ternary TREE STRUCTURE is used and dynamic changes in group are considered too. Finally we show that the proposed protocol is more efficient than other protocols with similar structure and also satisfies all known security requirements.

Cites

No record.

References

No record.

Cite

APA: Copy

ARIFI, M., & GARDESHI, M.. (2011). EFFICIENT AUTHENTICATED ID-BASED GROUP KEY AGREEMENT PROTOCOL. (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY, 2(2 (4)), 139-150. SID. https://sid.ir/paper/167271/en

Vancouver: Copy

ARIFI M., GARDESHI M.. EFFICIENT AUTHENTICATED ID-BASED GROUP KEY AGREEMENT PROTOCOL. (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY[Internet]. 2011;2(2 (4)):139-150. Available from: https://sid.ir/paper/167271/en

IEEE: Copy

M. ARIFI, and M. GARDESHI, “EFFICIENT AUTHENTICATED ID-BASED GROUP KEY AGREEMENT PROTOCOL,” (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY, vol. 2, no. 2 (4), pp. 139–150, 2011, [Online]. Available: https://sid.ir/paper/167271/en

Related Journal Papers