Shuhua Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Shuhua Wu has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
Yuefei Zhu
Information Engineering University Zhengzhou China
6 shared publicationsKefei Chen
Department of Computer Science and Engineering Shanghai Jiao Tong University China
3 shared publicationsQiong Pu
State Key Laboratory of Information Security Graduate University of Chinese Academy of Sciences Beijing China
3 shared publications
Latest Publications
- 9 January 2012
- Published by Wiley in International Journal of Communication Systems
- Vol. 26 (5) , 674-686
Cryptanalysis and enhancements of efficient three‐party password‐based key exchange scheme
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.
- 9 January 2012
- Published by Wiley in International Journal of Communication Systems
- Vol. 26 (5) , 674-686
Cryptanalysis and enhancements of efficient three‐party password‐based key exchange scheme
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.
- 27 August 2011
- Published by Springer Nature in Journal of Medical Systems
- Vol. 36 (5) , 2743-2749
A Secure Lightweight RFID Binding Proof Protocol for Medication Errors and Patient Safety
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.
- 27 August 2011
- Published by Springer Nature in Journal of Medical Systems
- Vol. 36 (5) , 2743-2749
A Secure Lightweight RFID Binding Proof Protocol for Medication Errors and Patient Safety
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.
- 28 April 2011
- Published by Springer Nature in Journal of Medical Systems
- Vol. 36 (4) , 2325-2337
An Efficient Key-Management Scheme for Hierarchical Access Control in E-Medicine System
In e-medicine system, the sharing of patients’ medical histories scattered among medical institutions through the Internet is highly desirable. The most immediate cryptographic need certainly is an efficient key management method to solve dynamic access problems in a user hierarchy. In this paper, we propose a practical solution for dynamic access problem in a user hierarchy based on hybrid cryptosystems. When compared with Nikooghadam et al.’s scheme proposed most recently, the time complexity and the required storage space is reduced significantly. Moreover, it provides provable security, and is easy to implement. Therefore, our scheme is more suitable for e-medicine system.
- 28 April 2011
- Published by Springer Nature in Journal of Medical Systems
- Vol. 36 (4) , 2325-2337
An Efficient Key-Management Scheme for Hierarchical Access Control in E-Medicine System
In e-medicine system, the sharing of patients’ medical histories scattered among medical institutions through the Internet is highly desirable. The most immediate cryptographic need certainly is an efficient key management method to solve dynamic access problems in a user hierarchy. In this paper, we propose a practical solution for dynamic access problem in a user hierarchy based on hybrid cryptosystems. When compared with Nikooghadam et al.’s scheme proposed most recently, the time complexity and the required storage space is reduced significantly. Moreover, it provides provable security, and is easy to implement. Therefore, our scheme is more suitable for e-medicine system.
- 9 August 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 14 (7) , 685-687
Comments on an Efficient Secret Broadcast in the Broadcasting Networks
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.
- 9 August 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 14 (7) , 685-687
Comments on an Efficient Secret Broadcast in the Broadcasting Networks
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.
- 29 March 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 14 (4) , 366-368
Security analysis of a cocktail protocol with the authentication and key agreement on the UMTS
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.
- 29 March 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 14 (4) , 366-368
Security analysis of a cocktail protocol with the authentication and key agreement on the UMTS
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.
- 1 November 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1269-1272
Efficient and Secure Password-based Authenticated Key Exchange Protocol
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
- 1 November 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1269-1272
Efficient and Secure Password-based Authenticated Key Exchange Protocol
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
- 1 June 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 2356-2360
A Resource Efficient Architecture for RSA and Elliptic Curve Cryptosystems
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
- 1 June 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 2356-2360
A Resource Efficient Architecture for RSA and Elliptic Curve Cryptosystems
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