Verifiable Threshold Cryptosystems Based on Elliptic Curve

  • Authors:

  • Yiliang Han;Xiaoyuan Yang;Jun Sun;Delong Li

  • Affiliations:

  • -;-;-;-

  • Venue:
  • ICCNMC '03 Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, verifiable (t, n) threshold ECSA signature algorithm and verifiable (t, n) threshold ECES encryption algorithm are presented according to a secret sharing scheme for Elliptic Curve, which using Lagrange Polynomial Interpolation as access structure. A group of n players share an ECC secret key. Every qualified subset of the group including t out of n players could recovery the secret key, so they can sign and decrypt as well as the whole group, while no subset of t-1 players can accomplish it. The algorithms are perfect and secureverifiable secret shared schemes. Complexity of them is less than the same schemes based on DLP.