Self-selecting Sub-secret Keys Sharing Scheme Based on Polynomials over Elliptic Curve

摘要

Traditional secret sharing scheme generally exists two shortages:each participant's sub-secret key is distributed by the certification center; the sub-secret keys can not be repeated to use. Both shortages brought to the practical application a lot of inconvenience, and n sub-secret keys can only be used to share a master key in terms of resources is a waste. This article based on the reference [6] proposed a scheme with sub-secret keys be selected by participants, and those sub-secret keys can be reused. The scheme based on the security of elliptic curve discrete most of the difficult nature is more practical than the reference [6], and the realization of the process can solve the problem about the authenticity of the sub-secret keys.