Chaoping Xing

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 148

Top Venues

CoRR

IEEE Trans. Inf. Theory

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

Publications

Daniel Escudero, Ivan Tjuawinata, Chaoping Xing
On Information-Theoretic Secure Multiparty Computation with Local Repairability. IACR Cryptol. ePrint Arch. 2024 (2024)
Songsong Li, Chaoping Xing
Fast Fourier transform via automorphism groups of rational function fields. SODA (2024)
Fuchun Lin, Chaoping Xing, Yizhou Yao
More Efficient Zero-Knowledge Protocols over $\mathbb {Z}_{2^k}$ via Galois Rings. CRYPTO (9) (2024)
Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. CoRR (2024)
Singsong Li, Shu Liu, Liming Ma, Chaoping Xing
Asymptotic construction of locally repairable codes with multiple recovering sets. CoRR (2024)
Xubin Hu, Lingfei Jin, Liming Ma, Chaoping Xing
Binary Sequences With a Low Correlation via Cyclotomic Function Fields of Odd Characteristic. IEEE Trans. Inf. Theory 70 (2) (2024)
Daniel Escudero, Ivan Tjuawinata, Chaoping Xing
On Information-Theoretic Secure Multiparty Computation with Local Repairability. Public Key Cryptography (2) (2024)
Shu Liu, Ting-Yi Wu, Chaoping Xing, Chen Yuan
On Lengths of Singleton-Optimal Locally Repairable Codes. IEEE Trans. Commun. 72 (1) (2024)
Lingfei Jin, Liming Ma, Chaoping Xing, Runtian Zhu
A new family of binary sequences with a low correlation via elliptic curves. CoRR (2024)
Songsong Li, Shu Liu, Liming Ma, Yunqi Wan, Chaoping Xing
Encoding of algebraic geometry codes with quasi-linear complexity O(N log N). CoRR (2024)
Chaoping Xing, Chen Yuan
Evolving Secret Sharing Schemes Based on Polynomial Evaluations and Algebraic Geometry Codes. IEEE Trans. Inf. Theory 70 (5) (2024)
Shu Liu, Ivan Tjuawinata, Chaoping Xing
Explicit Construction of q-Ary 2-Deletion Correcting Codes With Low Redundancy. IEEE Trans. Inf. Theory 70 (6) (2024)
Shu Liu, Liming Ma, Ting-Yi Wu, Chaoping Xing
A New Construction of Nonlinear Codes via Algebraic Function Fields. IEEE Trans. Inf. Theory 69 (9) (2023)
Shu Liu, Chaoping Xing, Chen Yuan
List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2. ICALP (2023)
Chaoping Xing, Chen Yuan
Beating the Probabilistic Lower Bound on q-Perfect Hashing. Comb. 43 (2) (2023)
Hongqing Liu, Chaoping Xing, Chen Yuan, Taoxu Zou
Dishonest Majority Multiparty Computation over Matrix Rings. IACR Cryptol. ePrint Arch. 2023 (2023)
Songsong Li, Chaoping Xing
Fast Fourier transform via automorphism groups of rational function fields. CoRR (2023)
Shu Liu, Ivan Tjuawinata, Chaoping Xing
Explicit Construction of q-ary 2-deletion Correcting Codes with Low Redundancy. CoRR (2023)
Liming Ma, Chaoping Xing
The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes. J. Comb. Theory, Ser. A 193 (2023)
Hongqing Liu, Chaoping Xing, Yanjiang Yang, Chen Yuan
Ramp hyper-invertible matrices and their applications to MPC protocols. IACR Cryptol. ePrint Arch. 2023 (2023)
Daniel Escudero, Hongqing Liu, Chaoping Xing, Chen Yuan
Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications. IACR Cryptol. ePrint Arch. 2023 (2023)
Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan
Constructions of k-Uniform States in Heterogeneous Systems. IEEE Trans. Inf. Theory 69 (9) (2023)
Jin Yi Chen, Shu Liu, Liming Ma, Ting-Yi Wu, Chaoping Xing
Optimal and Asymptotically Good Locally Repairable Codes via Propagation Rules. IEEE Trans. Commun. 71 (10) (2023)
Shu Liu, Tingyi Wu, Chaoping Xing
Nonlinear codes exceeding the Gilbert-Varshamov and Tsfasman-Vlăduţ-Zink bounds. SODA (2023)
Hongqing Liu, Chaoping Xing, Yanjiang Yang, Chen Yuan
Ramp Hyper-invertible Matrices and Their Applications to MPC Protocols. ASIACRYPT (1) (2023)
Shu Liu, Chaoping Xing
Bounds and Constructions for Insertion and Deletion Codes. IEEE Trans. Inf. Theory 69 (2) (2023)
Shu Liu, Chaoping Xing
Nonlinear Codes with Low Redundancy. CoRR (2023)
Fuchun Lin, Chaoping Xing, Yizhou Yao, Chen Yuan
Amortized NISC over $\mathbb {Z}_{2^k}$ from RMFE. ASIACRYPT (1) (2023)
Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan
Constructions of k-uniform states in heterogeneous systems. CoRR (2023)
Fuchun Lin, Chaoping Xing, Yizhou Yao, Chen Yuan
from RMFE. IACR Cryptol. ePrint Arch. 2023 (2023)
Fuchun Lin, Chaoping Xing, Yizhou Yao
via Galois Rings. IACR Cryptol. ePrint Arch. 2023 (2023)
Shu Liu, Ivan Tjuawinata, Chaoping Xing
A Lower Bound on the List-Decodability of Insdel Codes. IEEE Trans. Inf. Theory 69 (11) (2023)
Shu Liu, Chaoping Xing
Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems. IEEE Trans. Inf. Theory 69 (4) (2023)
Daniel Escudero, Cheng Hong, Hongqing Liu, Chaoping Xing, Chen Yuan
Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications. ASIACRYPT (1) (2023)
Shu Liu, Chaoping Xing, Yaqian Zhang
Codes with Biochemical Constraints and Single Error Correction for DNA-Based Data Storage. CoRR (2023)
Shu Liu, Tingyi Wu, Chaoping Xing, Chen Yuan
Upper bounds on maximum lengths of Singleton-optimal locally repairable codes. CoRR (2022)
Shaoquan Jiang, Yeow Meng Chee, San Ling, Huaxiong Wang, Chaoping Xing
A new framework for deniable secure key exchange. Inf. Comput. 285 (Part) (2022)
Daniel Escudero, Chaoping Xing, Chen Yuan
via Galois Rings. IACR Cryptol. ePrint Arch. 2022 (2022)
Shu Liu, Ivan Tjuawinata, Chaoping Xing
A Lower Bound on the List-Decodability of Insdel Codes. CoRR (2022)
Lingfei Jin, Liming Ma, Chaoping Xing
Binary sequences with a low correlation via cyclotomic function fields with odd characteristics. CoRR (2022)
Jian Ding, Changlu Lin, Huaxiong Wang, Chaoping Xing
Communication Efficient Secret Sharing With Small Share Size. IEEE Trans. Inf. Theory 68 (1) (2022)
Venkatesan Guruswami, Chaoping Xing
Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes. J. ACM 69 (2) (2022)
Lingfei Jin, Liming Ma, Chaoping Xing
Binary Sequences With a Low Correlation via Cyclotomic Function Fields. IEEE Trans. Inf. Theory 68 (5) (2022)
Shu Liu, Liming Ma, Tingyi Wu, Chaoping Xing
Good locally repairable codes via propagation rules. CoRR (2022)
Chaoping Xing, Chen Yuan
Construction of Optimal (r, δ)-Locally Recoverable Codes and Connection With Graph Theory. IEEE Trans. Inf. Theory 68 (7) (2022)
Daniel Escudero, Chaoping Xing, Chen Yuan
More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings. CRYPTO (1) (2022)
Shu Liu, Liming Ma, Tingyi Wu, Chaoping Xing
A new construction of nonlinear codes via algebraic function fields. CoRR (2022)
Ivan Tjuawinata, Chaoping Xing
Leakage-Resilient Secret Sharing With Constant Share Size. IEEE Trans. Inf. Theory 68 (12) (2022)
Ivan Tjuawinata, Chaoping Xing
Leakage-Resilient Secret Sharing with Constant Share Size. CoRR (2021)
Venkatesan Guruswami, Nicolas Resch, Chaoping Xing
Lossless Dimension Expanders Via Linearized Polynomials and Subspace Designs. Comb. 41 (4) (2021)
Shu Liu, Ivan Tjuawinata, Chaoping Xing
Efficiently List-Decodable Insertion and Deletion Codes via Concatenation. IEEE Trans. Inf. Theory 67 (9) (2021)
Ronald Cramer, Matthieu Rambaud, Chaoping Xing
Asymptotically-Good Arithmetic Secret Sharing over $\mathbb {Z}/p^{\ell }\mathbb {Z}$ with Strong Multiplication and Its Applications to Efficient MPC. CRYPTO (3) (2021)
Mark Abspoel, Ronald Cramer, Daniel Escudero, Ivan Damgård, Chaoping Xing
Improved Single-Round Secure Multiplication Using Regenerating Codes. ASIACRYPT (2) (2021)
Tai Do Duc, Shu Liu, Ivan Tjuawinata, Chaoping Xing
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime. IEEE Trans. Inf. Theory 67 (5) (2021)
Lingfei Jin, Liming Ma, Chaoping Xing
Binary sequences with low correlation via cyclotomic function fields. CoRR (2021)
Chaoping Xing, Chen Yuan
Beating the probabilistic lower bound on perfect hashing. SODA (2021)
Lingfei Jin, Liming Ma, Chaoping Xing
A New Construction of Nonlinear Codes via Rational Function Fields. IEEE Trans. Inf. Theory 67 (2) (2021)
Chaoping Xing, Zihan Zhang
A New Metric on Symmetric Group and Application to Block Permutation Codes. CoRR (2021)
Chaoping Xing, Chen Yuan
Evolving Secret Sharing Schemes Based on Polynomial Evaluations and Algebraic Geometry Codes. IACR Cryptol. ePrint Arch. 2021 (2021)
Shu Liu, Chaoping Xing
Maximally recoverable local reconstruction codes from subspace direct sum systems. CoRR (2021)
Shu Liu, Chaoping Xing
Bounds and Constructions for Insertion and Deletion Codes. CoRR (2021)
Mark Abspoel, Ronald Cramer, Daniel Escudero, Ivan Damgård, Chaoping Xing
Improved single-round secure multiplication using regenerating codes. IACR Cryptol. ePrint Arch. 2021 (2021)
Peiyi Wang, Lin You, Gengran Hu, Liqin Hu, Zhihua Jian, Chaoping Xing
Biometric key generation based on generated intervals and two-layer error correcting technique. Pattern Recognit. 111 (2021)
Venkatesan Guruswami, Chaoping Xing
Optimal rate list decoding over bounded alphabets using algebraic-geometric codes. Electron. Colloquium Comput. Complex. 27 (2020)
Liming Ma, Chaoping Xing
Constructive Asymptotic Bounds of Locally Repairable Codes via Function Fields. IEEE Trans. Inf. Theory 66 (9) (2020)
Ronald Cramer, Chaoping Xing, Chen Yuan
On the Complexity of Arithmetic Secret Sharing. TCC (3) (2020)
Yang Liu, Yan Kang, Chaoping Xing, Tianjian Chen, Qiang Yang
A Secure Federated Transfer Learning Framework. IEEE Intell. Syst. 35 (4) (2020)
Lingfei Jin, Liming Ma, Chaoping Xing
Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields. IEEE Trans. Inf. Theory 66 (1) (2020)
Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $. ASIACRYPT (3) (2020)
Liming Ma, Chaoping Xing
The group structures of automorphism groups of elliptic function fields over finite fields and their applications to optimal locally repairable codes. CoRR (2020)
Ziyao Liu, Ivan Tjuawinata, Chaoping Xing, Kwok-Yan Lam
MPC-enabled Privacy-Preserving Neural Network Training against Malicious Attack. CoRR (2020)
Xianhua Niu, Chaoping Xing, Yang Liu, Liang Zhou
A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields. IEEE Trans. Inf. Theory 66 (8) (2020)
Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z. IACR Cryptol. ePrint Arch. 2020 (2020)
Ronald Cramer, Chaoping Xing, Chen Yuan
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex. IEEE Trans. Inf. Theory 66 (1) (2020)
Xianhua Niu, Chaoping Xing, Chen Yuan
Asymptotic Gilbert-Varshamov Bound on Frequency Hopping Sequences. IEEE Trans. Inf. Theory 66 (2) (2020)
Ronald Cramer, Chaoping Xing
Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes. EUROCRYPT (1) (2020)
Venkatesan Guruswami, Lingfei Jin, Chaoping Xing
Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields. IEEE Trans. Inf. Theory 66 (10) (2020)
Zhe Li, San Ling, Chaoping Xing, Sze Ling Yeo
On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications. IEEE Trans. Inf. Theory 66 (4) (2020)
Tai Do Duc, Shuo Shao, Chaoping Xing
Symmetric uncoded caching schemes with low subpacketization levels. CoRR (2020)
Jiale Guo, Ziyao Liu, Kwok-Yan Lam, Jun Zhao, Yiqiang Chen, Chaoping Xing
Secure Weighted Aggregation in Federated Learning. CoRR (2020)
Zhe Li, Chaoping Xing, Sze Ling Yeo
A New Code Based Signature Scheme without Trapdoors. IACR Cryptol. ePrint Arch. 2020 (2020)
Yuan Luo, Chaoping Xing, Chen Yuan
Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes. IEEE Trans. Inf. Theory 65 (2) (2019)
Ronald Cramer, Matthieu Rambaud, Chaoping Xing
Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPC. IACR Cryptol. ePrint Arch. 2019 (2019)
Xudong Li, Liming Ma, Chaoping Xing
Optimal Locally Repairable Codes Via Elliptic Curves. IEEE Trans. Inf. Theory 65 (1) (2019)
Venkatesan Guruswami, Chaoping Xing, Chen Yuan
How Long Can Optimal Locally Repairable Codes Be? IEEE Trans. Inf. Theory 65 (6) (2019)
Shu Liu, Ivan Tjuawinata, Chaoping Xing
On List Decoding of Insertion and Deletion Errors. CoRR (2019)
Liming Ma, Chaoping Xing
Constructive asymptotic bounds of locally repairable codes via function fields. CoRR (2019)
Xianhua Niu, Chaoping Xing
New Extension Constructions of Optimal Frequency-Hopping Sequence Sets. IEEE Trans. Inf. Theory 65 (9) (2019)
Zhe Li, Chaoping Xing, Sze Ling Yeo
Reducing the Key Size of McEliece Cryptosystem from Automorphism-induced Goppa Codes via Permutations. Public Key Cryptography (2) (2019)
Shreya Sharma, Chaoping Xing, Yang Liu, Yan Kang
Secure and Efficient Federated Transfer Learning. CoRR (2019)
Chaoping Xing, Chen Yuan
Beating the probabilistic lower bound on perfect hashing. Electron. Colloquium Comput. Complex. 26 (2019)
Lingfei Jin, Gaojun Luo, Chaoping Xing
Optimal repairing schemes for Reed-Solomon codes with alphabet sizes linear in lengths under the rack-aware model. CoRR (2019)
Chaoping Xing, Chen Yuan
Beating the probabilistic lower bound on perfect hashing. CoRR (2019)
Shreya Sharma, Chaoping Xing, Yang Liu, Yan Kang
Secure and Efficient Federated Transfer Learning. IEEE BigData (2019)
Lingfei Jin, Liming Ma, Chaoping Xing
A new construction of nonlinear codes via rational function fields. CoRR (2019)
Xudong Li, Liming Ma, Chaoping Xing
Construction of Asymptotically Good Locally Repairable Codes via Automorphism Groups of Function Fields. IEEE Trans. Inf. Theory 65 (11) (2019)
Ronald Cramer, Chaoping Xing
Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes. IACR Cryptol. ePrint Arch. 2019 (2019)
Chaoping Xing, Chen Yuan
Construction of Optimal Locally Recoverable Codes and Connection with Hypergraph. ICALP (2019)
Ronald Cramer, Chaoping Xing, Chen Yuan
On the Complexity of Arithmetic Secret Sharing. IACR Cryptol. ePrint Arch. 2019 (2019)
Shu Liu, Ivan Tjuawinata, Chaoping Xing
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime. CoRR (2019)

Chaoping Xing.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Chaoping Xing