New schemes for sharing points on an elliptic curve

Authors:
Duo Liu;Dongping Huang;Ping Luo;Yiqi Dai
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, People's Republic of China;Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, People's Republic of China;Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, People's Republic of China;Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, People's Republic of China
Venue:
Computers & Mathematics with Applications
Year:
2008

Citing 6
Cited 2

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
An explication of secret sharing schemes

Designs, Codes and Cryptography
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
How to share a secret

Communications of the ACM
Elliptic Curve Public Key Cryptosystems

Elliptic Curve Public Key Cryptosystems
A subexponential algorithm for the discrete logarithm problem with applications to cryptography

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science

Quadratic compact knapsack public-key cryptosystem

Computers & Mathematics with Applications
Improving e-payment security using Elliptic Curve Cryptosystem

Electronic Commerce Research

Quantified Score

Hi-index	0.09

Visualization

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) 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+1 users in the scheme are honest, and if O(lgq) points at most are shared. Therefore, the threshold digital signature scheme on an elliptic curve can be designed and implemented easily.