New Representative Collective Signatures Based on the Discrete Logarithm Problem
Source abstract
Abstract
The representative collective digital signature scheme allows the creation of a unique collective signature on document M that represents an entire signing community consisting of many individual signers and many different signing groups, each signing group is represented by a group leader. On document M, a collective signature can be created using the representative digital signature scheme that represents an entire community consisting of individual signers and signing groups, each of which is represented by a group leader. The characteristic of this type of letter is that it consists of three elements (U, E, S), one of which (U) is used to store the information of all the signers who participated in the formation of the collective signature on document M. While storing this information is necessary to identify the signer and resolve disputes later, it greatly increases the size of signatures. This is considered a limitation of the collective signature representing 3 elements. In this paper, we propose and build a new type of collective signature, a collective signature representing 2 elements (E, S). In this case, the signature has been reduced in size, but it contains all the information needed to identify the signer and resolve disputes if necessary. To construct the approved group signature scheme, which is the basic scheme for the proposed representative collective signature schemes, we use the discrete logarithm problem on the prime finite field. At the end of this paper, we present the security analysis of the AGDS scheme and a performance evaluation of the proposed collective signature schemes.
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Cryptography and Data Security · Privacy-Preserving Technologies in Data · Advanced Authentication Protocols Security
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References (19)
Show source-provided references
1. FIPS Publication 186-3 · 2009
2. Pieprzyk · Fundamentals of Computer Security · 200310.1007/978-3-662-07324-7 ↗
3. A public key cryptosystem suitable for digital multisignatures
4. Blind signatures based on the discrete logarithm problem10.1007/BFb0053458 ↗
5. Blind signatures for untraceable payments
6. A Code-based group signature scheme10.1007/s10623-016-0276-6 ↗
7. A new group signature scheme for dynamic membership10.1504/IJESDF.2016.079446 ↗
8. Group signature protocol based on masking public keys
9. Group signature protocol based on collective signature protocol and masking public keys mechanism
10. Collective signature protocols for signing groups
11. Blind collective signature protocol based on discrete logarithm problem
12. N. K. Tuan, H. N. Duy and N. A. Moldovyan, “Collective signature protocols for signing groups based on problem of finding roots modulo large prime number,” vol. 13, no. 4, pp. 59–69, 2021.10.5121/ijnsa.2021.13405 ↗
13. Constructing the 2-element AGDS protocol based on the discrete logarithm problem10.5121/ijnsa.2021.13402 ↗
14. Research on digital signature based on digital certificate
15. Blind signature and BMS using elliptic curves
16. Bolotov · Cryptography Protocols on the Elliptic Curves · 2006
17. The elliptic curve digital signature algorithm
18. GOST R34.10-2012: Russian Federation Standard
19. Special digital signature schemes based on GOST R 34.10-2012