Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Articles by Chaoping Xing
Mathematics > Number Theory
The classical Hurwitz bound gives a linear upper bound for automorphism groups of algebraic curves in characteristic zero, whereas algebraic curves in positive characteristic can have much larger automorphism groups. In this article, we firstly investigate the solvable subgroups and $p$-subgroups of $\operatorname{Aut}(F/\mathbb{F}_q)$ where $p=\operatorname{char}(\mathbb{F}_q)$ and $F/\mathbb{F}_q$ is a function field of genus $g_F\ge2$ with full constant field $\mathbb{F}_q$.
Computer Science > Information Theory
Proximity gaps are central to the soundness of interactive oracle proofs of proximity (IOPPs) and polynomial commitment schemes (PCSs). An $[n,k,d]$ linear code $C\subseteq\mathbb F^n$ has a $δ$-proximity gap with error $ε$ if, for every $u_0,u_1\in\mathbb F^n$, either all points on $\ell_{u_0,u_1}=\{u_0+αu_1:α\in\mathbb F\}$ are $δ$-close to $C$, or at most an $ε$ fraction are.
[2411.14779] New families of non-Reed-Solomon MDS codes
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
On Information-Theoretic Secure Multiparty Computation with Local Repairability
Paper 2024/391 , J.P. Morgan AI Research and J.P. Morgan AlgoCRYPT CoE, New York, U.S.A. , Strategic Centre for Research on Privacy-Preserving Technologies and Systems, Nanyang Technological University, Singapore , Shanghai Jiao Tong University, Shanghai, China In this work we consider the task of designing information-theoretic MPC protocols for which the state of a given party can be recovered from a small amount of parties, a property we refer to as local repairability.
Dishonest Majority Multiparty Computation over Matrix Rings
Paper 2023/1912 , Shanghai Jiao Tong University , Shanghai Jiao Tong University , Shanghai Jiao Tong University , Shanghai Jiao Tong University The privacy-preserving machine learning (PPML) has gained growing importance over the last few years. One of the biggest challenges is to improve the efficiency of PPML so that the communication and computation costs of PPML are affordable for large machine learning models such as deep learning.
Ramp hyper-invertible matrices and their applications to MPC protocols
Paper 2023/1369 , Shanghai Jiao Tong University , Huawei International, Singapore , Shanghai Jiao Tong University Beerliová-Trubíniová and Hirt introduced hyper-invertible matrix technique to construct the first perfectly secure MPC protocol in the presence of maximal malicious corruptions $\lfloor \frac{n-1}{3} \rfloor$ with linear communication complexity per multiplication gate [5].
Amortized NISC over $\mathbb{Z}_{2^k}$ from RMFE
Paper 2023/1363 , Shanghai Jiao Tong University , Shanghai Jiao Tong University , Shanghai Jiao Tong University , Shanghai Jiao Tong University Reversed multiplication friendly embedding (RMFE) amortization has been playing an active role in the state-of-the-art constructions of MPC protocols over rings (in particular, the ring $\mathbb{Z}_{2^k}$).
[2306.02868] Explicit Construction of q-ary 2-deletion Correcting Codes with Low Redundancy
[Submitted on 5 Jun 2023 ( v1 ), last revised 9 Jun 2023 (this version, v2)] Title:Explicit Construction of q-ary 2-deletion Correcting Codes with Low Redundancy Download a PDF of the paper titled Explicit Construction of q-ary 2-deletion Correcting Codes with Low Redundancy, by Shu Liu and Ivan Tjuawinata and Chaoping Xing Download PDF Abstract: We consider the problem of efficient construction of q-ary 2-deletion correcting codes with low redundancy.
Degree-$D$ Reverse Multiplication-Friendly Embeddings: Constructions and Applications
Paper 2023/173 Degree-$D$ Reverse Multiplication-Friendly Embeddings: Constructions and Applications , J.P. Morgan , Shanghai Jiao Tong University , Shanghai Jiao Tong University , Shanghai Jiao Tong University Abstract In the recent work of (Cheon & Lee, Eurocrypt'22), the concept of a degree-$D$ packing method was formally introduced, which captures the idea of embedding multiple elements of a smaller ring into a larger ring, so that element-wise multiplication in the former is somewhat...
More Efficient Zero-Knowledge Protocols over $\mathbb{Z}_{2^k}$ via Galois Rings
Paper 2023/150 More Efficient Zero-Knowledge Protocols over $\mathbb{Z}_{2^k}$ via Galois Rings , Shanghai Jiao Tong University , Shanghai Jiao Tong University , Shanghai Jiao Tong University Abstract A recent line of works on zero knowledge (ZK) protocols with a {\em vector oblivious linear function evaluation (VOLE)}-based offline phase provides a new paradigm for scalable ZK protocols with prover memory footprint almost the same as verifying the circuit in the clear.
[2211.06606] A Lower Bound on the List-Decodability of Insdel Codes
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Show More
loading
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with Chaoping
Contact Chaoping, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack