• 沒有找到結果。

An Improved Deniable Authentication Protocol

N/A
N/A
Protected

Academic year: 2022

Share "An Improved Deniable Authentication Protocol"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

題名: An Improved Deniable Authentication Protocol 作者: Lin, C. C.;Chang, C. C.

關鍵詞: deniable authentication;ElGamal cryptography;forgery attack;PIM attack;impersonate attack

日期: 2006-11

上傳時間: 2009-12-17T06:58:14Z 出版者: Asia University

摘要: Deniable authentication, which was introduced to realize secure online negotiation, has been an extensive topic of research. Wang et al. proposed an efficient deniable authentication protocol based on ElGamal

cryptography. However, in this article, we show that Wang et al.'s protocol (WLT protocol) is vulnerable to the person-in-the-middle (PIM) attack. An adversary who launches a PIM attack can impersonate a valid user to communicate with the verifier, which will eventually lead to the failure of an online negotiation. To mitigate this security breach, we propose an

improved deniable authentication protocol based on Wang et al.'s scheme.

Further, a detailed security analysis is conducted to verify the proposed scheme.

參考文獻

相關文件

z The caller sent signaling information over TCP to an online Skype node which forwarded it to callee over TCP. z The online node also routed voice packets from caller to callee

The PE curriculum contributes greatly to enabling our students to lead a healthy lifestyle with an interest and active participation in physical and aesthetic

Reading Task 6: Genre Structure and Language Features. • Now let’s look at how language features (e.g. sentence patterns) are connected to the structure

For the proposed algorithm, we establish a global convergence estimate in terms of the objective value, and moreover present a dual application to the standard SCLP, which leads to

We can therefore hope that the exact solution of a lower-dimensional string will provide ideas which could be used to make an exact definition of critical string theory and give

According to the Heisenberg uncertainty principle, if the observed region has size L, an estimate of an individual Fourier mode with wavevector q will be a weighted average of

If we want to test the strong connectivity of a digraph, our randomized algorithm for testing digraphs with an H-free k-induced subgraph can help us determine which tester should

 Local, RADIUS, LDAP authentication presents user with a login page.  On successful authentication the user is redirected to