| Verifiable （ t, n） Threshold Signature Scheme Based on Elliptic Curve |
| |
| 引用本文： | WANGHua-qun ZHAOJun-xi ZHANGLi-jun. Verifiable （ t, n） Threshold Signature Scheme Based on Elliptic Curve[J]. 武汉大学学报:自然科学英文版, 2005, 10(1): 165-168. DOI: 10.1007/BF02828641 |
| |
| 作者姓名： | WANGHua-qun ZHAOJun-xi ZHANGLi-jun |
| |
| 作者单位： | [1]InformationEngineeringDepartment,NanjingUniversityofPostsandTelecommunications,Nanjing210003,Jiangshu,China; [2]AppliedMathematicsandPhysicsDepartment,NanjingUniversityofPostsandTelecommunications,Nanjing210003,Jiangshu,China |
| |
| 摘 要： | Based on the difficulty of solving the ECDLP (elliptic curve discrete logarithm problem) on the finite field, we present a (t, n) threshold signature scheme and a verifiable key agreement scheme without trusted party. Applying a modified elliptic curve signature equation, we get a more efficient signature scheme than the existing ECDSA (ellipticcurve digital signature algorithm) from the computability and security view. Our scheme has a shorter key, faster computation, and better security.
|
| 关 键 词： | 域值签名 密码共享 椭圆曲线离散算法 椭圆曲线签名方程 计算机安全 网络安全 |
| 收稿时间： | 2004-05-10 |
| 修稿时间： | 2004-05-10 |
Verifiable (t, n) threshold signature scheme based on elliptic curve |
| |
| Wang Hua-qun,Zhao Jun-xi,Zhang Li-jun. Verifiable (t, n) threshold signature scheme based on elliptic curve[J]. Wuhan University Journal of Natural Sciences, 2005, 10(1): 165-168. DOI: 10.1007/BF02828641 |
| |
| Authors: | Wang Hua-qun Zhao Jun-xi Zhang Li-jun |
| |
| Affiliation: | (1) Information Engineering Department, Nanjing University of Posts and Telecommunications, 210003, Jiangshu Nanjing, China;(2) Applied Mathematics and Physics Department, Nanjing University of Posts and Telecommunications, 210003, Jiangshu Nanjing, China |
| |
| Abstract: | Based on the difficulty of solving the ECDLP (elliptic curve discrete logarithm problem) on the finite field, we present a (t, n) threshold signature scheme and a verifible key agreement scheme without trusted party. Applying a modified clliptic curve signature equation, we get a more efficient signature scheme than the existing ECDSA (elliptic curve digital signature algorithm) from the computability and security view. Our scheme has a shorter key, faster computation, and better security. Based on the difficulty of solving the ECDLP (elliptic curve discre logarithm problem) on the finite field, we present a (t, n) threshold signature scheme and a verifiable key agreement scheme without trusted party. Applying a modified clliptic curve signature equation, we get a more efficient signature scheme than the existing ECDSA (elliptic curve digital signature algorithm) form the computability and security view. Our scheme has a shorter key, faster computation, and better security. Foundation item: Supported by the National Natural Science Foundation of China (10171087) Biography: Wang Hua-qun (1974-), male, Ph. D candidate, research direction: ad hoe network and information security. Foundation item: Supported by the National Natural Science Foundation of China (10171087) Biography: Wang Hua-qun (1974-), male, Ph. D candilate, research direction: ad hoe network and information security. |
| |
| Keywords: | threshold signature secret sharing elliptic curve elliptic curve discrete logarithm |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
|
