Hao Chen

Affiliations:
  • East China Normal University, Software Engineering Institute, Shanghai, China
  • Fudan University, Department of Computing and Information Technology, Shanghai, China (former)


According to our database1, Hao Chen authored at least 15 papers between 2005 and 2011.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
Restricted Parameter Range Promise Set Cover Problems Are Easy
CoRR, 2011

2010
Strongly Resilient Non-Interactive Key Predistribution For Hierarchical Networks
CoRR, 2010

Efficient compromising resilient authentication schemes for large scale wireless sensor networks.
Proceedings of the Third ACM Conference on Wireless Network Security, 2010

2009
CRT-Based High-Speed Parallel Architecture for Long BCH Encoding.
IEEE Trans. Circuits Syst. II Express Briefs, 2009

Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes.
Proceedings of the Cryptography and Coding, 2009

Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over <i>Any</i> Fixed Finite Field.
Proceedings of the Advances in Cryptology, 2009

2008
Constructing quantum codes.
Frontiers Comput. Sci. China, 2008

Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves.
Proceedings of the Advances in Cryptology, 2008

2007
Secure Computation from Random Error Correcting Codes.
Proceedings of the Advances in Cryptology, 2007

2006
Reducing the Computation of Linear Complexities of Periodic Sequences Over GF(p<sup>m</sup>).
IEEE Trans. Inf. Theory, 2006

MDS Ideal Secret Sharing Scheme from AG-codes on Elliptic Curves
CoRR, 2006

Linear Secret Sharing from Algebraic-Geometric Codes
CoRR, 2006

Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields.
Proceedings of the Advances in Cryptology, 2006

2005
Quantum codes from concatenated algebraic-geometric codes.
IEEE Trans. Inf. Theory, 2005

Fast algorithms for determining the linear complexity of sequences over GF(p<sup>m</sup>) with period 2<sup>t</sup>n.
IEEE Trans. Inf. Theory, 2005


  Loading...