When are two geometric Goppa codes equal? - Chaoping Xing (IEEE Trans. Inf. Theory, 1992)

On Automorphism Groups of the Hermitian Codes. - Chaoping Xing (IEEE Trans. Inf. Theory, 1995)

A General Method of Constructing Global Function Fields. - Harald Niederreiter; Chaoping Xing (ANTS, 1998)

Explicit Sequence Expansions. - David R. Kohel; San Ling; Chaoping Xing (SETA, 1998)

A Class of Explicit Perfect Multi-sequences. - Chaoping Xing; Kwok-Yan Lam; Zhenghong Wei (ASIACRYPT, 1999)

A New Construction of Algebraic Geometry Codes. - Harald Niederreiter; Chaoping Xing; Kwok-Yan Lam (Appl. Algebra Eng. Commun. Comput., 1999)

Construction and Enumeration of All Binary Duadic Codes of Length pm. - Cunsheng Ding; Kwok-Yan Lam; Chaoping Xing (Fundam. Informaticae, 1999)

Some Computational Problems of Cryptographic Significance Concerning Elliptic Curves over Rings. - Ming-Deh A. Huang; Chaoping Xing (Inf. Comput., 1999)

Sequences with Almost Perfect Linear Complexity Profiles and Curves Over Finite Fields. - Chaoping Xing; Kwok-Yan Lam (IEEE Trans. Inf. Theory, 1999)

Constructions of Algebraic-Geometry Codes. - Chaoping Xing; Harald Niederreiter; Kwok-Yan Lam (IEEE Trans. Inf. Theory, 1999)

A generalization of algebraic-geometry codes. - Chaoping Xing; Harald Niederreiter; Kwok-Yan Lam (IEEE Trans. Inf. Theory, 1999)

A Propagation Rule for Linear Codes. - Harald Niederreiter; Chaoping Xing (Appl. Algebra Eng. Commun. Comput., 2000)

Multi-sequences with Almost Perfect Linear Complexity Profile and Function Fields over Finite Fields. - Chaoping Xing (J. Complex., 2000)

Some new codes from algebraic curves. - Cunsheng Ding; Harald Niederreiter; Chaoping Xing (IEEE Trans. Inf. Theory, 2000)

A class of linear codes with good parameters from algebraic curves. - Chaoping Xing; San Ling (IEEE Trans. Inf. Theory, 2000)

A class of linear codes with good parameters. - Chaoping Xing; San Ling (IEEE Trans. Inf. Theory, 2000)

Constructions of authentication codes from algebraic curves over finite fields. - Chaoping Xing; Huaxiong Wang; Kwok-Yan Lam (IEEE Trans. Inf. Theory, 2000)

Constructions of Sequences from Algebraic Curves over Finite Fields. - Chaoping Xing (SETA, 2001)

Explicit Constructions of Perfect Hash Families from Algebraic Curves over Finite Fields. - Huaxiong Wang; Chaoping Xing (J. Comb. Theory A, 2001)

Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound. - Hao Chen 096; San Ling; Chaoping Xing (IEEE Trans. Inf. Theory, 2001)

Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds. - Chaoping Xing (IEEE Trans. Inf. Theory, 2001)

The minimum distance of the duals of binary irreducible cyclic codes. - Cunsheng Ding; Tor Helleseth; Harald Niederreiter; Chaoping Xing (IEEE Trans. Inf. Theory, 2002)

New binary linear codes from algebraic curves. - Ka Hin Leung; San Ling; Chaoping Xing (IEEE Trans. Inf. Theory, 2002)

Asymptotic bounds on frameproof codes. - Chaoping Xing (IEEE Trans. Inf. Theory, 2002)

Constructions of codes from residue rings of polynomials. - Chaoping Xing (IEEE Trans. Inf. Theory, 2002)

Improvements on parameters of one-point AG Codes from Hermitian curves. - Chaoping Xing; Hao Chen 096 (IEEE Trans. Inf. Theory, 2002)

Multiple-Time Signature Schemes against Adaptive Chosen Message Attacks. - Josef Pieprzyk; Huaxiong Wang; Chaoping Xing (Selected Areas in Cryptography, 2003)

Several Classes of (2m-1, w, 2) Optical Orthogonal Codes. - Cunsheng Ding; Chaoping Xing (Discret. Appl. Math., 2003)

New lower bounds and constructions for binary codes correcting asymmetric errors. - Fang-Wei Fu 001; San Ling; Chaoping Xing (IEEE Trans. Inf. Theory, 2003)

Linear authentication codes: bounds and constructions. - Huaxiong Wang; Chaoping Xing; Reihaneh Safavi-Naini (IEEE Trans. Inf. Theory, 2003)

Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound. - Chaoping Xing (IEEE Trans. Inf. Theory, 2003)

Low-correlation, large linear span sequences from function fields. - Chaoping Xing; P. Vijay Kumar; Cunsheng Ding (IEEE Trans. Inf. Theory, 2003)

Special issue on cryptography and coding theory. - Cunsheng Ding; Chaoping Xing (J. Complex., 2004)

A short biography of Harald Niederreiter. - Cunsheng Ding; Chaoping Xing (J. Complex., 2004)

Cyclotomic Optical Orthogonal Codes of Composite Lengths. - Cunsheng Ding; Chaoping Xing (IEEE Trans. Commun., 2004)

Polyadic codes revisited. - San Ling; Chaoping Xing (IEEE Trans. Inf. Theory, 2004)

Disjoint Linear Codes From Algebraic Function Fields. - Harald Niederreiter; Chaoping Xing (IEEE Trans. Inf. Theory, 2004)

Linear codes from narrow ray class groups of algebraic curves. - Chaoping Xing (IEEE Trans. Inf. Theory, 2004)

A class of polynomial codes. - Chaoping Xing; Yang Fang (IEEE Trans. Inf. Theory, 2004)

On the variance of average distance of subsets in the Hamming space. - Fang-Wei Fu 001; San Ling; Chaoping Xing (Discret. Appl. Math., 2005)

Quantum codes from concatenated algebraic-geometric codes. - Hao Chen 095; San Ling; Chaoping Xing (IEEE Trans. Inf. Theory, 2005)

Excellent nonlinear codes from algebraic function fields. - Henning Stichtenoth; Chaoping Xing (IEEE Trans. Inf. Theory, 2005)

Goppa geometric codes achieving the Gilbert-Varshamov bound. - Chaoping Xing (IEEE Trans. Inf. Theory, 2005)

A construction of binary constant-weight codes from algebraic curves over finite fields. - Chaoping Xing; Jie Ling (IEEE Trans. Inf. Theory, 2005)

An explicit class of codes with good parameters and their duals. - San Ling; Chaoping Xing; Ferruh Özbudak (Discret. Appl. Math., 2006)

Special issue on algebra and coding theory. - Chaoping Xing (Finite Fields Their Appl., 2006)

Asymptotic bounds on quantum codes from algebraic geometry codes. - Keqin Feng; San Ling; Chaoping Xing (IEEE Trans. Inf. Theory, 2006)

Diagonal Lattice Space-Time Codes From Number Fields and Asymptotic Bounds. - Chaoping Xing (IEEE Trans. Inf. Theory, 2007)

New Linear Codes and Algebraic Function Fields Over Finite Fields. - Chaoping Xing; Sze Ling Yeo (IEEE Trans. Inf. Theory, 2007)

Function-field codes. - Dirk Hachenberger; Harald Niederreiter; Chaoping Xing (Appl. Algebra Eng. Commun. Comput., 2008)

Dense packings from quadratic fields and codes. - Chaoping Xing (J. Comb. Theory A, 2008)

A Gilbert-Varshamov type bound for Euclidean packings. - Gabriele Nebe; Chaoping Xing (Math. Comput., 2008)

Access Structures of Elliptic Secret Sharing Schemes. - Hao Chen; San Ling; Chaoping Xing (IEEE Trans. Inf. Theory, 2008)

Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field. - Ignacio Cascudo Pueyo; Hao Chen 095; Ronald Cramer; Chaoping Xing (CRYPTO, 2009)

Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes. - Hao Chen 095; San Ling; Carles Padró; Huaxiong Wang; Chaoping Xing (IMACC, 2009)

Cyclic Codes and Sequences from a Class of Dembowski-Ostrom Functions - Jinquan Luo; San Ling; Chaoping Xing (CoRR, 2009)

Cyclic Codes and Sequences from Kasami-Welch Functions - Jinquan Luo; San Ling; Chaoping Xing (CoRR, 2009)

Multisequences with large linear and k-error linear complexity from Hermitian function fields. - Chaoping Xing; Yang Ding (IEEE Trans. Inf. Theory, 2009)

New constant-weight codes from propagation rules. - Yeow Meng Chee; Chaoping Xing; Sze Ling Yeo (IEEE Trans. Inf. Theory, 2010)

Application of classical hermitian self-orthogonal MDS codes to quantum MDS codes. - Lingfei Jin; San Ling; Jinquan Luo; Chaoping Xing (IEEE Trans. Inf. Theory, 2010)

Generalization of Steane's enlargement construction of quantum codes and applications. - San Ling; Jinquan Luo; Chaoping Xing (IEEE Trans. Inf. Theory, 2010)

Asymmetric quantum codes: characterization and constructions. - Long Wang; Keqin Feng; San Ling; Chaoping Xing (IEEE Trans. Inf. Theory, 2010)

The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing. - Ignacio Cascudo Pueyo; Ronald Cramer; Chaoping Xing (CRYPTO, 2011)

Quantum Gilbert-Varshamov bound through symplectic self-orthogonal codes. - Lingfei Jin; Chaoping Xing (ISIT, 2011)

Structure of functional codes defined on non-degenerate Hermitian varieties. - Frédéric A. B. Edoukou; San Ling; Chaoping Xing (J. Comb. Theory A, 2011)

A Gilbert-Varshamov-type bound for lattice packings. - Chaoping Xing; Sze Ling Yeo (J. Comb. Theory A, 2011)

On Self-Dual Cyclic Codes Over Finite Fields. - Yan Jia 002; San Ling; Chaoping Xing (IEEE Trans. Inf. Theory, 2011)

Asymptotically Good Nonlinear Codes From Algebraic Curves. - Chaoping Xing (IEEE Trans. Inf. Theory, 2011)

A construction of quantum codes via a class of classical polynomial codes. - Lingfei Jin; Chaoping Xing (ISIT, 2012)

Private (t, n) Threshold Searching on Streaming Data. - Xun Yi; Chaoping Xing (SocialCom/PASSAT, 2012)

Cumulative Distance Enumerators of Random Codes and their Thresholds - Yun Fan; San Ling; Hongwei Liu 003; Jing Shen; Chaoping Xing (CoRR, 2012)

Folded Codes from Function Field Towers and Improved Optimal Rate List Decoding. - Venkatesan Guruswami; Chaoping Xing (Electron. Colloquium Comput. Complex., 2012)

List decoding Reed-Solomon, Algebraic-Geometric, and Gabidulin subcodes up to the Singleton bound. - Venkatesan Guruswami; Chaoping Xing (Electron. Colloquium Comput. Complex., 2012)

Bounds on the Threshold Gap in Secret Sharing over Small Fields. - Ignacio Cascudo Pueyo; Ronald Cramer; Chaoping Xing (IACR Cryptol. ePrint Arch., 2012)

The Arithmetic Codex. - Ignacio Cascudo Pueyo; Ronald Cramer; Chaoping Xing (IACR Cryptol. ePrint Arch., 2012)

Constructing irreducible polynomials over finite fields. - San Ling; Enver Ozdemir; Chaoping Xing (Math. Comput., 2012)

Good Linear Codes from Polynomial Evaluations. - Yang Ding; Lingfei Jin; Chaoping Xing (IEEE Trans. Commun., 2012)

Euclidean and Hermitian Self-Orthogonal Algebraic Geometry Codes and Their Application to Quantum Codes. - Lingfei Jin; Chaoping Xing (IEEE Trans. Inf. Theory, 2012)

Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields. - Ignacio Cascudo Pueyo; Ronald Cramer; Chaoping Xing; An Yang (IEEE Trans. Inf. Theory, 2012)

New results on two hypercube coloring problems. - Fang-Wei Fu 001; San Ling; Chaoping Xing (Discret. Appl. Math., 2013)

Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets. - Venkatesan Guruswami; Chaoping Xing (Electron. Colloquium Comput. Complex., 2013)

Hitting Sets for Low-Degree Polynomials with Optimal Density. - Venkatesan Guruswami; Chaoping Xing (Electron. Colloquium Comput. Complex., 2013)

Towards a characterization of subfields of the Deligne-Lusztig function fields. - Alp Bassa; Liming Ma; Chaoping Xing; Sze Ling Yeo (J. Comb. Theory A, 2013)

On the Representability of the Biuniform Matroid. - Simeon Ball; Carles Padró; Zsuzsa Weiner; Chaoping Xing (SIAM J. Discret. Math., 2013)

An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial. - Michael Kaminski; Chaoping Xing (IEEE Trans. Inf. Theory, 2013)

Bounds on the Threshold Gap in Secret Sharing and its Applications. - Ignacio Cascudo Pueyo; Ronald Cramer; Chaoping Xing (IEEE Trans. Inf. Theory, 2013)

Some highlights of Harald Niederreiter's work. - Gerhard Larcher; Friedrich Pillichshammer; Arne Winterhof; Chaoping Xing (Applied Algebra and Number Theory, 2014)

Correcting on curves and highly sound locally correctable codes of high rate. - Yeow Meng Chee; Liyasi Wu; Chaoping Xing (ISIT, 2014)

Optimal Algebraic Manipulation Detection Codes. - Ronald Cramer; Carles Padró; Chaoping Xing (IACR Cryptol. ePrint Arch., 2014)

A relation between embedding degrees and class numbers of binary quadratic forms. - San Ling; Enver Ozdemir; Chaoping Xing (Math. Comput., 2014)

Private Searching on Streaming Data Based on Keyword Frequency. - Xun Yi; Elisa Bertino; Jaideep Vaidya; Chaoping Xing (IEEE Trans. Dependable Secur. Comput., 2014)

Torsion Limits and Riemann-Roch Systems for Function Fields and Applications. - Ignacio Cascudo; Ronald Cramer; Chaoping Xing (IEEE Trans. Inf. Theory, 2014)

Erasure List-Decodable Codes From Random and Algebraic Geometry Codes. - Yang Ding; Lingfei Jin; Chaoping Xing (IEEE Trans. Inf. Theory, 2014)

Natural Generalizations of Threshold Secret Sharing. - Oriol Farràs; Carles Padró; Chaoping Xing; An Yang (IEEE Trans. Inf. Theory, 2014)

A Construction of New Quantum MDS Codes. - Lingfei Jin; Chaoping Xing (IEEE Trans. Inf. Theory, 2014)

Sequences With High Nonlinear Complexity. - Harald Niederreiter; Chaoping Xing (IEEE Trans. Inf. Theory, 2014)

Constructions of block codes from algebraic curves over finite fields. - Liming Ma; Chaoping Xing (Surveys in Combinatorics, 2015)

Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model. - Ronald Cramer; Carles Padró; Chaoping Xing (TCC (1), 2015)

An Improvement on the Hasse-Weil Bound and applications to Character Sums, Cryptography and Coding. - Ronald Cramer; Chaoping Xing (CoRR, 2015)

Efficient list decoding of punctured Reed-Muller codes. - Venkatesan Guruswami; Lingfei Jin; Chaoping Xing (CoRR, 2015)

A new class of rank-metric codes and their list decoding beyond the unique decoding radius. - Chaoping Xing; Chen Yuan 003 (Electron. Colloquium Comput. Complex., 2015)

Optimal rate algebraic list decoding using narrow ray class fields. - Venkatesan Guruswami; Chaoping Xing (J. Comb. Theory A, 2015)

On Secret Sharing with Nonlinear Product Reconstruction. - Ignacio Cascudo; Ronald Cramer; Diego Mirandola; Carles Padró; Chaoping Xing (SIAM J. Discret. Math., 2015)

New Binary Codes From Rational Function Fields. - Lingfei Jin; Chaoping Xing (IEEE Trans. Inf. Theory, 2015)

On the List-Decodability of Random Self-Orthogonal Codes. - Lingfei Jin; Chaoping Xing; Xiande Zhang (IEEE Trans. Inf. Theory, 2015)

On Multi-Point Local Decoding of Reed-Muller Codes. - Ronald Cramer; Chaoping Xing; Chen Yuan 003 (Electron. Colloquium Comput. Complex., 2016)

Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. - Ronald Cramer; Ivan Damgård; Nico Döttling; Irene Giacomelli; Chaoping Xing (IACR Cryptol. ePrint Arch., 2016)

Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs. - Venkatesan Guruswami; Carol Wang; Chaoping Xing (IEEE Trans. Inf. Theory, 2016)

Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack. - Ronald Cramer; Ivan Damgård; Chaoping Xing; Chen Yuan 003 (EUROCRYPT (1), 2017)

Efficiently repairing algebraic geometry codes. - Lingfei Jin; Yuan Luo 003; Chaoping Xing (CoRR, 2017)

Subspace Designs based on Algebraic Function Fields. - Venkatesan Guruswami; Chaoping Xing; Chen Yuan 003 (Electron. Colloquium Comput. Complex., 2017)

On the Closest Vector Problem for Lattices Constructed from Polynomials and Their Cryptographic Applications. - Zhe Li; San Ling; Chaoping Xing; Sze Ling Yeo (IACR Cryptol. ePrint Arch., 2017)

Multipartite Entangled States, Symmetric Matrices, and Error-Correcting Codes. - Keqin Feng; Lingfei Jin; Chaoping Xing; Chen Yuan 003 (IEEE Trans. Inf. Theory, 2017)

Efficiently List-Decodable Punctured Reed-Muller Codes. - Venkatesan Guruswami; Lingfei Jin; Chaoping Xing (IEEE Trans. Inf. Theory, 2017)

New MDS Self-Dual Codes From Generalized Reed - Solomon Codes. - Lingfei Jin; Chaoping Xing (IEEE Trans. Inf. Theory, 2017)

List Decodability of Random Subcodes of Gabidulin Codes. - Shu Liu 004; Chaoping Xing; Chen Yuan 003 (IEEE Trans. Inf. Theory, 2017)

Construction of Sequences With High Nonlinear Complexity From Function Fields. - Yuan Luo 003; Chaoping Xing; Lin You (IEEE Trans. Inf. Theory, 2017)

Asymptotic Gilbert-Varshamov bound on Frequency Hopping. - Xianhua Niu; Chaoping Xing; Chen Yuan 003 (CoRR, 2018)

A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields. - Xianhua Niu; Chaoping Xing (CoRR, 2018)

Lossless dimension expanders via linearized polynomials and subspace designs. - Venkatesan Guruswami; Nicolas Resch; Chaoping Xing (Electron. Colloquium Comput. Complex., 2018)

Amortized Complexity of Information-Theoretically Secure MPC Revisited. - Ignacio Cascudo; Ronald Cramer; Chaoping Xing; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2018)

SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority. - Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Peter Scholl; Chaoping Xing (IACR Cryptol. ePrint Arch., 2018)

Reducing the Key Size of McEliece Cryptosystem from Goppa Codes via Permutations. - Zhe Li; Chaoping Xing; Sze Ling Yeo (IACR Cryptol. ePrint Arch., 2018)

Repairing Algebraic Geometry Codes. - Lingfei Jin; Yuan Luo 003; Chaoping Xing (IEEE Trans. Inf. Theory, 2018)

Algebraic Geometry Codes With Complementary Duals Exceed the Asymptotic Gilbert-Varshamov Bound. - Lingfei Jin; Chaoping Xing (IEEE Trans. Inf. Theory, 2018)

List Decoding of Cover Metric Codes Up to the Singleton Bound. - Shu Liu 004; Chaoping Xing; Chen Yuan 003 (IEEE Trans. Inf. Theory, 2018)

Secure and Efficient Federated Transfer Learning. - Shreya Sharma 002; Chaoping Xing; Yang Liu 165; Yan Kang 001 (IEEE BigData, 2019)

Construction of Optimal Locally Recoverable Codes and Connection with Hypergraph. - Chaoping Xing; Chen Yuan 003 (ICALP, 2019)

Reducing the Key Size of McEliece Cryptosystem from Automorphism-induced Goppa Codes via Permutations. - Zhe Li; Chaoping Xing; Sze Ling Yeo (Public Key Cryptography (2), 2019)

On List Decoding of Insertion and Deletion Errors. - Shu Liu 004; Ivan Tjuawinata; Chaoping Xing (CoRR, 2019)

Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime. - Shu Liu 004; Ivan Tjuawinata; Chaoping Xing (CoRR, 2019)

Optimal repairing schemes for Reed-Solomon codes with alphabet sizes linear in lengths under the rack-aware model. - Lingfei Jin; Gaojun Luo; Chaoping Xing (CoRR, 2019)

Beating the probabilistic lower bound on perfect hashing. - Chaoping Xing; Chen Yuan 003 (Electron. Colloquium Comput. Complex., 2019)

A note on short invertible ring elements and applications to cyclotomic and trinomials number fields. - Thomas Attema; Ronald Cramer; Chaoping Xing (IACR Cryptol. ePrint Arch., 2019)

Asymptotically-Good Arithmetic Secret Sharing over Z/(p^ ell Z) with Strong Multiplication and Its Applications to Efficient MPC. - Ronald Cramer; Matthieu Rambaud; Chaoping Xing (IACR Cryptol. ePrint Arch., 2019)

Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes. - Ronald Cramer; Chaoping Xing (IACR Cryptol. ePrint Arch., 2019)

On the Complexity of Arithmetic Secret Sharing. - Ronald Cramer; Chaoping Xing; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2019)

How Long Can Optimal Locally Repairable Codes Be? - Venkatesan Guruswami; Chaoping Xing; Chen Yuan 003 (IEEE Trans. Inf. Theory, 2019)

Optimal Locally Repairable Codes Via Elliptic Curves. - Xudong Li 005; Liming Ma; Chaoping Xing (IEEE Trans. Inf. Theory, 2019)

Construction of Asymptotically Good Locally Repairable Codes via Automorphism Groups of Function Fields. - Xudong Li 005; Liming Ma; Chaoping Xing (IEEE Trans. Inf. Theory, 2019)

List Decodability of Symbol-Pair Codes. - Shu Liu 004; Chaoping Xing; Chen Yuan 003 (IEEE Trans. Inf. Theory, 2019)

Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes. - Yuan Luo 003; Chaoping Xing; Chen Yuan 003 (IEEE Trans. Inf. Theory, 2019)

New Extension Constructions of Optimal Frequency-Hopping Sequence Sets. - Xianhua Niu; Chaoping Xing (IEEE Trans. Inf. Theory, 2019)

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $ mathbb {Z}/p^k mathbb {Z} $. - Mark Abspoel; Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Matthieu Rambaud; Chaoping Xing; Chen Yuan 003 (ASIACRYPT (3), 2020)

Symmetric uncoded caching schemes with low subpacketization levels. - Tai Do Duc; Shuo Shao; Chaoping Xing (CoRR, 2020)

MPC-enabled Privacy-Preserving Neural Network Training against Malicious Attack. - Ziyao Liu; Ivan Tjuawinata; Chaoping Xing; Kwok-Yan Lam (CoRR, 2020)

The group structures of automorphism groups of elliptic function fields over finite fields and their applications to optimal locally repairable codes. - Liming Ma; Chaoping Xing (CoRR, 2020)

Secure Weighted Aggregation in Federated Learning. - Jiale Guo; Ziyao Liu; Kwok-Yan Lam; Jun Zhao 007; Yiqiang Chen 001; Chaoping Xing (CoRR, 2020)

Optimal rate list decoding over bounded alphabets using algebraic-geometric codes. - Venkatesan Guruswami; Chaoping Xing (Electron. Colloquium Comput. Complex., 2020)

A Secure Federated Transfer Learning Framework. - Yang Liu 165; Yan Kang 001; Chaoping Xing; Tianjian Chen; Qiang Yang 001 (IEEE Intell. Syst., 2020)

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z. - Mark Abspoel; Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Matthieu Rambaud; Chaoping Xing; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2020)

A New Code Based Signature Scheme without Trapdoors. - Zhe Li; Chaoping Xing; Sze Ling Yeo (IACR Cryptol. ePrint Arch., 2020)

Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex. - Ronald Cramer; Chaoping Xing; Chen Yuan 003 (IEEE Trans. Inf. Theory, 2020)

Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields. - Venkatesan Guruswami; Lingfei Jin; Chaoping Xing (IEEE Trans. Inf. Theory, 2020)

Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields. - Lingfei Jin; Liming Ma; Chaoping Xing (IEEE Trans. Inf. Theory, 2020)

On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications. - Zhe Li; San Ling; Chaoping Xing; Sze Ling Yeo (IEEE Trans. Inf. Theory, 2020)

Constructive Asymptotic Bounds of Locally Repairable Codes via Function Fields. - Liming Ma; Chaoping Xing (IEEE Trans. Inf. Theory, 2020)

A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields. - Xianhua Niu; Chaoping Xing; Yang Liu 165; Liang Zhou 003 (IEEE Trans. Inf. Theory, 2020)

Asymptotic Gilbert-Varshamov Bound on Frequency Hopping Sequences. - Xianhua Niu; Chaoping Xing; Chen Yuan 003 (IEEE Trans. Inf. Theory, 2020)

Asymptotically-Good Arithmetic Secret Sharing over $ mathbb {Z}/p^{ ell } mathbb {Z}$ with Strong Multiplication and Its Applications to Efficient MPC. - Ronald Cramer; Matthieu Rambaud; Chaoping Xing (CRYPTO (3), 2021)

A New Metric on Symmetric Group and Application to Block Permutation Codes. - Chaoping Xing; Zihan Zhang 001 (CoRR, 2021)

Maximally recoverable local reconstruction codes from subspace direct sum systems. - Shu Liu 004; Chaoping Xing (CoRR, 2021)

Improved single-round secure multiplication using regenerating codes. - Mark Abspoel; Ronald Cramer; Daniel Escudero 001; Ivan Damgård; Chaoping Xing (IACR Cryptol. ePrint Arch., 2021)

Biometric key generation based on generated intervals and two-layer error correcting technique. - Peiyi Wang; Lin You; Gengran Hu; Liqin Hu; Zhihua Jian; Chaoping Xing (Pattern Recognit., 2021)

Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime. - Tai Do Duc; Shu Liu 004; Ivan Tjuawinata; Chaoping Xing (IEEE Trans. Inf. Theory, 2021)

A New Construction of Nonlinear Codes via Rational Function Fields. - Lingfei Jin; Liming Ma; Chaoping Xing (IEEE Trans. Inf. Theory, 2021)

Efficiently List-Decodable Insertion and Deletion Codes via Concatenation. - Shu Liu 004; Ivan Tjuawinata; Chaoping Xing (IEEE Trans. Inf. Theory, 2021)

More Efficient Dishonest Majority Secure Computation over $ mathbb {Z}_{2^k}$ via Galois Rings. - Daniel Escudero 001; Chaoping Xing; Chen Yuan 003 (CRYPTO (1), 2022)

Upper bounds on maximum lengths of Singleton-optimal locally repairable codes. - Shu Liu 004; Tingyi Wu; Chaoping Xing; Chen Yuan 003 (CoRR, 2022)

Good locally repairable codes via propagation rules. - Shu Liu 004; Liming Ma; Tingyi Wu; Chaoping Xing (CoRR, 2022)

A new construction of nonlinear codes via algebraic function fields. - Shu Liu 004; Liming Ma; Tingyi Wu; Chaoping Xing (CoRR, 2022)

Binary sequences with a low correlation via cyclotomic function fields with odd characteristics. - Lingfei Jin; Liming Ma; Chaoping Xing (CoRR, 2022)

More Efficient Dishonest Majority Secure Computation over ℤ2k via Galois Rings. - Daniel Escudero 001; Chaoping Xing; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2022)

A new framework for deniable secure key exchange. - Shaoquan Jiang; Yeow Meng Chee; San Ling; Huaxiong Wang; Chaoping Xing (Inf. Comput., 2022)

Communication Efficient Secret Sharing With Small Share Size. - Jian Ding 002; Changlu Lin; Huaxiong Wang; Chaoping Xing (IEEE Trans. Inf. Theory, 2022)

Binary Sequences With a Low Correlation via Cyclotomic Function Fields. - Lingfei Jin; Liming Ma; Chaoping Xing (IEEE Trans. Inf. Theory, 2022)

Leakage-Resilient Secret Sharing With Constant Share Size. - Ivan Tjuawinata; Chaoping Xing (IEEE Trans. Inf. Theory, 2022)

Construction of Optimal (r, δ)-Locally Recoverable Codes and Connection With Graph Theory. - Chaoping Xing; Chen Yuan 003 (IEEE Trans. Inf. Theory, 2022)

Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications. - Daniel Escudero 001; Cheng Hong 001; Hongqing Liu; Chaoping Xing; Chen Yuan 003 (ASIACRYPT (1), 2023)

Amortized NISC over $ mathbb {Z}_{2^k}$ from RMFE. - Fuchun Lin; Chaoping Xing; Yizhou Yao; Chen Yuan 003 (ASIACRYPT (1), 2023)

List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2. - Shu Liu 004; Chaoping Xing; Chen Yuan 003 (ICALP, 2023)

Nonlinear codes exceeding the Gilbert-Varshamov and Tsfasman-Vlăduţ-Zink bounds. - Shu Liu 004; Tingyi Wu; Chaoping Xing (SODA, 2023)

Codes with Biochemical Constraints and Single Error Correction for DNA-Based Data Storage. - Shu Liu 004; Chaoping Xing; Yaqian Zhang (CoRR, 2023)

Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications. - Daniel Escudero 001; Hongqing Liu; Chaoping Xing; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2023)

More Efficient Zero-Knowledge Protocols over ℤ2k via Galois Rings. - Fuchun Lin; Chaoping Xing; Yizhou Yao (IACR Cryptol. ePrint Arch., 2023)

Amortized NISC over ℤ2k from RMFE. - Fuchun Lin; Chaoping Xing; Yizhou Yao; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2023)

Ramp hyper-invertible matrices and their applications to MPC protocols. - Hongqing Liu; Chaoping Xing; Yanjiang Yang; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2023)

Dishonest Majority Multiparty Computation over Matrix Rings. - Hongqing Liu; Chaoping Xing; Chen Yuan 003; Taoxu Zou (IACR Cryptol. ePrint Arch., 2023)

The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes. - Liming Ma; Chaoping Xing (J. Comb. Theory A, 2023)

Bounds and Constructions for Insertion and Deletion Codes. - Shu Liu 004; Chaoping Xing (IEEE Trans. Inf. Theory, 2023)

Beating the Probabilistic Lower Bound on q-Perfect Hashing. - Chaoping Xing; Chen Yuan 003 (Comb., 2023)

Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems. - Shu Liu 004; Chaoping Xing (IEEE Trans. Inf. Theory, 2023)

Constructions of k-Uniform States in Heterogeneous Systems. - Keqin Feng; Lingfei Jin; Chaoping Xing; Chen Yuan 003 (IEEE Trans. Inf. Theory, 2023)

A New Construction of Nonlinear Codes via Algebraic Function Fields. - Shu Liu 004; Liming Ma; Ting-Yi Wu; Chaoping Xing (IEEE Trans. Inf. Theory, 2023)

Optimal and Asymptotically Good Locally Repairable Codes via Propagation Rules. - Jin Yi Chen; Shu Liu 004; Liming Ma; Ting-Yi Wu; Chaoping Xing (IEEE Trans. Commun., 2023)

A Lower Bound on the List-Decodability of Insdel Codes. - Shu Liu 004; Ivan Tjuawinata; Chaoping Xing (IEEE Trans. Inf. Theory, 2023)

More Efficient Zero-Knowledge Protocols over $ mathbb {Z}_{2^k}$ via Galois Rings. - Fuchun Lin; Chaoping Xing; Yizhou Yao (CRYPTO (9), 2024)

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. - Zeyu Guo 001; Chaoping Xing; Chen Yuan 003; Zihan Zhang 001 (FOCS, 2024)

Repairing Reed-Solomon Codes with Less Bandwidth. - Shu Liu 004; Yunqi Wan; Chaoping Xing (ISIT, 2024)

Nonlinear Codes with Low Redundancy. - Shu Liu 004; Chaoping Xing (ISIT, 2024)

Asymptotic Construction of Locally Repairable Codes with Multiple Recovering Sets. - Songsong Li; Shu Liu 004; Liming Ma; Yunqi Wan; Chaoping Xing (ISIT, 2024)

Fast Fourier transform via automorphism groups of rational function fields. - Songsong Li; Chaoping Xing (SODA, 2024)

Asymptotic construction of locally repairable codes with multiple recovering sets. - Singsong Li; Shu Liu 004; Liming Ma; Chaoping Xing (CoRR, 2024)

Encoding of algebraic geometry codes with quasi-linear complexity O(N log N). - Songsong Li; Shu Liu 004; Liming Ma; Yunqi Wan; Chaoping Xing (CoRR, 2024)

Algebraic Geometry Codes for Distributed Matrix Multiplication Using Local Expansions. - Jiang Li; Songsong Li; Chaoping Xing (CoRR, 2024)

New families of non-Reed-Solomon MDS codes. - Lingfei Jin; Liming Ma; Chaoping Xing; Haiyan Zhou (CoRR, 2024)

Coded Distributed (Batch) Matrix Multiplication over Galois Ring via RMFE. - Yi Kuang; Jiang Li; Songsong Li; Chaoping Xing (CoRR, 2024)

On Information-Theoretic Secure Multiparty Computation with Local Repairability. - Daniel Escudero 001; Ivan Tjuawinata; Chaoping Xing (IACR Cryptol. ePrint Arch., 2024)

Interactive Line-Point Zero-Knowledge with Sublinear Communication and Linear Computation. - Fuchun Lin; Chaoping Xing; Yizhou Yao (IACR Cryptol. ePrint Arch., 2024)

On Lengths of Singleton-Optimal Locally Repairable Codes. - Shu Liu 004; Ting-Yi Wu; Chaoping Xing; Chen Yuan 003 (IEEE Trans. Commun., 2024)

Binary Sequences With a Low Correlation via Cyclotomic Function Fields of Odd Characteristic. - Xubin Hu; Lingfei Jin; Liming Ma; Chaoping Xing (IEEE Trans. Inf. Theory, 2024)

Evolving Secret Sharing Schemes Based on Polynomial Evaluations and Algebraic Geometry Codes. - Chaoping Xing; Chen Yuan 003 (IEEE Trans. Inf. Theory, 2024)

Explicit Construction of q-Ary 2-Deletion Correcting Codes With Low Redundancy. - Shu Liu 004; Ivan Tjuawinata; Chaoping Xing (IEEE Trans. Inf. Theory, 2024)

Gabidulin Codes Achieve List Decoding Capacity with an Order-Optimal Column-To-Row Ratio. - Zeyu Guo 001; Chaoping Xing; Chen Yuan 003; Zihan Zhang 001 (APPROX/RANDOM, 2025)

Polynomial Commitments for Galois Rings and Applications to SNARKs Over $ mathbb {Z}_{2^k}$. - Yuhao Jia; Songsong Li; Chaoping Xing; Yizhou Yao; Chen Yuan 003 (CRYPTO (6), 2025)

Efficient Pseudorandom Correlation Generators over $ mathbb {Z}/p^k mathbb {Z}$. - Zhe Li; Chaoping Xing; Yizhou Yao; Chen Yuan 003 (CRYPTO (4), 2025)

Efficient Pseudorandom Correlation Generators over ℤ/pkℤ. - Zhe Li; Chaoping Xing; Yizhou Yao; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2025)

Efficient Pseudorandom Correlation Generators for Any Finite Field. - Zhe Li; Chaoping Xing; Yizhou Yao; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2025)

On the Power of Sumcheck in Secure Multiparty Computation. - Zhe Li; Chaoping Xing; Yizhou Yao; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2025)

Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound. - Songsong Li; Shu Liu 004; Liming Ma; Yunqi Wan; Chaoping Xing (CoRR, 2025)

Encoding of Algebraic Geometry Codes With Quasi-Linear Complexity O(NlogN). - Songsong Li; Shu Liu 004; Liming Ma; Yunqi Wan; Chaoping Xing (IEEE Trans. Inf. Theory, 2025)

A New Family of Binary Sequences With Low Correlation via Elliptic Curves. - Lingfei Jin; Liming Ma; Chaoping Xing; Runtian Zhu (IEEE Trans. Inf. Theory, 2025)