Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
473334 | Computers & Mathematics with Applications | 2008 | 6 Pages |
Abstract
A multiple secret sharing scheme can share a group of secrets in each sharing session; this scheme is deemed to be very useful in sharing important secrets. However, previously, no scheme on sharing points on an elliptic curve has been devised. In responding to the problem, this paper proposes a new (t,n)(t,n) multi-point sharing scheme using self-pairing on an elliptic curve. The security of the proposed scheme was examined. Towards the end of the study, the researchers concluded that the new scheme was computationally secure if at least n−t+1n−t+1 users in the scheme are honest, and if O(lgq)O(lgq) points at most are shared. Therefore, the threshold digital signature scheme on an elliptic curve can be designed and implemented easily.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Duo Liu, Dongping Huang, Ping Luo, Yiqi Dai,