1. Chen, H., & Cramer, R. (2006, August). Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. InAnnual International Cryptology Conference(pp. 521-536). Springer, Berlin, Heidelberg.2. Chen, H., Ling, S., & Xing, C. (2001). Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound.IEEE Transactions on Information Theory,47(5), 2055-2058.3. Chen, H., Seeley, C., & Yau, S. S. T. (2000). Algebraic determination of isomorphism classes of the moduli algebras of ̃E_6 singularities.Mathematische Annalen,318(4), 637-666.4. Chen, H. (2000). On the minimum distances of Schubert codes.IEEE Transactions on Information Theory,46(4), 1535-1538.5. Chen, H. (1999). Nonexistence of Negative Weight Derivations on Graded Artin Algebras: A Conjecture of Halperin.Journal of Algebra,216(1), 1-12.6. Chen, H. (1999). On minimum Lee weights of Hensel lifts of some binary BCH codes.IEEE Transactions on Information Theory,45(6), 2157-2162.7. Chen, H. (2001). Necessary conditions for the efficient simulation of Hamiltonians using local unitary operations.arXiv preprint quant-ph/0109115.8. Chen, H., Cramer, R., Goldwasser, S., De Haan, R., & Vaikuntanathan, V. (2007, May). Secure computation from random error correcting codes. InAnnual International Conference on the Theory and Applications of Cryptographic Techniques(pp. 291-310). Springer, Berlin, Heidelberg.
