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

摘要：

Traditional secret sharing scheme generally exists two shortages:each participants 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.

关键词： secret sharing Certification Center subsecret keys elliptic curve discrete logarithm problem

作者: Wang Caimei Li Zhengmao

作者单位: Hefei University Key Laboratory of Network and Intelligent Information Processing Hefei China

会议类型: 国际会议

会议名称: The Fifth International Conference on Information Assurance and Security(第五届信息保障与安全国际会议)

会议地点: 西安

会议语种:英文

页码: 734-737

在线出版日期: 2009-08-18（万方平台首次上网日期，不代表论文的发表时间）