journal article·2022Open access

New Collective Signatures Based on the Elliptic Curve Discrete Logarithm Problem

Tuan Nguyen Kim, Duy Ho Ngoc, Nikolay A. Moldovyan

Computers, Materials & Continua· Volume 73· Issue 1

Abstract

There have been many digital signature schemes were developed based on the discrete logarithm problem on a finite field. In this study, we use the elliptic curve discrete logarithm problem to build new collective signature schemes. The cryptosystem on elliptic curve allows to generate digital signatures with the same level of security as other cryptosystems but with smaller keys. To extend practical applicability and enhance the security level of the group signature protocols, we propose two new types of collective digital signature schemes based on the discrete logarithm problem on the elliptic curve: i) the collective digital signature scheme shared by several signing groups and ii) the collective digital signature scheme shared by several signing groups and several individual signers. These two new types of collective signatures have combined the advantages of group digital signatures and collective digital signatures. These signatures have a fixed size and do not depend on the number of members participating in the creation of the final collective signature. One of the advantages of the proposed collective signature protocols is that they can be deployed on top of the available public key infrastructures.
Source: openalex_inverted_index · Quality: baseline

Research context

OpenAlex topics: Cryptography and Data Security · Cryptography and Residue Arithmetic · Advanced Authentication Protocols Security

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

References (20)

Show source-provided references
1. Radack · Updated Digital Signature Standard Approved as Federal Information Processing Standard (FIPS) 186-3 · 2009 · 186
2. Blind signatures for untraceable payments
3. Camenisch · Proc. Advances in Cryptology–EUROCRYPT'94, Lecture Notes in Computer Science · 1995 · 950 · 42810.1007/BFb0053458 ↗
4. A code-based group signature scheme10.1007/s10623-016-0276-6 ↗
5. A new group signature scheme for dynamic membership10.1504/IJESDF.2016.079446 ↗
6. Group signature protocol based on masking public keys
7. Elliptic curve cryptosystems10.1090/S0025-5718-1987-0866109-5 ↗
8. Johnson · The Elliptic Curve Digital Signature Algorithm (ECDSA) · 2001
9. V. Dolmatov, A. Chuprina and I. Ustinov, “Use of GOST signature algorithms in DNSKEY and RRSIG resource records for DNSSEC,” RFC5933, pp. 1–8, 2010. [Online]. Available: https://netzikon.net/rfc/RFC5933-Use-of-GOST-Signature-Algorithms-in-DNSKEY-and-RRSIG-Resource-Records-for-DNSSEC.html/.10.17487/rfc5933 ↗
10. Blind collective signature protocol based on discrete logarithm problem
11. Vanstone · Springer · 2004
12. Collective signature protocols for signing groups
13. Popescu · Studia Univ Babes–Bolyai · 1999 · 43
14. Group signature protocol based on collective signature protocol and masking public keys mechanism
15. Bolotov · cryptography Protocols on the Elliptic Curves · 2006
16. Analysis and comparison of electronic digital signature state standards GOST R34.10-1994, GOST R34.10-2001 and GOST R34.10-2012
17. Pieprzyk · Fundamentals of Computer Security · 200310.1007/978-3-662-07324-7 ↗
18. Parallelized scalar multiplication on elliptic curves defined over optimal extension field
19. Special digital signature schemes based on GOST R 34.10-2012
20. V. Dolmatov and A. Degtyarev, “GOST R34.10-2012: Digital signature algorithm,” RFC 7091, pp. 1–20, 2013. [Online]. Available: https://datatracker.ietf.org/doc/html/rfc7091/.10.17487/rfc7091 ↗