S. Mesnager, X. Tang, Z. Zhou, C. Tang, and Q. Wang
Special Issue on Cryptography and Coding Theory - dedicated to the 60th Birthday of Prof. Cunsheng Ding,
Advances in Mathematics of Commnications (AMC), vol. 16, no. 4, 2022.

C. Ding and Q. Wang
Special Issue on Cryptography,
International Journal of Foundations of Computer Science (IJFCS), vol. 22, no. 6, 2011.

K. Momihara, Q. Wang and Q. Xiang
Cyclotomy, difference sets, sequences with low correlation, strongly regular graphs and related geometric substructures.
In Kai-Uwe Schmidt, Arne Winterhof (Eds.) Combinatorics and Finite Fields,
RiCAM Radon Series on Computational and Applied Mathematics, vol. 23, pp. 173-198, Berlin:De Gruyter, 2019.
[ arXiv ]

Q. Wang, R. Li, D. Galindo, Q. Wang, S. Chen, and Y. Xiang.
Transparent registation-based encryption through blockchain.
ACM Distributed Ledger Technologies: Research and Practice (DLT), vol. 2, no. 1, pp. 1-14, 2023.

C. Tang, P. Han, Q. Wang, J. Zhang, and Y. Qi.
The solution to an open problem on the bentness of Mesnager's functions.
Finite Fields and Their Applications (FFA), vol. 88, paper no. 102170, 2023.

M. Zhao, C. Ma, Y. Feng, and Q. Wang.
Two classes of LDPC codes from the space of Hermitian matrices over finite fields.
Advances in Mathematics of Communications (AMC), vol. 16, no. 4, pp. 1211-1222, 2022.

Q. Wang.
Steiner systems $S(2,4,2^m)$ supported by a family of extended cyclic codes.
Advances in Mathematics of Communications (AMC), vol. 16, no. 4, pp. 1011-1022, 2022.

C. Tang, Q. Wang, and C. Ding.
The subfield codes and subfield subcodes of a family of MDS codes.
IEEE Transactions on Information Theory (TIT), vol. 68, no. 9, pp. 5792-5801, 2022. [ arXiv ]

*G. Wang and Q. Wang.
$q$-ary non-overlapping codes: a generating function approach.
IEEE Transactions on Information Theory (TIT), vol. 68, no. 8, pp. 5154-5164, 2022. [ arXiv ]

X. Du, R. Wang, C. Tang, and Q. Wang.
Infinite families of $2$-designs from linear codes.
Applicable Algebra in Engineering, Communication and Computing (AAECC), vol. 33, no. 2, pp. 193-211, 2022.

K. Liu, Q. Wang, and H. Yan.
A class of binary cyclic codes with optimal parameters.
Cryptography and Communications (CCDS), vol. 14, no. 3, pp. 663-675, 2022.

X. Du, R. Wang, C. Tang, and Q. Wang.
Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros.
Advances in Mathematics of Communications (AMC), vol. 16, no. 1, pp. 157-168, 2022.

Y. Huang, C. Li, Q. Wang, and Z. Du.
Parameters and characterizations of hulls of some projective narrow-sense BCH codes.
Designs, Codes and Cryptography (DCC), vol. 90, no. 1, pp. 87-106, 2022.

Z. Gu, Z. Zhou, Q. Wang, and P. Fan.
New construction of optimal Type-II binary Z-complementary pairs.
IEEE Transactions on Information Theory (TIT), vol. 67, no. 6, pp. 3497-3508, 2021.

*J. Michel and Q. Wang.
Placement delivery arrays from combinations of strong edge colorings.
IEEE Transactions on Communications (TCOM), vol. 68, no. 10, pp. 5953-5964, 2020.

*K.H. Leung and Q. Wang.
New nonexistence results on $(m,n)$-generalized bent functions.
Designs, Codes and Cryptography (DCC), vol. 88, no. 3, pp. 553-565, 2020.

C. Xiang, X. Ling, and Q. Wang.
Combinatorial $t$-designs from quadratic functions.
Designs, Codes and Cryptography (DCC), vol. 88, no. 4, pp. 755-770, 2020.

*J. Michel and Q. Wang.
Partial geometric designs from group actions.
Designs, Codes and Cryptography (DCC), vol. 87, no. 11, pp. 2655-2670, 2019.

H. Yan, Z. Zhou, J. Weng, J. Wen, T. Helleseth, and Q. Wang.
Differential spectrum of Kasami power permutations over odd characteristic finite fields.
IEEE Transactions on Information Theory (TIT), vol. 65, no. 10, pp. 6819-6826, 2019.

*J. Michel and Q. Wang.
Almost designs and their links with balanced incomplete block designs.
Designs, Codes and Cryptography (DCC), vol. 87, no. 9, pp. 1945-1960, 2019.

*J. Michel and Q. Wang.
Almost difference sets in nonabelian groups.
Designs, Codes and Cryptography (DCC), vol. 87, no. 6, pp. 1243-1251, 2019.

*J. Michel and Q. Wang.
Some new balanced and almost balanced quaternary sequences with low autocorrelation.
Cryptography and Communications (CCDS), vol. 11, no. 2, pp. 191-206, 2019.

*C. Ma, Q. Wang, and M. Zhao.
LDPC codes based on the space of symmetric matrices over finite fields.
IEEE Transactions on Information Theory (TIT), vol. 63, no. 7, pp. 4332-4343, 2017.

Q. Wang.
Some cyclic codes with prime length from cyclotomy of order 4.
Cryptography and Communications (CCDS), vol. 9, no. 1, pp. 85-92, 2017.

*C. Ding, A. Pott, and Q. Wang.
Skew Hadamard difference sets from Dickson polynomials of order $7$.
Journal of Combinatorial Designs (JCD), vol. 23, no. 10, pp. 436-461, 2015.

*A. Pott and Q. Wang.
Difference balanced functions and their generalized difference sets.
Journal of Combinatorial Theory-Series A (JCT-A), vol. 131, pp. 61-70, 2015.

*C. Ding, A. Pott, and Q. Wang.
Constructions of almost difference sets from finite fields.
Designs, Codes and Cryptography (DCC), vol. 72, no. 3, pp. 581-592, 2014.

*C. Ding, Q. Wang, and M. Xiong.
Three new families of zero-difference balanced functions with applications.
IEEE Transactions on Information Theory (TIT), vol. 60, no. 4, pp. 2407-2413, 2014.

*Q. Wang and Y. Zhou.
Sets of zero-difference balanced functions and their applications.
Advances in Mathematics of Communications (AMC), vol. 8, no. 1, pp. 83-101, 2014.

*G. Kyureghyan, P. Müller, and Q. Wang.
On the size of Kakeya sets in finite vector spaces.
Electronic Journal of Combinatorics (EJC), vol. 20, no. 3, paper 36, 2013.

Q. Wang.
The linear span of the frequency hopping sequences in optimal sets.
Designs, Codes and Cryptography (DCC), vol. 61, no. 3, pp. 331-344, 2011.

Q. Wang and X. Du.
The linear complexity of binary sequences with optimal autocorrelation.
IEEE Transactions on Information Theory (TIT), vol. 56, no. 12, pp. 6388-6397, 2010.

Q. Wang.
The linear complexity of some binary sequences with three-level autocorrelation.
IEEE Transactions on Information Theory (TIT), vol. 56, no. 8, pp. 4046-4052, 2010.

Q. Wang.
Optimal sets of frequency hopping sequences with large linear spans.
IEEE Transactions on Information Theory (TIT), vol. 56, no. 4, pp. 1729-1736, 2010.

Y. Liu, J. Lai, Q. Wang, X. Qin, A. Yang, and J. Weng.
Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead.
In Proceedings of The 29th Annual International Conference on the Theory and Applications of Cryptology and Information Security (Asiacrypt 2023), Guangzhou, China, Dec. 4-8, 2023.

X. Zhang, R. Li, Q. Wang, Q. Wang, and S. Duan.
Time-manipulation attack: breaking fairness against proof of authority Aura.
In Proceedings of The 2023 ACM Web Conference (WWW 2023), Austin, USA, Apr. 30-May 4, 2023.

Y. Liu, Q. Wang, and S.M. Yiu.
Towards practical homomorphic time-lock puzzles: applicability and verifiability.
In Proceedings of The 27th European Symposium on Research in Computer Security (ESORICS 2022), Copenhagen, Denmark, Sep. 26-30, 2022.

R. Li, Q. Wang, Q. Wang, D. Galindo, and M. Ryan.
SoK: TEE-assisted confidential smart contract.
In Proceedings of The 22nd Privacy Enhancing Technologies Symposium (PETS 2022), Sydney, Australia, Jul. 11-15, 2022.

Q. Wang, R. Li, Q. Wang, S. Chen, and Y. Xiang.
Exploring unfairness on proof of authority: order manipulation attacks and remidies.
In Proceedings of The 17th ACM ASIA Conference on Computer and Communications Security (ASIACCS 2022), Nagasaki, Japan, May 30-Jun. 2, 2022.

X. Zhang, Q. Wang, R. Li and Q. Wang.
Frontrunning block attack in PoA Clique: a case study.
In Proceedings of The 4th IEEE International Conference on Blockchain and Cryptocurrency (ICBC 2022), online, May 2-5, 2022.

*G. Wang and Q. Wang.
On the size distribution of Levenshtein balls with radius one.
In Preproceedings of The Twelfth International Workshop on Coding and Cryptography (WCC 2022), Rostock, Germany, Mar. 7-11, 2022.

Y. Liu, Q. Wang, and S.M. Yiu.
Making private function evaluation safer, faster and simpler.
In Proceedings of The 25th International Conference on Practice and Theory of Public-Key Cryptography (PKC 2022), Yokohama, Japan, Mar. 7-11, 2022.

Y. Liu, Q. Wang, and S.M. Yiu.
Improved zero-knowledge argument of encrypted extended permutation.
In Proceedings of The 17th International Conference on Information Security and Cryptology (Inscrypt 2021), online, Aug. 12-14, 2021.

Y. Liu, Q. Wang, and S.M. Yiu.
Blind polynomial evaluation and data trading.
In Proceedings of The 19th International Conference on Applied Cryptography and Network Security (ACNS 2021), online, Kamakura, Japan, Jun. 21-24, 2021.

R. Li, Q. Wang, X. Zhang, Q. Wang, D. Galindo, and Y. Xiang.
An offline delegatable cryptocurrency system.
In Proceedings of The 3rd IEEE International Conference on Blockchain and Cryptocurrency (ICBC 2021), online, May 3-6, 2021.

R. Li, Q. Wang, F. Liu, Q. Wang, and D. Galindo.
An accountable decryption system based on privacy-preserving smart contracts.
In Proceedings of The 23rd International Conference on Information Security (ISC 2020), Bali, Indonesia, Dec. 16-18, 2020.

Y. Liu, Q. Wang, and S.M. Yiu.
An improvement of multi-exponentiation with encrypted bases argument: smaller and faster.
In Proceedings of The 16th International Conference on Information Security and Cryptology (Inscrypt 2020), Guangzhou, China, Dec. 11-14, 2020.

*F. Liu and Q. Wang.
IBRS: an efficient identity-based batch verification scheme for VANETs based on ring signature.
In Proceedings of The 2019 IEEE Vehicular Networking Conference (VNC 2019), Los Angeles, USA, Dec. 4-6, 2019.

*G. Wang and Q. Wang.
An OACF-preserving operation based on Parker's transformation.
In Proceedings of The 9th International Workshop on Signal Design and its Applications in Communications (IWSDA 2019), Dongguan, China, Oct. 20-24, 2019

*J. Michel and Q. Wang.
Placement delivery arrays from combinations of strong edge colorings.
In Proceedings of The 9th International Workshop on Signal Design and its Applications in Communications (IWSDA 2019), Dongguan, China, Oct. 20-24, 2019

R. Li, D. Galindo, and Q. Wang.
Auditable credential anonymity revocation based on privacy-preserving smart contracts.
In Proceedings of The 3rd International Workshop on Cryptocurrencies and Blockchain Technology (CBT 2019), LNCS no. 11737, Luxembourg, Sep. 26-27, 2019.

*A. Pott and Q. Wang.
Some results on difference balanced functions.
In Proceedings of The International Workshop on the Arithmetic of finite fields (WAIFI 2014), LNCS no. 9061, Gebze, Turkey, Sep. 26-28, 2014.

*G. Kyureghyan and Q. Wang.
An upper bound on the size of Kakeya sets in finite vector spaces.
In Preproceedings of International Workshop on Coding and Cryptography (WCC 2013), Bergen, Norway, Apr. 15-19, 2013.

*A. Pott, Q. Wang, and Y. Zhou.
Sequences and functions derived from projective planes and their difference sets.
In Proceedings of The International Workshop on the Arithmetic of finite fields (WAIFI 2012), LNCS no. 7369, Bochum, Germany, Jul. 16-19, 2012.

Q. Wang and X. Du.
The linear complexity of binary sequences with optimal autocorrelation.
In Proceedings of The 2010 IEEE International Symposium on Information Theory (ISIT 2010), Austin, USA, Jun. 13-18, 2010.

Q. Wang, Y. Luo, and L. Huang.
Privacy-preserving protocols for finding the convex hulls.
In Proceedings of The third International Conference on Availability, Reliability and Security (ARES 2008), Barcelona, Spain, Mar. 4-7, 2008.

Qi Wang.
The Linear Complexity of Sequences with Desirable Correlation (103 pages).
Ph.D. Thesis, Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, 2011.