Collective Signature Protocols for Signing Groups

Tuan, Nguyen Kim; Van, V. L.; Moldovyan, Dmitriy N.; Duy, H.N; Moldovyan, Alexander A.

doi:10.1007/978-981-10-7512-4_20

Cited by 3 publications

(7 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tab. 1 shows that the time cost to create and to verify the signature of the RCS schema in this article is not much more extensive than compared to CDSs in [8].…”

Section: Table 1: Time Cost Of the Rcs Schemes In This Articlementioning

confidence: 91%

“…Currently, many types of digital signatures have been researched and published such as single digital signatures (SDS), group digital signatures (GDS) [3][4][5][6], collective digital signatures (CDS) [7][8][9], single-blind digital signatures [10,11], blind collective digital signatures (BCS) [12], representative collective digital signatures (RCS) [9], . .…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Constructing Representative Collective Signature Protocols Using The GOST R34.10-1994 Standard

Kim¹,

Ngoc²,

Moldovyan³

2023

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

The representative collective digital signature, which was suggested by us, is built based on combining the advantages of group digital signature and collective digital signature. This collective digital signature schema helps to create a unique digital signature that deputizes a collective of people representing different groups of signers and may also include personal signers. The advantage of the proposed collective signature is that it can be built based on most of the well-known difficult problems such as the factor analysis, the discrete logarithm and finding modulo roots of large prime numbers and the current digital signature standards of the United States and Russian Federation. In this paper, we use the discrete logarithmic problem on prime finite fields, which has been implemented in the GOST R34.10-1994 digital signature standard, to build the proposed collective signature protocols. These protocols help to create collective signatures: Guaranteed internal integrity and fixed size, independent of the number of members involved in forming the signature. The signature built in this study, consisting of 3 components (U, R, S), stores the information of all relevant signers in the U components, thus tracking the signer and against the "disclaim of liability" of the signer later is possible. The idea of hiding the signer's public key is also applied in the proposed protocols. This makes it easy for the signing group representative to specify which members are authorized to participate in the signature creation process.

show abstract

“…Tab. 1 shows that the time cost to create and to verify the signature of the RCS schema in this article is not much more extensive than compared to CDSs in [8].…”

Section: Table 1: Time Cost Of the Rcs Schemes In This Articlementioning

confidence: 91%

Section: Introductionmentioning

confidence: 99%

Constructing Representative Collective Signature Protocols Using The GOST R34.10-1994 Standard

Kim¹,

Ngoc²,

Moldovyan³

2023

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

show abstract

“…Information from Tab. 1 shows that the time cost for signature generation and signature checking of a proposed representative signature scheme is not much larger when compared to the new collective digital signature schemes in [8].…”

Section: Tablementioning

confidence: 97%

“…These people work together to create a single signature that represents an entire signing group or a group of signatures. Currently, there are many forms of digital signatures and digital signature schemes, in order to meet many different authentication models, which have been researched, published and applied in practice such as: Single digital signatures, group digital signatures [3][4][5][6], collective digital signatures [7][8][9], blind digital signatures [10,11], blind collective digital signatures [12], representative collective signatures [13]. The types of signatures generated by a set of signers are often referred to as multi-signatures [14,15].…”

Section: Introductionmentioning

confidence: 99%

“…A representative collective signature [8,9] is formed from a signing collective consisting of: i) Many groups of members, called signing groups, each group is represented by a group manager; and ii) A number of single individuals, known as individual signers, who do not belong to any group, but are functionally equivalent to the group leaders in this collective. Thus, a single representative collective signature can authenticate all members of a multi-level functional collective who are the creators of this representative collective signature.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Constructing Collective Signature Schemes Using Problem of Finding Roots Modulo

Kim¹,

Ngoc²,

Moldovyan³

2022

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

Digital signature schemes are often built based on the difficulty of the discrete logarithm problems, of the problem of factor analysis, of the problem of finding the roots modulo of large primes or a combination of the difficult problems mentioned above. In this paper, we use the new difficult problem, which is to find the w th root in the finite ground field GF(p) to build representative collective signature schemes, but the chosen modulo p has a special structure distinct p = Nt 0 t 1 t 2 + 1, where N is an even number and t 0 , t 1 , t 2 are prime numbers of equal magnitude, about 80 bits. The characteristics of the proposed scheme are: i) The private key of each signer consists of 2 components (K 1 , K 2 ), randomly selected, but the public key has only one component (Y ) calculated by the formula Y = K w 1 1 K w 2 2 ; w 1 = t 0 t 1 and w 2 = t 0 t 2 ; and ii) The generated signature consists of a set of 3 components (e, S 1 , S 2 ). We use the technique of hiding the signer's public key Y, which is the coefficient λ generated by the group nanager, in the process of forming the group signature and representative collective signature to enhance the privacy of all members of the signing collective.

show abstract

Collective Signature Schemes Using Problem of Finding Roots Modulo

Tekleselassie

2022

j. of electron. & inf. syst.

View full text Add to dashboard Cite

Digital signature schemes in general and representative collective digital signature schemes, in particular, are often built based on the difficulty of the discrete logarithm problem on the finite field, of the discrete logarithm problem of the elliptic curve, of the problem of factor analysis, of the problem of finding the roots modulo of large primes or a combination of the difficult problems mentioned above. In this paper, we use the new difficult problem, which is to find the with root in the finite ground field GF(p) to build representative collective signature schemes, but the chosen modulo p has a special structure distinct p=Nt_0 t_1 t_2+1, where N is an even number and t0, t1, t2 are prime numbers of equal magnitude, about 80 bits. The characteristics of the proposed scheme are: i) The private key of each signer consists of 2 components (K_1, K_2), randomly selected, but the public key has only one component (Y) calculated by the formula Y= K_1^ (w_1) K_2^ (w_2); w_1 = t_0 t_1 and w_2 = t_0 t_2; and ii) The generated signature consists of a set of 3 components (e, S1, S2). We use the technique of hiding the signer's public key Y, which is the coefficient λ generated by the group manager, in the process of forming the group signature and representative collective signature to enhance the privacy of all members of the signing collective.

show abstract

Collective Signature Protocols for Signing Groups

Cited by 3 publications

References 3 publications

Constructing Representative Collective Signature Protocols Using The GOST R34.10-1994 Standard

Constructing Representative Collective Signature Protocols Using The GOST R34.10-1994 Standard

Constructing Collective Signature Schemes Using Problem of Finding Roots Modulo

Collective Signature Schemes Using Problem of Finding Roots Modulo

Contact Info

Product

Resources

About