A new threshold signature scheme based on ECC and factoring

Author

Qi, Chengming ; Cui, Shoumei ; Hao, Ling

Author_Institution

Beijing Union Univ., Beijing, China

Volume

4

fYear

2009

fDate

8-9 Aug. 2009

Firstpage

550

Lastpage

553

Abstract

Most of the existing digital signature schemes were developed based on a single hard problem like factoring, discrete logarithm or elliptic curve discrete logarithm problems. In this paper, we proposed a new threshold signature scheme based on multiple hard problems namely factoring and elliptic curve discrete logarithm problems. We combined the two problems into both signing and verifying equations. The new scheme was shown to be secure against the known attacks for signature schemes. The efficiency performance of our scheme is given. Our scheme provides longer and higher security level than that scheme based on one problem.

Keywords

digital signatures; public key cryptography; digital signature schemes; discrete logarithm; elliptic curve cryptography; elliptic curve discrete logarithm problems; factoring; multiple hard problems; single hard problem; threshold signature scheme; Communication system control; Digital signatures; Educational institutions; Elliptic curve cryptography; Elliptic curves; Equations; Galois fields; Public key; Public key cryptography; Security; Discrete logarithm problem; Elliptic curve cryptography; Factoring; Threshold signature;

fLanguage

English

Publisher

ieee

Conference_Titel

Computing, Communication, Control, and Management, 2009. CCCM 2009. ISECS International Colloquium on

Conference_Location

Sanya

Print_ISBN

978-1-4244-4247-8

Type

conf

DOI

10.1109/CCCM.2009.5267528

Filename

5267528