Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Wei-Hua He is active.

Publication


Featured researches published by Wei-Hua He.


Applied Mathematics and Computation | 2005

New proxy multi-signature scheme

Chien-Lung Hsu; Tzong-Sun Wu; Wei-Hua He

In 2000, Yi et al.s proposed two proxy multi-signature schemes which enable some original signers to delegate their signing power to the proxy signer. However, their schemes suffer from some drawbacks. To improve the performance, this paper presented a new proxy multi-signature scheme. As compared with Yi et al.s scheme, the proposed one requires less computational efforts and communication costs. Our proposed scheme has the properties that the size of a proxy signature is independent of the number of the original signers, and the validity of a proxy signature and public keys can be verified simultaneously.


Information Processing Letters | 2002

Weaknesses in some multisignature schemes for specified group of verifiers

Wei-Hua He

The author points out that Laih and Yens multisignature scheme and Hwang, Chen and Changs multisignature scheme do not satisfy their security requirements.


international carnahan conference on security technology | 2009

Security of generalized signature scheme based on discrete logarithms and factorization

Chien-Lung Hsu; Yu-Hao Chuang; Wei-Hua He; So-Lin Yen; Chin-Lung Tseng; Chia-Wen Chen

In 2005, Pon et al. proposed a generalized signature scheme based on the intractability of solving two well-known cryptographic assumptions, the factorization (FAC) and the discrete logarithm problem (DLP). They claimed that their scheme is still secure, provided that one of these two assumptions is solved. This paper, however, will show that Pon et al.s scheme is insecure against the universal forgery attack if the adversary can solve the DLP.


Journal of Information Science and Engineering | 2002

Remarks on Using RSA With Low Exponent in a Public Network

Wei-Hua He; Tzong-Chen Wu; Chih-Yin Lin

The authors give a counterexample to show that the RSA-based cryptosystem with low exponent proposed by Lee and Chang (Computer Communications 21 (1998)) is vulnerable to the low exponent attack with respect to their suggested lower boundary for the size of the public encryption key. That is, an eavesdropper can recover the plaintext from the ciphertext without knowing the secret decryption key, even though the size of the secret decryption key is large enough. The authors also suggest a new lower boundary for the size of the public encryption key for the Lee-Chang cryptosystem to enforce secrecy.


Electronics Letters | 2001

Digital signature scheme based on factoring and discrete logarithms

Wei-Hua He


Electronics Letters | 1999

Security of authenticated multiple-key agreement protocols

Tzong-Sun Wu; Wei-Hua He; Chien-Lung Hsu


IEE Proceedings - Computers and Digital Techniques | 1999

Cryptanalysis and improvement of Petersen-Michels signcryption scheme

Wei-Hua He; Tzong-Chen Wu


Computer Systems: Science & Engineering | 1995

Dynamic access control scheme based on the Chinese remainder theorem

Tzong-Chen Wu; Tzong-Sun Wu; Wei-Hua He


IEE Proceedings - Computers and Digital Techniques | 2001

Comment on Lin-Wu (t, n)-threshold verifiable multisecret sharing scheme

Wei-Hua He; Tzong-Sun Wu


Electronics Letters | 1997

Improvement of Harn's digital signature for Diffie-Hellman public keys

Wei-Hua He; Tzong-Chen Wu

Collaboration


Dive into the Wei-Hua He's collaboration.

Top Co-Authors

Avatar

Tzong-Chen Wu

National Taiwan University of Science and Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Chih-Yin Lin

National Chiao Tung University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge