Chen Yuan

Yihan Zhang

IEEE Trans. Inf. Theory, September, 2024

Threshold Rates of Code Ensembles: Linear Is Best.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, July, 2024

Evolving Secret Sharing Schemes Based on Polynomial Evaluations and Algebraic Geometry Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, May, 2024

On Lengths of Singleton-Optimal Locally Repairable Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., January, 2024

Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes.

[BibT_eX]

[DOI]

CoRR, 2024

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric.

[BibT_eX]

[DOI]

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Constructions of k-Uniform States in Heterogeneous Systems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, September, 2023

Beating the Probabilistic Lower Bound on q-Perfect Hashing.

[BibT_eX]

[DOI]

Comb., April, 2023

Dishonest Majority Multiparty Computation over Matrix Rings.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Ramp hyper-invertible matrices and their applications to MPC protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Amortized NISC over ℤ2k from RMFE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes.

[BibT_eX]

[DOI]

Yihan Zhang

CoRR, 2023

List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Amortized NISC over $\mathbb {Z}_{2^k}$ from RMFE.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022

Construction of Optimal (r, δ)-Locally Recoverable Codes and Connection With Graph Theory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

More Efficient Dishonest Majority Secure Computation over ℤ2k via Galois Rings.

[BibT_eX]

[DOI]

Daniel Escudero

IACR Cryptol. ePrint Arch., 2022

Upper bounds on maximum lengths of Singleton-optimal locally repairable codes.

[BibT_eX]

[DOI]

CoRR, 2022

Threshold Rates of Codes Ensembles: Linear is Best.

[BibT_eX]

[DOI]

CoRR, 2022

More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings.

[BibT_eX]

[DOI]

Daniel Escudero

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021

Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

2020

Asymptotic Gilbert-Varshamov Bound on Frequency Hopping Sequences.

[BibT_eX]

[DOI]

Xianhua Niu

IEEE Trans. Inf. Theory, 2020

Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex.

[BibT_eX]

[DOI]

Ronald Cramer

IEEE Trans. Inf. Theory, 2020

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries.

[BibT_eX]

[DOI]

Serge Fehr

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019

Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes.

[BibT_eX]

[DOI]

Yuan Luo

IEEE Trans. Inf. Theory, 2019

List Decodability of Symbol-Pair Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

How Long Can Optimal Locally Repairable Codes Be?

[BibT_eX]

[DOI]

Venkatesan Guruswami

IEEE Trans. Inf. Theory, 2019

Robust Secret Sharing with Optimal Share Size and Security Against Rushing Adversaries.

[BibT_eX]

[DOI]

Serge Fehr

IACR Cryptol. ePrint Arch., 2019

Towards optimal robust secret sharing with security against a rushing adversary.

[BibT_eX]

[DOI]

Serge Fehr

IACR Cryptol. ePrint Arch., 2019

On the Complexity of Arithmetic Secret Sharing.

[BibT_eX]

[DOI]

Ronald Cramer

IACR Cryptol. ePrint Arch., 2019

Efficient Information-Theoretic Secure Multiparty Computation over ℤ/pk ℤ via Galois Rings.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Beating the probabilistic lower bound on perfect hashing.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2019

Construction of Optimal Locally Recoverable Codes and Connection with Hypergraph.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

List Decoding of Cover Metric Codes Up to the Singleton Bound.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Amortized Complexity of Information-Theoretically Secure MPC Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Asymptotic Gilbert-Varshamov bound on Frequency Hopping.

[BibT_eX]

[DOI]

Xianhua Niu

CoRR, 2018

2017

List Decodability of Random Subcodes of Gabidulin Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Multipartite Entangled States, Symmetric Matrices, and Error-Correcting Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Linear Tail-Biting Trellis and Its Sectionalization.

[BibT_eX]

[DOI]

Ya-Li Liu

J. Inf. Sci. Eng., 2017

Subspace Designs based on Algebraic Function Fields.

[BibT_eX]

[DOI]

Venkatesan Guruswami

Electron. Colloquium Comput. Complex., 2017

Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016

On Multi-Point Local Decoding of Reed-Muller Codes.

[BibT_eX]

[DOI]

Ronald Cramer