Duncan S. Wong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Duncan S. Wong has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Xiaotie Deng
Peking University, Beijing, China
2 shared publications - Bessie C. Hu
City University of Hong Kong
1 shared publication Chung Ki Li
Department of Computer Science, City University of Hong Kong, China. s:
1 shared publication- Guomin Yang
Singapore Management University, Singapore, Singapore
1 shared publication - Huaxiong Wang
Nanyang Technological University
1 shared publication - Sherman S. M. Chow
Chinese University of Hong Kong
1 shared publication
Latest Publications
- 1 June 2010
- Published by SAGE Publications in Journal of Computer Security
- Vol. 18 (3) , 451-473
An efficient signcryption scheme with key privacy and its extension to ring signcryption
In Information Processing Letters (2006), Tan pointed out that the anonymous signcryption scheme proposed by Yang, Wong and Deng (YWD) in ISC 2005 provides neither confidentiality nor anonymity. However, no discussion has been made on how a secure scheme can be made and there is no secure scheme available to date. In this paper, we propose a modification of YWD scheme which resolves the security issues of the original scheme without sacrificing its high efficiency and simple design. Indeed, we show that our scheme achieves confidentiality, existential unforgeability and anonymity with more precise reduction bounds. We also give a variation of our scheme and extend it to a ring signcryption scheme by using the technique due to Boneh, Gentry, Lynn and Shacham.
- 1 June 2010
- Published by SAGE Publications in Journal of Computer Security
- Vol. 18 (3) , 451-473
An efficient signcryption scheme with key privacy and its extension to ring signcryption
In Information Processing Letters (2006), Tan pointed out that the anonymous signcryption scheme proposed by Yang, Wong and Deng (YWD) in ISC 2005 provides neither confidentiality nor anonymity. However, no discussion has been made on how a secure scheme can be made and there is no secure scheme available to date. In this paper, we propose a modification of YWD scheme which resolves the security issues of the original scheme without sacrificing its high efficiency and simple design. Indeed, we show that our scheme achieves confidentiality, existential unforgeability and anonymity with more precise reduction bounds. We also give a variation of our scheme and extend it to a ring signcryption scheme by using the technique due to Boneh, Gentry, Lynn and Shacham.
- Open Access
- 1 January 2008
- Published by Hindawi Limited in Mobile Information Systems
- Vol. 4 (1) , 51-68
Employ a Mobile Agent for Making a Payment
The mobile agent paradigm offers flexibility and autonomy to e-commerce applications. But it is challenging to employ a mobile agent to make a payment due to the security consideration. In this paper, we propose a new agent-assisted secure payment protocol, which is based on SET payment protocol and aims at enabling the dispatched consumer-agent to autonomously sign contracts and make the payment on behalf of the cardholder after having found the best merchant, without the possibility of disclosing any secret to any participant. This is realized by adopting the Signature-Share scheme, and employing a Trusted Third Party (TTP). In the proposed protocol, the principle that each participant knows what is strictly necessary for his/her role is followed as in SET. In addition, mechanisms have been devised for preventing and detecting double payment, overspending and overpayment attacks. Finally the security properties of the proposed protocol are studied analytically. In comparison with other existing models, the proposed protocol is more efficient and can detect more attacks.
- 1 January 2008
- Published by Hindawi Limited in Mobile Information Systems
- Vol. 4 (1) , 51-68
Open AccessEmploy a Mobile Agent for Making a Payment
The mobile agent paradigm offers flexibility and autonomy to e-commerce applications. But it is challenging to employ a mobile agent to make a payment due to the security consideration. In this paper, we propose a new agent-assisted secure payment protocol, which is based on SET payment protocol and aims at enabling the dispatched consumer-agent to autonomously sign contracts and make the payment on behalf of the cardholder after having found the best merchant, without the possibility of disclosing any secret to any participant. This is realized by adopting the Signature-Share scheme, and employing a Trusted Third Party (TTP). In the proposed protocol, the principle that each participant knows what is strictly necessary for his/her role is followed as in SET. In addition, mechanisms have been devised for preventing and detecting double payment, overspending and overpayment attacks. Finally the security properties of the proposed protocol are studied analytically. In comparison with other existing models, the proposed protocol is more efficient and can detect more attacks.
- 13 December 2006
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 42 (2) , 109-126
Certificateless signature: a new security model and an improved generic construction
- 13 December 2006
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 42 (2) , 109-126
Certificateless signature: a new security model and an improved generic construction