Selected
Publications
|
||
Books, Edited Books and Book Chapters 1.
Li Y, Ling S, Niederreiter H, Wang H, Xing C and S. Zhang
(eds.): Coding and Cryptology, Proceedings
of the First International Workshop, Series on Coding Theory and Cryptology,
Vol. 4, World Scientific, 2008. 2. Bao F,
Ling S, Okamoto T, Wang H and Xing C (eds.): Cryptology and Network
Security, Proceedings of 6th International
Conference, CANS 2007, Lecture Notes in Computer Science 4856, Springer, 2007, xii + 281 pp. 3. Ling S,
Wang H and Xing C: Cover-free Families and Their Applications, in Book Security in Distributed and Networking Systems, Yang Xiao and Yi Pan eds.,
World Scientific, Publishing Co., 75 - 98, 2007. 4. Niederreiter
H,Wang H and Xing C: Function Fields over Finite
Fields and Their Applications to Cryptography, in Book Topics in Geometry, Coding Theory and Cryptography, Aenaldo Garcia
and Henning Stichtenoth eds., Springer,
59 - 104, 2007. 5. Desmedt
Y, Wang H, Mu Y and Li Y (eds.): Cryptology and Network Security, Proceedings of 4th International
Conference, CANS 2005, Lecture Notes in Computer Science Vol.
3810, Springer, 2005 6. Wang H,
Pieprzyk J and Varadharajan V (eds.): Information
Security and Privacy, Proceedings
of 9th Australasian Conference, ACISP’04, Lecture Notes in Computer Science, Springer,
Vol. 3108, 2004. 7. Lam K Y,
Shparlinski I, Wang H and Xing C (eds.): Cryptography and Computational
Number Theory, Proceedings
of Workshop of Cryptography and Computational Number Theory, Birkhauser, 2001. Journal Papers 1. Yang G, Wong S D, Wang H and Deng
X: Two-factor mutual authentication based on smart cards and passwords, Journal of Computer and System
Sciences, 2008, to appear 2. Yuan J,
Ding C, Wang H and Pieprzyk J: Permutation polynomials of the
form $(x^p-x+\delta)^s +
L(x)$, Finite Fields and Their Applications, Vol. 14, No. 2 (2008), 482-493. 3. Wand H and
Wong D S: On Secret Reconstruction in Secret Sharing Schemes, IEEE
Trans. on Info. Theory, Vol. 54, No. 1 (2008), 473 -
480. 4. Steinfeld
R, Pieprzyk J and Wang H: Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes, IEEE Trans. on Info. Theory,
Vol. 53, No. 7 (2007), 2542-2559. 5. Tartary C
and Wang H: Efficient Multicast Stream Authentication for Fully
Adversarial Network Model, International Journal of Security and
Networks (IJSN) - Special Issue on Cryptography in
Networks, 2007, Vol. 2, No. 3/4 (2007), 175 - 191. 6. van
Tilborg H, Pieprzyk J, Steinfeld R and Wang H: New constructions of
anonymous membership broadcasting schemes, Advances in Mathematics of
Communications, 1:1(2007), 29 -44. 7. Safavi-Naini
R, Wang H and Wong D S: Resilient LKH: Secure Multicast Key Distribution
Schemes, International Journal of Foundations of Computer Science,
17:5(2006), 1205 - 1221. 8. Safavi-Naini
R and Wang H: Secret Sharing Schemes with Partial Broadcast
Channels, Designs, Codes and Cryptography, 41:1(2006), 5 - 22. 9. Long S,
Pieprzyk J, Wang H and Wong D S: Generalised
Cumulative Arrays in Secret Sharing, Designs,
Codes and Cryptography,
40(2006), 191 - 209. 10. Steinfeld
R, Pieprzyk J and Wang H: Lattice-Based Threshold-Changeability for
Standard CRT Secret-Sharing Schemes. Finite Fields and Their
Applications, 12:4(2006), 653 - 680. 11. Martin K,
Safavi-Naini R, Wang H and Wild P: Distributing the encryption and
decryption of a block cipher. Designs, Codes and Cryptography,
36(2005), 263-287. 12. Wang H and
Pieprzyk J: Shared generation of pseudo-random functions. Journal
of Complexity, 20(2004), 458 - 472. 13. Wang H,
Xing C and Safavi-Naini R: Linear Authentication Codes: Bounds and
Constructions. IEEE Trans. on Info. Theory, Vol.
49, No. 4, 2003, 866-872. 14. Safavi-Naini
R and Wang H: Efficient Authentication for Group Communication. Theoretical Computer
Science, Vol. 269, 1–2, 2001, 1–21. 15. Wang H
and Xing C: Explicit Constructions of Perfect Hash Families from
Algebraic Curve over Finite Fields. Journal of Combinatorial
Theory, Series A, Vol.93, 2001, 112-124. 16. Desmedt
Y, Safavi-Naini R, Wang H, Batten L M, Charnes C and Pieprzyk J: Broadcast
Anti-jamming Systems. Computer Networks, Vol. 35, No.
2-3, 2001, 223-236. 17. Xing C,
Wang H and Lam K Y: Constructions of Authentication Codes from Algebraic
Curves over Finite Fields. IEEE Trans. on Info. Theory, Vol.46, 2000, 886-892. 18. Martin K,
Safavi-Naini R and Wang H: Bounds and Techniques for Efficient
Redistribution of Secret Shares to New Access Structures, The
Computer Journal, Vol.42, No.8, 1999, 638-649. 19. Safavi-Naini
R and Wang H: Multireceiver
Authentication Codes: Model, Bounds, Constructions and Extensions, Information
and Computation, Vol. 151, No. 1/2, 1999, 148-172. 20. Wang H: On
Syntactic Nuclei of Rational Languages, Information Processing Letters, Vol.
67, No.5,1998, 221-226. 21. Wang H: On
rational Languages and Rational Series, Theoretical Computer Science.
Vol. 205, No. 1-2, 1998, 329-336. Conference Papers 1.
Zhang
Z, Liu M, Chee Y M, Ling S and Wang H: Strongly multiplicative and
3-multiplicative linear secret sharing schemes, ASIACRYPT’08, 14th Annual
International Conference on the Theory and Application of Cryptology &
Information Security, Lecture Notes in Computer Science, 2008, to appear 2. Lu Y, Wang H and
Ling S: Cryptanalysis of Rabbit, ISC’08,
Information
Security Conference, Lecture Notes in Computer
Science, 2008, to appear 3. Contini
S, Matusiewicz K, Pieprzyk J, Steinfeld R, Guo J, Ling S and Wang H: Cryptanalysis
of LASH, FSE’08, Fast Software Encryption, Lecture Notes in Computer Science,
5086(2008), 207 - 223. 4. Desmedt
Y, Pieprzyk J, Steinfeld R and Wang H: On Secure Multi-Party Computation in
Black Box Groups, Crypto’07, Lecture
Notes in Computer Science, Vol. 4622, pp. 591-612, Springer-Verlag, 2007. 5. Steinfeld
R, Pieprzyk J and Wang H: How to Strengthen any Weakly Unforgeable
Signature into a Strongly Unforgeable Signature, CT-RSA
2007, Lecture Notes in Computer
Science, 4377(2007), 357 - 371. 6. Steinfeld
R, Pieprzyk J and Wang H: On the Provable Security of an Efficient
RSA-Based Pseudorandom Generator, Advances
in Cryptology ASIACRYPT 2006,
Lecture Notes in Computer Science, 4284(2006), 194 - 209. 7. Yang G,
Wong D, Deng X and Wang H: Anonymous Signature Schemes. International Workshop on Practice and
Theory in Public Key Cryptography (PKC’06).
Lecture Notes in Computer Science, Vol. 3958, 2006, 347 - 343. 8. Steinfeld
R, Pieprzyk J and Wang H: Higher Order Universal One-Way Hash
Functions from the Subset Sum Assumption. International Workshop on Practice and
Theory in Public Key Cryptography (PKC’06).
Lecture Notes in Computer Science, Vol. 3958, 2006, 157 - 173. 9. Desmedt
Y, Wang Y, Safavi-Naini R and Wang H: Radio Networks with Reliable
Communication. Cocoon 2005, 11th
Annual International Computing and Combinatorics
Conference, Lecture
Notes in Computer Science, Vol. 3595, 2005, 156 - 166. 10. Steinfeld
R, Contini S, Wang H and Pieprzyk J: Converse Results to the Wiener
Attack on RSA. International Workshop
on Practice and Theory in Public Key Cryptography (PKC’05). Lecture Notes in Computer Science, Vol.
3386, 2005, 184 - 198. 11. Steinfeld
R, Pieprzyk J and Wang H: Lattice-Based Threshold-Changeability for
Standard Shamir Secret-Sharing Schemes. 10th International Conference on the
Theory and Application of Cryptology and Information Security, Asiacrypt’04. Lecture Notes in
Computer Science, Vol. 3329, 2004, 170 - 186. 12. Steinfeld
R, Pieprzyk J and Wang H: Efficient extension of standard Schnorr/RSA signature into universal
designated-verifier. International
Workshop on Practice and Theory in Public Key Cryptography (PKC’04). Lecture Notes in Computer
Science, Vol. 2942, 2004, 86 - 100. 13. Pieprzyk
J, Wang H and Xing C: Multiple-Time Signature Schemes Secure against
Adaptive 14. Wang H
and Pieprzyk J: Efficient one-time proxy signatures, 9th International Conference on the Theory
and Application of Cryptology and Information Security, Asiacrypt’03. Lecture Notes in Computer Science, Vol. 2894,
2003, 507 - 522. 15. Steinfeld
R, Bull L, Wang H and Pieprzyk J: Universal designated-verifier
signatures, 9th International
Conference on the Theory and Application of Cryptology and Information
Security, Asiacrypt’03. Lecture
Notes in Computer Science, Vol. 2894, 2003, 523 - 542. 16. Wang H
and Pieprzyk J: Shared generation of pseudo-random function with
cumulative maps, CT-RSA’03. Lecture Notes in Computer Science, Vol.
2612, 2003, 281-294. 17. Wang H
and Pieprzyk J: A Combinatorial Approach to Anonymous Membership
Broadcast, Cocoon’2002, 8th Annual
International Computing and Combinatorics
Conference, Lecture Notes in Computer Science, Vol. 2387, 2002, 162 –
170. 18. Desmedt
Y, Safavi-Naini R and Wang H: Redistribution
of a mechanical secret’s shares, Financial Cryptography’02, Lecture
Notes in Computer Science, Vol. 2357, 2002, 238–252. 19. Safavi-Naini
R and Wang H: New Constructions of secure multicast re-keying
schemes using perfect hash families, 7th
ACM Conference on Computer and Communication Security, ACM Press, 2000, 228-234. 20. Safavi-Naini
R and Wang H: Broadcast authentication in group communication, ASIACRYPT’99, Lecture Notes in Computer Science,
Vol. 1716, 1999, 399-41. 21. Safavi-Naini
R and Wang H: New Results on Multireceiver
Authentication Codes. In Advances in Cryptology - EUROCRYPT ’98, Lecture Notes in
Computer Science, 1403,
527-541, 1998. 22. Safavi-Naini
R and Wang H: Bounds and Constructions for Multireceiver
Authentication Codes. In ‘Advances in Cryptology - ASIACRYPT
’98’, Lecture Notes in Comp. Sci. 1514(1998),
242-256. |