| Summary: | 碩士 === 國立臺灣科技大學 === 管理研究所資訊管理學程 === 87 === The conventional end-to-end communication protocol requires interactions and complete time to authenticate n entities'' identities and exchange a conference key. Now we use a recursive algorithm and the architecture of the binary tree to propose a secure and efficient protocol for the group-oriented authentication with key exchange. This protocol is through an authentication server (AS) to achieve the above goal within interactions and complete time. In a word, the proposed scheme has the flowing characteristics:
1. Mutual authentication and key exchange have been integrated.
2. The complete time, the rounds of message transmission and the size of message transmission are cut down by using the recursive algorithm and the binary tree.
3. To avoid the exponent operation with higher complexity, we use more efficient operations, i.e., one-way hash function and XOR, to achieve the authentication with key exchange.
4. The load of the system have been amortized.
|
|---|
