Robert W. Zhu

Publications (9)0 Total impact

• Source

  Available from: nchu.edu.tw

  Article: Improved Efficient Remote User Authentication Schemes

  Tian Xiaojian, Robert W. Zhu, Duncan S. Wong
  [show abstract] [hide abstract]
  ABSTRACT: Recently, Yoon et al. proposed a new smart card based remote user authentication scheme. We show that this scheme is subject to forgery attacks if the information stored in the smart card is stolen. This violates the ``two-factor security'' objective of the smart card based remote user authentication schemes. We propose an amendment to this problem. We further propose two new schemes which are more efficient and secure than Yoon et al.'s scheme.
  International Journal of Network Security. 01/2007;
• Article: Cryptanalysis of a suite of deniable authentication protocols.

  Robert W. Zhu, Duncan S. Wong, Chan H. Lee
  IEEE Communications Letters. 01/2006; 10:504-506.
• Chapter: An Efficient Identity-Based Key Exchange Protocol with KGS Forward Secrecy for Low-Power Devices

  Robert W. Zhu, Guomin Yang, Duncan S. Wong
  [show abstract] [hide abstract]
  ABSTRACT: For an ID-based key exchange (KE) protocol, KGS forward secrecy is about the protection of previously established session keys after the master secret key of the Key Generation Server (KGS) is compromised. This is the strongest notion of forward secrecy that one can provide for an ID-based KE protocol. Among all the comparable protocols, there are only a few of them providing this level of forward secrecy and all of these protocols require expensive bilinear pairing operations and map-to-point hash operations that may not be suitable for implementation on low-power devices such as sensors. In this paper, we propose a new ID-based KE protocol which does not need any pairing or map-to-point hash operation. It also supports the strongest KGS forward secrecy. On its performance, we show that it is faster than previously proposed protocols in this category. Our protocol is signature-based in which the signature scheme is a variant of a scheme proposed by Bellare et al. in Eurocrypt 2004. We show that the variant we proposed is secure and also requires either less storage space or runtime computation than the original scheme.
  11/2005: pages 500-509;
• Source

  Available from: Joseph K. Liu

  Conference Proceeding: Universal Custodian-Hiding Verifiable Encryption for Discrete Logarithms.

  Joseph K. Liu, Patrick P. Tsang, Duncan S. Wong, Robert W. Zhu
  Information Security and Cryptology - ICISC 2005, 8th International Conference, Seoul, Korea, December 1-2, 2005, Revised Selected Papers; 01/2005
• Conference Proceeding: An Efficient Identity-Based Key Exchange Protocol with KGS Forward Secrecy for Low-Power Devices.

  Robert W. Zhu, Guomin Yang, Duncan S. Wong
  Internet and Network Economics, First International Workshop, WINE 2005, Hong Kong, China, December 15-17, 2005, Proceedings; 01/2005
• Source

  Available from: psu.edu

  Article: Enhancing CK-Model for Key Compromise Impersonation Resilience and Identity-based Key Exchange.

  Robert W. Zhu, Xiaojian Tian, Duncan S. Wong
  IACR Cryptology ePrint Archive. 01/2005; 2005:455.
• Article: Analysis and improvement of an authenticated key exchange protocol for sensor networks.

  Xiaojian Tian, Duncan S. Wong, Robert W. Zhu
  IEEE Communications Letters. 01/2005; 9:970-972.
• Source

  Available from: psu.edu

  Article: A Suite of Enhanced Security Models for Key Compromise Impersonation Resilience and ID-based Key Exchange

  Robert W Zhu, Xiaojian Tian, Duncan S Wong
  [show abstract] [hide abstract]
  ABSTRACT: Canetti and Krawczyk proposed a security model (CK-model) for authentication and key exchange protocols in 2001 based on a modeling approach proposed by Bellare et al. in 1998. The model not only reasonably captures the power of practical attackers but also provides a modular ap-proach to the design of secure key exchange protocols. However, the model does not capture the property of Key Compromise Impersonation (KCI) Re-silience, which has been studied elaborately with respect to key exchange protocols. Until now, analysis concerning this property has mostly been performed heuristically and it has been difficult to apply existing security models and formal analysis methods to the study of KCI attacks. In this paper, we solve this problem by proposing an enhancement of the CK-model for capturing KCI attacks. With the revival of interest in identity-based (ID-based) cryptography, there have been many new ID-based key exchange protocols proposed. Despite the fact that some of them have been proven in some restricted versions of a model proposed by Bellare and Rogaway in 1993 and some others have been proven in the CK-model, there is no security model specifically formalized for ID-based key exchange protocols. In particular, Forward Secrecy against compromised Key Generation Server (KGS-FS) has never been captured even though this notion is more important and also stronger than the perfect forward secrecy in ID-based cryptography. For this, we further extend our model to the ID-based cryptographic setting and capture the KGS-FS. Finally, we provide some formal security analyses for several identity-based key exchange protocols under our models.
• Article: An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices

  Robert W. Zhu, Guomin Yang, Duncan S. Wong
  [show abstract] [hide abstract]
  ABSTRACT: For an ID-based key exchange (KE) protocol, KGS forward secrecy is about the protection of previously established session keys after the master secret key of the Key Generation Server (KGS) is compromised. This is the strongest notion of forward secrecy that one can provide for an ID-based KE protocol. Among all the comparable protocols, there are only a few of them that provide this level of forward secrecy, and all of these protocols require expensive bilinear pairing operations and map-to-point hash operations that may not be suitable for implementation on low-power devices such as sensors. In this paper, we propose a new ID-based KE protocol which does not need any pairing or map-to-point hash operations. It also supports the strongest KGS forward secrecy. On its performance, we show that it is faster than previously proposed protocols in this category. Our protocol is a signature-based one, in which the signature scheme is a variant of a scheme proposed by Bellare et al. in Eurocrypt 2004. We show that the variant we proposed is secure, and also requires either less storage space or runtime computation than the original scheme.
  Theoretical Computer Science.