基于椭圆曲线的门限多重秘密共享方案  

A Threshold Multiple Secret Sharing Scheme Based on the Elliptic Curve

作　　者：吴开贵[1] 刘东[1] 冯永[1] 

机构地区：[1]重庆大学计算机学院,重庆400044

出　　处：《计算机科学》2006年第3期97-98,270,共3页Computer Science

基　　金：本文受国家自然科学基金(No.30400446)资助

摘　　要：本文基于椭圆曲线密码系统,即椭圆曲线离散对数问题(ECDLP)的难解性,提出了一个安全性更强的门限多重秘密共享方案。该方案具有以下特点:相对于传统的基于大数分解和离散对数体制,在子秘密长度及安全性等方面更具优势:无需更改参与者的子秘密实现任意多个秘密共享;提供了验证机制防止秘密分发者欺诈以及参与者之间的相互欺诈,避免了以往很多方案中交互信息量大,秘密分发者计算量大的缺点。Based on the elliptic curve and the security of ECDLP,a threshold multiple secret sharing scheme is proposed in this paper. The scheme has the following characteristics： the shorter key length and shorter signature length can be used than the scheme based on Factorization and Discrete Logarithm Problem. The shares can be repeatedly used for the reconstruction of multiple secrets. The verification is offered to avoid the cheating of dealer and the cheating between participants. At the same time, the less interactive information and less computation can be used than the last schemes.

关 键 词：椭圆曲线密码系统 椭圆曲线数字签名 秘密共享 门限方案 多重秘密共享 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构] TN918.1[自动化与计算机技术—计算机科学与技术]