TY - EJOU
AU - Kim, Tuan Nguyen
AU - Ngoc, Duy Ho
AU - Moldovyan, Nikolay A.
TI - Constructing Collective Signature Schemes Using Problem of Finding Roots Modulo
T2 - Computers, Materials \& Continua
PY - 2022
VL - 72
IS - 1
SN - 1546-2226
AB - 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 root in the finite ground field to build representative collective signature schemes, but the chosen modulo *p* has a special structure distinct , where is an even number and are prime numbers of equal magnitude, about . The characteristics of the proposed scheme are: i) The private key of each signer consists of 2 components (), randomly selected, but the public key has only one component () calculated by the formula and ; and ii) The generated signature consists of a set of 3 components (_{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.
KW - Computing roots; finding roots modulo; collective signature; signing collective; signing group
DO - 10.32604/cmc.2022.025653