| Verifiable (t, n) Threshold Signature Scheme Based on Elliptic Curve |
| |
| 作者姓名： | WANG Hua-qun ZHAO Jun-xi ZHANG Li-jun .Information Engineering |
| |
| 作者单位： | WANG Hua-qun1，ZHAO Jun-xi2，ZHANG Li-jun 11.Information Engineering Department，Nanjing University of Posts and Telecommunications，Nanjing 210003，Jiangshu，China; 2.Applied Mathematics and Physics Department，Nanjing University of Posts and Telecommunications，Nanjing 210003，Jiangshu，China |
| |
| 基金项目： | SupportedbytheNationalNaturalScienceFoundationofChina(10171087) |
| |
| 摘 要： | 0 IntroductionI t’s very important to assure the security of the keys inmany applied fields. A critical technique to prevent the keyfrom leaking is to adopt the threshold cryptosystem. It wasfirst introduced by Shamir in 19791] and by Desmedt in19872]. In this system, each group, instead of each groupmember, publishes a single group public key. The received ci phertext can only be deciphered properly when the number ofparticipating group members is larger than or equal …
|
Verifiable (t, n) Threshold Signature Scheme Based on Elliptic Curve |
| |
| 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 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 (elliptic curve digital signature algorithm) from the computability and security view. Our scheme has a shorter key, faster computation, and better security. |
| |
| Keywords: | threshold signature secret sharing elliptic curve elliptic curve discrete logarithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
