Privacy-Preserving Face Recognition with Outsourced Computation. - Can Xiang; Chunming Tang 001 (IACR Cryptol. ePrint Arch., 2014)

A Family of Three-Weight Binary Linear Codes. - Can Xiang (CoRR, 2015)

A Construction of Linear Codes over $ f_{2^t}$ from Boolean Functions. - Can Xiang; Keqin Feng; Chunming Tang 001 (CoRR, 2015)

Securely verifiable outsourcing schemes of matrix calculation. - Can Xiang; Chunming Tang 001 (Int. J. High Perform. Comput. Netw., 2015)

Efficient outsourcing schemes of modular exponentiations with checkability for untrusted cloud server. - Can Xiang; Chunming Tang 001 (J. Ambient Intell. Humaniz. Comput., 2015)

Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound. - Can Xiang; Cunsheng Ding; Sihem Mesnager (IEEE Trans. Inf. Theory, 2015)

Linear codes from a generic construction. - Can Xiang (Cryptogr. Commun., 2016)

It is indeed a fundamental construction of all linear codes. - Can Xiang (CoRR, 2016)

Another q-Polynomial Approach to Cyclic Codes. - Can Xiang (CoRR, 2016)

Complete characterization of generalized bent and 2^k-bent Boolean functions. - Chunming Tang 001; Can Xiang; Yanfeng Qi; Keqin Feng (IACR Cryptol. ePrint Arch., 2016)

New verifiable outsourced computation scheme for an arbitrary function. - Can Xiang; Chunming Tang 001 (Int. J. Grid Util. Comput., 2016)

Privacy-preserving face recognition with outsourced computation. - Can Xiang; Chunming Tang 001; Yunlu Cai; Qiuxia Xu (Soft Comput., 2016)

Secret sharing schemes for compartmented access structures. - Xianfang Wang; Can Xiang; Fang-Wei Fu 001 (Cryptogr. Commun., 2017)

A class of linear codes with a few weights. - Can Xiang; Chunming Tang 001; Keqin Feng (Cryptogr. Commun., 2017)

Linear codes with few weights from inhomogeneous quadratic functions. - Chunming Tang 001; Can Xiang; Keqin Feng (Des. Codes Cryptogr., 2017)

Complete Characterization of Generalized Bent and 2k-Bent Boolean Functions. - Chunming Tang 001; Can Xiang; Yanfeng Qi; Keqin Feng (IEEE Trans. Inf. Theory, 2017)

A Construction of Linear Codes Over 𝔽2t From Boolean Functions. - Can Xiang; Keqin Feng; Chunming Tang 001 (IEEE Trans. Inf. Theory, 2017)

Two classes of linear codes and their weight distributions. - Can Xiang; Xianfang Wang; Chunming Tang 001; Fang-Wei Fu 001 (Appl. Algebra Eng. Commun. Comput., 2018)

Oblivious Transfer via Lossy Encryption from Lattice-Based Cryptography. - Zengpeng Li 001; Can Xiang; Chengyu Wang 002 (Wirel. Commun. Mob. Comput., 2018)

A further construction of asymptotically optimal codebooks with multiplicative characters. - Wenjuan Yin; Can Xiang; Fang-Wei Fu 001 (Appl. Algebra Eng. Commun. Comput., 2019)

Combinatorial t-designs from quadratic functions. - Can Xiang; Xin Ling; Qi Wang 012 (Des. Codes Cryptogr., 2020)

New Constructions of Near-Complete External Difference Families Over Galois Rings. - Can Xiang; Zongxiang Yi; Fang-Wei Fu 001; Wenjuan Yin (IEEE Commun. Lett., 2020)

Two families of subfield codes with a few weights. - Can Xiang; Wenjuan Yin (Cryptogr. Commun., 2021)

An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3, 8, 7m+1). - Can Xiang; Chunming Tang 001; Qi Liu (CoRR, 2021)

Some shortened codes from linear codes constructed by defining sets. - Can Xiang; Chunming Tang 001; Min Guo (Adv. Math. Commun., 2022)

Two constructions of low-hit-zone frequency-hopping sequence sets. - Wenjuan Yin; Can Xiang; Fang-Wei Fu 001 (Adv. Math. Commun., 2022)

Some t-designs from BCH codes. - Can Xiang (Cryptogr. Commun., 2022)

An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3, 8, 7m+1). - Can Xiang; Chunming Tang 001; Qi Liu (Des. Codes Cryptogr., 2022)

Shortened Linear Codes From APN and PN Functions. - Can Xiang; Chunming Tang 001; Cunsheng Ding (IEEE Trans. Inf. Theory, 2022)

Some subfield codes from MDS codes. - Can Xiang; Jinquan Luo (Adv. Math. Commun., 2023)

New frequency-hopping sequence sets with good parameters under aperiodic hamming correlation. - Wenjuan Yin; Can Xiang; Fang-Wei Fu 001 (Cryptogr. Commun., 2023)

Codes and Pseudo-Geometric Designs from the Ternary m-Sequences with Welch-type decimation d=2·3(n-1)/2+1. - Can Xiang; Chunming Tang 001; Haode Yan; Min Guo (CoRR, 2023)

Some 3-designs and shortened codes from binary cyclic codes with three zeros. - Can Xiang; Chunming Tang 001 (Finite Fields Their Appl., 2023)

Infinite families of t-designs from the binomial x4+x3 over $ mathrm {GF}(2^n)$. - Xin Ling; Can Xiang (Appl. Algebra Eng. Commun. Comput., 2023)

A New Multi-Receiver Authentication Scheme for General Access Structure. - Jing Yang 035; Shu-Tao Xia; Xianfang Wang; Can Xiang; Fang-Wei Fu 001 (ISIT, 2024)

A Fast Method for Constructing Phase Shifters to Reduce Wiring Conflicts. - Min Jin; Can Xiang; Dong Xiang (ITC-Asia, 2024)

Codes and pseudo-geometric designs from the ternary m-sequences with Welch-type decimation d = 2 ⋅ 3(n-1)/2 + 1. - Can Xiang; Chunming Tang 001; Haode Yan; Min Guo (Finite Fields Their Appl., 2024)

Three new classes of spreading sequence sets with low correlation and PAPR. - Can Xiang; Chunming Tang 001; Wenwei Qiu (Finite Fields Their Appl., 2025)

New MRA Schemes Based on the CRT for Polynomial Rings. - Jing Yang 035; Xianfang Wang; Can Xiang; Fang-Wei Fu 001; Shu-Tao Xia (IEEE Trans. Inf. Theory, 2025)