首页 | 本学科首页   官方微博 | 高级检索  
     

椭圆曲线上多项式形式的动态密钥共享方案*
引用本文:殷新春,汪彩梅,王圆圆. 椭圆曲线上多项式形式的动态密钥共享方案*[J]. 计算机应用研究, 2007, 24(7): 123-124
作者姓名:殷新春  汪彩梅  王圆圆
作者单位:扬州大学,计算机科学与工程系,江苏,扬州,225009
摘    要:基于椭圆曲线上多项式的性质,改进了文献[5]中的密钥共享方案,提出了基于多项式形式的椭圆曲线动态密钥共享方案.本方案不仅有效地减少了CA与参与者之间的通信量,而且实现过程中解决了检验子密钥的真伪问题,防止了CA与参与者任何一方的欺诈行为.两种方案的安全性都是基于椭圆曲线离散对数问题的难解性.

关 键 词:多项式  动态密钥共享  子密钥  椭圆曲线离散对数问题  椭圆曲线离散对数问题  多项式  动态密钥  共享方案  Elliptic Curve  Polynomials  Based  Secret Sharing Scheme  安全性  欺诈行为  真伪问题  子密钥  检验  过程  通信量  文献  改进  性质
文章编号:1001-3695(2007)07-0123-02
修稿时间:2006-01-072006-07-07

Dynamic Secret Sharing Scheme Based on Polynomials over Elliptic Curve
YIN Xin chun,WANG Cai mei,WANG Yuan yuan. Dynamic Secret Sharing Scheme Based on Polynomials over Elliptic Curve[J]. Application Research of Computers, 2007, 24(7): 123-124
Authors:YIN Xin chun  WANG Cai mei  WANG Yuan yuan
Affiliation:(Dept. of Computer Science & Engineering, Yangzhou University, Yangzhou Jiangsu 225009, China)
Abstract:Based on properties of polynomials over elliptic curve,this paper presented a dynamic secret sharing scheme based on polynomials,an improvement of scheme in reference [5] and reduced the communication between CA and participants.Furthermore,this scheme is able to check the validity of the sub-secret keys easily and then avoid cheat from either CA or participants efficiently.Both of their security are based on the intractability of elliptic curve discrete logarithm problem.
Keywords:polynomial  dynamic secret sharing scheme  sub-key  elliptic curve discrete logarithm problem
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号