Yuefei Zhu

Zhengzhou Information Science and Technology Institute, Cheng, Henan Sheng, China

Are you Yuefei Zhu?

Claim your profile

Publications (22)6.45 Total impact

  • Shuhua Wu, Kefei Chen, Qiong Pu, Yuefei Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: SUMMARY In this paper, we first showed that Lou and Huang's three-party password-based key exchange protocol is still vulnerable to offline dictionary attacks. Thereafter, we proposed an enhanced protocol that can defeat the attack described and yet is efficient. Finally, we provided the rigorous proof of the security for it. Copyright © 2011 John Wiley & Sons, Ltd.
    International Journal of Communication Systems 05/2013; 26(5). · 1.11 Impact Factor
  • Shuhua Wu, Yuefei Zhu, Qiong Pu
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we mainly investigate anonymous user authentication scheme using smart card. We first demonstrate security weaknesses still exist in two such schemes recently propose by Wang et al. and Tsai et al., respectively according to Wang et al.'s criteria. Thereafter, we propose an enhanced smart-card-based authentication scheme with user anonymity for providing all the admired requirements at the same time. Compared with the previous schemes, our scheme is yet efficient both in computation and communication cost. Moreover, we can prove the security of the proposed scheme in the random oracle model. Copyright © 2011 John Wiley & Sons, Ltd.
    Security and Communication Networks 02/2012; 5:236-248. · 0.43 Impact Factor
  • Shuhua Wu, Kefei Chen, Yuefei Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: Quite recently, Yu et al. presented a real lightweight binding proof protocol to guard patient safety and prevent medication errors. In this paper, we first show their protocol is still vulnerable to impersonation attacks. Thereafter we propose a new lightweight binding proof protocol to overcome these weaknesses and securely achieve the goal of proving that two tags exist in the field simultaneously.
    Journal of Medical Systems 08/2011; 36(5):2743-9. · 1.78 Impact Factor
  • Source
    Shuhua Wu, Yuefei Zhu, Qiong Pu
    [Show abstract] [Hide abstract]
    ABSTRACT: Quite recently, Yang et al. presented an efficient three-party authenticated key exchange protocol based upon elliptic curve cryptography (ECC) for mobile-commerce environments. In this paper, we demonstrate that Yang et al.’s three-party authenticated protocol is potentially vulnerable to an unknown key-share attack and impersonation attack. Thereafter, we suggest a secure and efficient three-party authenticated key exchange protocol for mobile-commerce environments. Our improved protocol has the following advantages over Yang et al.’s protocol: (1) our scheme combines two factors to strengthen its authentication mechanism; (2) our scheme simply utilizes each user’s unique identity to accomplish authentication, eliminating maintenance of a lot of users’ keys; (3) our scheme carries the rigorous proof of the security. Furthermore, our scheme is more efficient than Yang et al.’s scheme. Therefore, the end result is more suited to be a candidate for implementation in mobile-commerce environments.
    Journal of Information Science and Engineering 01/2011; 27:1329-1343. · 0.30 Impact Factor
  • Shuhua Wu, Yuefei Zhu
    Int. Arab J. Inf. Technol. 01/2011; 8:430-439.
  • Shuhua Wu, Yuefei Zhu, Qiong Pu
    [Show abstract] [Hide abstract]
    ABSTRACT: Recently, two authentication schemes with anonymity for roaming service in wireless networks were proposed by He et al. and Xu et al. In this paper we point out that neither of the two schemes is sufficiently practical owing to the high computational cost involved. Furthermore, we also find that both schemes still have some weaknesses which allow the attacker to trace a certain user's behaviors and thus infer his real identity. Thereafter, we propose a novel lightweight authentication scheme with anonymity for roaming service in global mobility networks to overcome the aforementioned defects. Moreover, we formally analyze our proposed scheme with BAN-logic and show that it can withstand several possible attacks. Copyright © 2010 John Wiley & Sons, Ltd.
    International Journal of Network Management 01/2011; 21:384-401. · 0.51 Impact Factor
  • Shuhua Wu, Yuefei Zhu, Qiong Pu
    [Show abstract] [Hide abstract]
    ABSTRACT: To broadcast a message secretly and consistently to the receivers in the broadcasting networks, Jeong et al. suggested an efficient secret broadcast scheme using binding encryption quite recently. In this letter, we first show that their scheme just achieves consistency in a relatively weak security model but not in a stronger model. Furthermore, we point out their scheme is not so efficient even when their model is accepted. Thereafter, we suggest a simple and more efficient scheme, which can be proved in their model without using random oracles.
    IEEE Communications Letters 01/2010; 14:685-687. · 1.16 Impact Factor
  • Shuhua Wu, Yuefei Zhu, Qiong Pu
    [Show abstract] [Hide abstract]
    ABSTRACT: To overcome the congenital defects of the UMTS's Authentication and Key Agreement (AKA) protocol standard, Ou et al. proposed an improved protocol called the cocktail-AKA protocol recently. In this paper, we first show that it has some security weaknesses, which can be exploited by an adversary to mount a denial of service attack and an impersonation attack. Finally, an effective countermeasure is suggested.
    IEEE Communications Letters 01/2010; 14:366-368. · 1.16 Impact Factor
  • Shuhua Wu, Yuefei Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents an efficient solution to the group key exchange problem in the password-based scenario. Our scheme can combine existing group protocols to get a hybrid group key exchange protocol which is efficient in terms of both computation and communication when the number of group users is very large. Our solution allows users to securely join and leave the group at any time—the so-called dynamic case. Moreover, we prove its security in the random oracle model.
    Advances in Data and Web Management, Joint International Conferences, APWeb/WAIM 2009, Suzhou, China, April 2-4, 2009, Proceedings; 01/2009
  • Shuhua Wu, Yuefei Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: We first introduce the new notion of the so-called target-independent smooth projective hashing (TISPHash) based on computationally-hiding commitments. Based on it and a class of pseudo-random functions (PRFs), we propose a framework for (PKI-based) authenticated key exchange protocols without random oracles and prove it to be secure in the (currently) strongest security definition, the extended Canetti-Krawczyk security definition. Our protocol is actually an abstraction of the efficient key exchange protocol of T. Okamoto. The abstracted protocol enjoys efficient instantiations from any secure encryption scheme that admits an efficient construction of TISPHash and allows a simple and intuitive understanding of its security. In some sense, our construction generalizes the design of T. Okamoto.
    Information Security Practice and Experience, 5th International Conference, ISPEC 2009, Xi'an, China, April 13-15, 2009, Proceedings; 01/2009
  • Shuhua Wu, Yuefei Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: Key establishment protocols are used for distributing shared keying material in a secure manner. In 1995, Bellare and Rogaway presented a three-party server-based key distribution (3PKD) protocol. But the protocol was recently found insecure and then was fixed by Choo et al. (2005b). But forward-secrecy is not considered in the revised protocol. In this paper, we demonstrate that it is not forward secure indeed. We then revise the protocol to be a password-based authenticated key distribution in the three-party setting and prove our protocol is forward secure in the random-oracle and ideal-cipher models under the password-based chosen-basis gap Diffie-Hellman assumption. Our protocol is quite simple and elegant, and rather efficient when compared to previous solutions.
    International Journal of Communication Networks and Distributed Systems 01/2009; 3(4).
  • Source
    Tingjun Liu, Shuhua Wu, Yuefei Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: A password-based authenticated key exchange (PAKE) protocol in the three-party setting allows two clients com- municating over a public network to agree on a common session key with the help of a server. In the setting the users do not share a password between themselves, but only with the server. In this paper, we propose a new efficient password-based authenticated three-party key ex- change protocol and provide a rigorous conclusion of for- ward security for it in both the random-oracle and the ideal- cipher models under the gap Diffie-Hellman intractability assumption. It is a significant advantage that our proto- col is proved secure in a model that allows the adversary to make adaptive corrupt queries, in contrast to previous solutions.
    Computational Intelligence and Security, 2007 International Conference on; 01/2008
  • Shuhua Wu, Yuefei Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: With the advancement of wireless technology and the increasing demand for mobile devices, secure and efficient password authenticated key establishment technologies are needed for various kinds of secure communications among wireless devices. In this paper, we propose a simple and elegant password-based authenticated key establishment protocol for wireless group communications in an ad-hoc mode. The protocol allows users to securely join and leave the wireless group at time, accommodates either a single-shared password or pairwise-shared passwords among the group members or at least with a central server. Our protocol is rather efficient, especially when compared to the previous solutions in the literature. Furthermore, we can prove its security under the assumptions that the hash function closely behaves like a random oracle and that the computational Diffie-Hellman problem is difficult and that the underlying encryptions are indistinguishable under chosen-plain-text attack.
    International Journal of Communication Networks and Distributed Systems 01/2008; 1.
  • Shuhua Wu, Yuefei Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: The area of password-based authenticated key exchange protocols has been the subject of a vast amount of work in the last few years due to its practical aspects. AuthA is an example of such a technology considered for standardization by the IEEE P1363.2 working group. Unfortunately in its current form AuthA, including some variants, only considered the classic client and server (2-party) scenarios. In this paper, based on a variant of AuthA, we consider a quite different paradigm from the existing ones and propose a provably secure password-authenticated key exchange protocol in a cross-realm setting where two clients in different realms obtain a secret session key as well as mutual authentication, with the help of respective servers. In our protocol, any honest server is unable to gain any information on the value of that session key. Moreover, our protocol is reasonably efficient and has a per-user computational cost that is comparable to that of the underlying 2-party encrypted key exchange.
    Network and Parallel Computing, IFIP International Conference, NPC 2008, Shanghai, China, October 18-20, 2008. Proceedings; 01/2008
  • Shuhua Wu, Yuefei Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: Key establishment protocols are used for distributing shared keying material in a secure manner. In 1995, Bellare and Rogaway presented a three-party server-based key distribution (3PKD) protocol. But the protocol was recently found insecure and then was fixed by Raymond Choo et al.. But forward-secrecy is not considered in the revised protocol. In this paper, we demonstrate that it is not forward secure indeed. We then revise the protocol to be a password-based authenticated key distribution in the three-party setting and prove our protocol is forward secure in the random-oracle and ideal-cipher models under the Password-based Chosen-basis Gap Diffie-Hellman assumption. Our protocol is quite simple and elegant, and rather efficient when compared to previous solutions.
    Network and Parallel Computing, IFIP International Conference, NPC 2008, Shanghai, China, October 18-20, 2008. Proceedings; 01/2008
  • Shuhua Wu, Yuefei Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we extend the work of Abdalla et al. to take into account the notion of dynamicity in the membership and present an improved compiler that transforms any provably secure password-based authenticated 2-party key exchange into a more attractive password-based authenticated group key exchange. The resulting protocol is a provably secure and efficient dynamic password-based authenticated group key exchange protocol in a constant number of rounds. To the best of our knowledge, our proposal is the first solution to design constant-round password-based authenticated group key exchange protocols for dynamic groups. Furthermore, its security result does not assume the Random Oracle model or the ideal cipher model.
    Financial Cryptography and Data Security, 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008, Revised Selected Papers; 01/2008
  • Shuhua Wu, Yuefei Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: Due to the low entropy of human-memorable passwords, it is not easy to conduct password authenticated key agreement in a secure manner Though there are many protocols achieving this goal, they may require a large amount of computation especially in the augmented model which is contrived to resist server compromise. In this paper, we propose a new practical password authenticated key exchange protocol that is efficient and generic in the augmented model. Our scheme is considered from the practical perspective (in terms of efficiency) and is provably secure under the Diffie-Hellman intractability assumptions in the random-oracle model
    Computational Intelligence and Security, 2006 International Conference on; 12/2006
  • Shuhua Wu, Yuefei Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a resource efficient hardware implementation of both commonly used public key cryptosystems, RSA and elliptic curve cryptosystem (ECC) on the same platform. It can be used in constrained environments, which contain limited amounts of resources and are battery-powered. Furthermore, our implementation is based on a new architecture whose complexity of resources but memory does not grow much with the security level of cryptosystems unlike those based on systolic arrays. Besides, an efficient method, called the decomposition and composition of a finite state machine, is adopted in this paper to design the controllers of the accelerator
    Communications, Circuits and Systems Proceedings, 2006 International Conference on; 07/2006
  • Source
    Shuhua Wu, Yuefei Zhu, Qiong Pu
    [Show abstract] [Hide abstract]
    ABSTRACT: RSA is a strong public-key cryptosystem, which is generally used for authentication protocols. In this paper, we propose a resource efficient design for RSA based on a new architecture whose complexity in resource but memory grows little with the security level of RSA. Furthermore, we optimize the Montgomery modular multiplication algorithm in high-radix by avoiding the final comparison and implement some effective countermeasures against side channel attacks in our design. Our implementation trades off time and area requirements and improves the timetimesarea factor when compared that of Blum's and Nedhah's
    Interdisciplinary and Multidisciplinary Research in Computer Science, IEEE CS Proceeding of the First International Multi-Symposium of Computer and Computational Sciences (IMSCCS|06), June 20-24, 2006, Zhejiang University, Hangzhou, China, Vol. 2; 01/2006
  • Shuhua Wu, Yuefei Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: Due to the low entropy of human-memorable passwords, it is not easy to conduct password authenticated key agreement in a secure manner. Though there are many protocols achieving this goal, they may require a large amount of computation especially in the augmented model which is contrived to resist server compromise. In this paper, we propose a simple and efficient password authenticated key exchange protocol, which is in the augmented model. It is considered much more from the practical perspective. Moreover, the scheme is provably forward secure under the Diffie-Hellman intractability assumptions in the random-oracle model.
    Computational Intelligence and Security, International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers; 01/2006