Abstract
Verifiable (t, n) threshold ECSA (elliptic curve signature verification) signature algorithm and verifiable (t, n) threshold ECES (elliptic curve encrypt scheme) encryption algorithm are presented according to a secret sharing scheme for elliptic curve using Lagrange polynomial interpolation as access structure. A group of n players share an ECC (elliptic curve cryptosystem) secret key. Every qualified subset of the group, including t out of n players, could recover the secret key, so that 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 secure verifiable secret shared schemes and their complexity is less than the same schemes based on DLP.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.