Open AccessConstructing the 2-Element AGDS Protocol based on the Discrete Logarithm Problem
Author(s) -
Tuan Nguyen Kim,
Duy Ho Ngoc,
Nikolay A. Moldovyan
Publication year - 2021
Publication title -
international journal of network security and its applications/international journal of network security and applications
Language(s) - English
Resource type - Journals
eISSN - 0975-2307
pISSN - 0974-9330
DOI - 10.5121/ijnsa.2021.13402
Subject(s) - discrete logarithm , signature (topology) , group signature , schnorr signature , group (periodic table) , ring signature , computer science , frame (networking) , logarithm , construct (python library) , protocol (science) , elgamal signature scheme , sign (mathematics) , theoretical computer science , digital signature , blind signature , mathematics , algorithm , computer security , public key cryptography , physics , computer network , hash function , encryption , mathematical analysis , medicine , geometry , alternative medicine , pathology , quantum mechanics
It is considered a group signature scheme in frame of which different sets of signers sign electronic documents with hidden signatures and the head of the signing group generates a group signature of fixed size. A new mechanism for imbedding the information about signers into a group signature is proposed. The method provides possibilities for reducing the signature size and to construct collective signature protocols for signing groups. New group signature and collective signature protocols based on the computational difficulty of discrete logarithm are proposed.