椭圆曲线上可选子密钥的秘密共享方案  

A Self-Selecting Sub-Secret Key Sharing Scheme over Elliptic Curves

作　　者：汪彩梅[1] 李正茂[1] 

机构地区：[1]合肥学院网络与智能信息处理重点实验室,安徽合肥230601

出　　处：《计算机工程与科学》2009年第9期23-24,82,共3页Computer Engineering & Science

基　　金：安徽省教育厅青年教师科研资助计划(2008jq1129);合肥学院自然科学基金资助项目(08KY013ZR)

摘　　要：传统的秘密共享方案一般都存在每个成员的子密钥都是由一个可信中心所分发及子密钥不能重复使用的问题。这些问题给实际应用带来了诸多不便,并且n个子密钥仅用来共享一个主密钥在资源上也是一种浪费。本文利用椭圆曲线离散对数的难解性提出了一种多项式形式的可选子密钥的秘密共享方案,该方案中由参与者自己选取子密钥,且子密钥可以重复使用,实现过程中解决了检验子密钥的真伪问题。The traditional secret sharing scheme generally shows that in each member＇s sub-secret keys are distributed by the certification center, and the sub-secret keys can not be used repeatedly. Both problems give the practical applications a lot of inconvenience, and it is a waste for n sub-secret keys to be used to share a master key in terms of resources. Based on the difficulty of elliptic curve discrete logarithm, this paper presentsself-selecting sub-secret key sharing scheme with a polynomial form. The scheme selects the participants in their own sub-key, which can be reused, the realization of the process for solving the key sub-secret keys verifies the authenticity of the problem.

关 键 词：秘密共享 可信中心 子密钥 椭圆曲线离散对数问题 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]