椭圆曲线上多项式形式的动态密钥共享方案  

Dynamic Secret Sharing Scheme Based on Polynomials over Elliptic Curve

作　　者：殷新春[1] 汪彩梅[1] 王圆圆[1] 

机构地区：[1]扬州大学计算机科学与工程系,江苏扬州225009

出　　处：《计算机应用研究》2007年第7期123-124,共2页Application Research of Computers

基　　金：国家自然科学基金资助项目(60473012)

摘　　要：基于椭圆曲线上多项式的性质,改进了文献[5]中的密钥共享方案,提出了基于多项式形式的椭圆曲线动态密钥共享方案。本方案不仅有效地减少了CA与参与者之间的通信量,而且实现过程中解决了检验子密钥的真伪问题,防止了CA与参与者任何一方的欺诈行为。两种方案的安全性都是基于椭圆曲线离散对数问题的难解性。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.

关 键 词：多项式 动态密钥共享 子密钥 椭圆曲线离散对数问题 

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